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.
FREE shipping within United Kingdom
Destination, rates & speedsSeller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New. Seller Inventory # 33220070-n
Quantity: Over 20 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: 15 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: 15 available
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Hardback. Condition: New. New copy - Usually dispatched within 4 working days. 815. Seller Inventory # B9781108496827
Quantity: Over 20 available
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9781108496827_new
Quantity: Over 20 available
Seller: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
Condition: New. Brand New. Soft Cover International Edition. Different ISBN and Cover Image. Priced lower than the standard editions which is usually intended to make them more affordable for students abroad. The core content of the book is generally the same as the standard edition. The country selling restrictions may be printed on the book but is no problem for the self-use. This Item maybe shipped from US or any other country as we have multiple locations worldwide. Seller Inventory # ABNR-16789
Quantity: 5 available
Seller: CitiRetail, Stevenage, United Kingdom
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 our UK warehouse or from our Australian or US warehouses, depending on stock availability. Seller Inventory # 9781108496827
Quantity: 1 available
Seller: Basi6 International, Irving, TX, U.S.A.
Condition: Brand New. New.SoftCover International edition. Different ISBN and Cover image but contents are same as US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Seller Inventory # ABEJUNE24-406444
Quantity: 20 available
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Hardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days. Seller Inventory # C9781108496827
Quantity: Over 20 available
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: As New. Unread book in perfect condition. Seller Inventory # 33220070
Quantity: Over 20 available