Focuses on the interplay between algorithm design and the underlying computational models.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
Condizione: 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. Codice articolo ABNR-7512
Quantità: 5 disponibili
Da: SMASS Sellers, IRVING, TX, U.S.A.
Condizione: New. Brand New, Softcover edition. This item may ship from the US or our Overseas warehouse depending on your location and stock availability. Codice articolo ASNT3-7512
Quantità: 5 disponibili
Da: UK BOOKS STORE, London, LONDO, Regno Unito
Paperback. Condizione: New. Brand New! Fast Delivery This is an International Edition and ship within 24-48 hours. Deliver by FedEx and Dhl, & Aramex, UPS, & USPS and we do accept APO and PO BOX Addresses. Order can be delivered worldwide within 7-10 days and we do have flat rate for up to 2LB. Extra shipping charges will be requested if the Book weight is more than 5 LB. This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability. Codice articolo AD 9781108721998
Quantità: 20 disponibili
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Paperback. Condizione: new. Paperback. 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. Codice articolo 9781108721998
Quantità: 1 disponibili
Da: CitiRetail, Stevenage, Regno Unito
Paperback. Condizione: new. Paperback. 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. Codice articolo 9781108721998
Quantità: 1 disponibili
Da: AussieBookSeller, Truganina, VIC, Australia
Paperback. Condizione: new. Paperback. 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 Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. Codice articolo 9781108721998
Quantità: 1 disponibili