 Shopping Bag ( 0 items )

All (14) from $47.95

New (12) from $59.99

Used (2) from $47.95
More About This Textbook
Overview
A thorough overview of the primary techniques and models used in the mathematical analysis of algorithms. This book draws upon classical mathematical material from discrete mathematics, elementary real analysis, and combinations and discusses properties of discrete structures and covers the analysis of a variety of classic forting, searching, and string processing algorithms.
Editorial Reviews
D. E. Knuth
People who analyze algorithms have double happiness. First of all they experience the sheer beauty of elegant mathematical patterns that surround elegant computational procedures. Then they receive a practical payoff when their theories make it possible to get other jobsdone more quickly and more economically.... The appearance of this longawaited [book] is therefore most welcome. Its authors are not only worldwide leaders of the field, they also are masters of exposition.Booknews
An introduction to the primary techniques used in the mathematical analysis of algorithms, intended as a textbook in an upperlevel course on mathematical analysis of algorithms or for a course in discrete mathematics for computer scientists. Material is drawn from discrete mathematics, elementary real analysis, and combinatorics, as well as algorithms and data structures. Annotation c. Book News, Inc., Portland, OR (booknews.com)Product Details
Related Subjects
Meet the Author
Robert Sedgewick is the William O. Baker Professor of Computer Science at Princeton University. He is a Director of Adobe Systems and has served on the research staffs at Xerox PARC, IDA, and INRIA. He earned his Ph.D from Stanford University under Donald E. Knuth.
About Philippe Flajolet The late Philippe Flajolet was a Senior Research Director at INRIA, Rocquencourt, where he created and led the ALGO research group, attracting visiting researchers from all over the world. He is celebrated for having opened new lines of research in the analysis of algorithms, having developed powerful new methods, and having solved difficult, open problems. Dr. Flajolet taught at Ecole Polytechnique and Princeton University; he also held visiting positions at Waterloo University, Stanford University, the University of Chile, the Technical University of Vienna, IBM, and Bell Laboratories. He received several prizes, including the Grand Science Prize of UAP (1986), the Computer Science Prize of the French Academy of Sciences (1994), and the Silver Medal of CNRS (2004). He was elected a Member of the Academia Europaea in 1995 and a Member (Fellow) of the French Academy of Sciences in 2003.
Phillipe passed away suddenly and unexpectedly a few months ago.
Read an Excerpt
Preparation
Related books
How to use this book
Table of Contents
Preface
Preparation
Related books
How to use this book