The text covers important algorithm design techniques, such as greedy algorithms, dynamic programming, and divide-and-conquer, and gives applications to contemporary problems. Techniques including Fast Fourier transform, KMP algorithm for string matching, CYK algorithm for context free parsing and gradient descent for convex function minimization are discussed in detail. The book's emphasis is on computational models and their effect on algorithm design. It gives insights into algorithm design techniques in parallel, streaming and memory hierarchy computational models. The book also emphasizes the role of randomization in algorithm design, and gives numerous applications ranging from data-structures such as skip-lists to dimensionality reduction methods.
"synopsis" may belong to another edition of this title.
Sandeep Sen is Professor in the department of Computer Science and Engineering, Indian Institute of Technology (IIT), Delhi. He received his Ph.D. from Duke University, North Carolina, and M.S. from University of California, Santa Barabara. Prior to joining IIT Delhi, he served as a post-doctoral researcher at Bell Laboratories, Murray Hill, New Jersey and at Duke University, North Carolina. He served as visiting researcher at many reputed institutes including Max-Planck-Institut für Informatik, Germany, IBM Research Lab, Microsoft Research Lab, University of Newcastle, Australia, University of North Carolina, Chapel Hill, University of Connecticut and Simon Fraser University, Vancouver. With more than twenty-five years of teaching experience, his areas of interest include randomized algorithms, computational geometry and graph algorithms.
Amit Kumar is Professor in the department of Computer Science and Engineering, Indian Institute of Technology (IIT) Delhi. He received his Ph.D. from Cornell University, New York. Prior to joining IIT Delhi, he worked as a member of technical staff at Bell Laboratories, New Jersey and has held several visiting professor positions at Microsoft Research India, IBM Research India and Max-Planck-Institut für Informatik, Germany. He has published over eighty research articles and holds five patents. His areas of interest include design of algorithms, approximation algorithms, computer networks and network management and routing.
"About this title" may belong to another edition of this title.
£ 4.99 shipping from United Kingdom to U.S.A.
Destination, rates & speedsSeller: AwesomeBooks, Wallingford, United Kingdom
hardcover. Condition: Very Good. Design and Analysis of Algorithms: A Contemporary Perspective This book is in very good condition and will be shipped within 24 hours of ordering. The cover may have some limited signs of wear but the pages are clean, intact and the spine remains undamaged. This book has clearly been well maintained and looked after thus far. Money back guarantee if you are not satisfied. See all our books here, order more than 1 book and get discounted shipping. . Seller Inventory # 7719-9781108496827
Quantity: 1 available
Seller: Bahamut Media, Reading, United Kingdom
hardcover. Condition: Very Good. Shipped within 24 hours from our UK warehouse. Clean, undamaged book with no damage to pages and minimal wear to the cover. Spine still tight, in very good condition. Remember if you are not happy, you are covered by our 100% money back guarantee. Seller Inventory # 6545-9781108496827
Quantity: 1 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 33220070-n
Quantity: Over 20 available
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Hardcover. Condition: new. Hardcover. The text covers important algorithm design techniques, such as greedy algorithms, dynamic programming, and divide-and-conquer, and gives applications to contemporary problems. Techniques including Fast Fourier transform, KMP algorithm for string matching, CYK algorithm for context free parsing and gradient descent for convex function minimization are discussed in detail. The book's emphasis is on computational models and their effect on algorithm design. It gives insights into algorithm design techniques in parallel, streaming and memory hierarchy computational models. The book also emphasizes the role of randomization in algorithm design, and gives numerous applications ranging from data-structures such as skip-lists to dimensionality reduction methods. A valuable text in the field of computer science and engineering, covering fundamental concepts and recent advancements. To help the reader to design/redesign algorithms for their requirements rather than be overawed by the challenges of a new framework. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9781108496827
Quantity: 1 available
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # FM-9781108496827
Quantity: 9 available
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. Seller Inventory # 26376288852
Quantity: 1 available
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # FM-9781108496827
Quantity: 9 available
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New. Seller Inventory # ABLIING23Mar2317530285968
Quantity: Over 20 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition. Seller Inventory # 33220070
Quantity: Over 20 available
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9781108496827
Quantity: Over 20 available