Book: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein «Introduction to Algorithms»
Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor. The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas... Издательство: "The MIT Press" (2009) Формат: 205x230, 1312 стр.
ISBN: 9780262533058 Купить за 7790 руб на Озоне |
Clifford Stein
Clifford Stein | |
---|---|
Residence | U.S. |
Nationality | American |
Fields | Computer Science |
Institutions | Columbia University Dartmouth College |
Alma mater | Massachusetts Institute of Technology Princeton University |
Clifford Stein, a computer scientist, is currently a professor of industrial engineering and operations research at Columbia University in New York, NY, where he also holds an appointment in the Department of Computer Science. Stein is chair of the Industrial Engineering and Operations Research Department at Columbia University. Prior to joining Columbia, Stein was a professor at Dartmouth College in New Hampshire.
Stein's research interests include the design and analysis of algorithms, combinatorial optimization, operations research, network algorithms, scheduling, algorithm engineering and computational biology.
Stein has published many influential papers in the leading conferences and journals in his fields of research, and has occupied a variety of editorial positions including in the journals ACM Transactions on Algorithms, Mathematical Programming, Journal of Algorithms, SIAM Journal on Discrete Mathematics and Operations Research Letters. His work has been funded by the National Science Foundation and the Sloan Foundation.
Stein is the winner of several prestigious awards including an NSF Career Award, an Alfred Sloan Research Fellowship and the Karen Wetterhahn Award for Distinguished Creative or Scholarly Achievement. He is also the co-author of two textbooks:
- Introduction to Algorithms, with T. Cormen, C. Leiserson and R. Rivest, which is currently the best-selling textbook in algorithms and has been translated into 8 languages.
- Discrete Math for Computer Science, with Ken Bogart and Scot Drysdale, which is a new textbook that covers discrete math at an undergraduate level.
Stein earned his B.S.E. from Princeton University in 1987, a Master of Science from The Massachusetts Institute of Technology in 1989, and a PhD also from the Massachusetts Institute of Technology in 1992. In recent years, Stein has built up close ties with the Norwegian research community which earned him an honorary doctorate from the University of Oslo (May 2010).
Bibliography
- Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2001). Introduction to Algorithms (second ed.). MIT Press and McGraw-Hill. ISBN 0-262-53196-8.
External links
- American computer scientists
- Columbia University faculty
- Massachusetts Institute of Technology alumni
- Princeton University alumni
- Computer science teachers
- Living people
Источник: Clifford Stein
Другие книги схожей тематики:
Автор | Книга | Описание | Год | Цена | Тип книги |
---|---|---|---|---|---|
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein | Introduction to Algorithms | Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad… — @The MIT Press, @(формат: 205x230, 1312 стр.) @ @ @ Подробнее... | 2009 | 7790 | бумажная книга |
Konyukhov Alexander | Introduction to Computational Contact Mechanics. A Geometrical Approach | Introduction to Computational Contact Mechanics: A Geometrical Approach covers the fundamentals of computational contact mechanics and focuses on its practical implementation. Part one of this… — @John Wiley&Sons Limited, @ @ @ @ Подробнее... | 9365.69 | электронная книга | |
Luca Massaron | Algorithms For Dummies | Discover how algorithms shape and impact our digital world All data, big or small, starts with algorithms. Algorithms are mathematical equations that determine what we see—based on our likes… — @John Wiley&Sons Limited (USD), @ @ @ @ Подробнее... | 1950.53 | электронная книга | |
Vijay Garg K. | Introduction to Lattice Theory with Computer Science Applications | A computational perspective on partial order and lattice theory, focusing on algorithms and their applications This book provides a uniform treatment of the theory and applications of lattice theory… — @John Wiley&Sons Limited, @ @ @ @ Подробнее... | 7335.57 | электронная книга | |
Mohamed Wahbi | Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems | DisCSP (Distributed Constraint Satisfaction Problem) is a general framework for solving distributed problems arising in Distributed Artificial Intelligence. A wide variety of problems in artificial… — @John Wiley&Sons Limited, @ @ @ @ Подробнее... | 6254.98 | электронная книга | |
Hashiguchi Koichi | Introduction to Finite Strain Theory for Continuum Elasto-Plasticity | Comprehensive introduction to finite elastoplasticity, addressing various analytical and numerical analyses&including state-of-the-art theories Introduction to Finite Elastoplasticity presents… — @John Wiley&Sons Limited, @ @ @ @ Подробнее... | 12487.58 | электронная книга | |
Raffaele Persico | Introduction to Ground Penetrating Radar. Inverse Scattering and Data Processing | A real-world guide to practical applications of ground penetrating radar (GPR) The nondestructive nature of ground penetrating radar makes it an important and popular method of subsurface imaging… — @John Wiley&Sons Limited, @ @ @ @ Подробнее... | 9575.15 | электронная книга | |
Lawrence Dworsky N. | Introduction to Numerical Electrostatics Using MATLAB | Readers are guided step by step through numerous specific problems and challenges, covering all aspects of electrostatics with an emphasis on numerical procedures. The author focuses on practical… — @John Wiley&Sons Limited, @ @ @ @ Подробнее... | 7177.33 | электронная книга | |
Anna Forster | Introduction to Wireless Sensor Networks | Explores real-world wireless sensor network development, deployment, and applications Presents state-of-the-art protocols and algorithms Includes end-of-chapter summaries, exercises, and references… — @John Wiley&Sons Limited, @ @ @ @ Подробнее... | 8879.91 | электронная книга | |
Xin-She Yang | Engineering Optimization. An Introduction with Metaheuristic Applications | An accessible introduction to metaheuristics and optimization, featuring powerful and modern algorithms for application across engineering and the sciences From engineering and computer science to… — @John Wiley&Sons Limited, @ @ @ @ Подробнее... | 11629.06 | электронная книга | |
Stanislaw H. Zak | An Introduction to Optimization | Praise for the Third Edition«. . . guides and leads the reader through the learning path . . . [e]xamples are stated very clearly and the results are presented with attention to detail.» —MAA Reviews… — @John Wiley&Sons Limited, @ @ @ @ Подробнее... | 9806.65 | электронная книга | |
Wagner Kevin | Proportionate-type Normalized Least Mean Square Algorithms | The topic of this book is proportionate-type normalized least mean squares (PtNLMS) adaptive filtering algorithms, which attempt to estimate an unknown impulse response by adaptively giving gains… — @John Wiley&Sons Limited, @ @ @ @ Подробнее... | 7878.89 | электронная книга | |
Omid Bozorg-Haddad | Meta-heuristic and Evolutionary Algorithms for Engineering Optimization | A detailed review of a wide range of meta-heuristic and evolutionary algorithms in a systematic manner and how they relate to engineering optimization problems This book introduces the main… — @John Wiley&Sons Limited, @ @ @ @ Подробнее... | 10424.97 | электронная книга | |
Rod Stephens | Essential Algorithms. A Practical Approach to Computer Algorithms | A friendly and accessible introduction to the most useful algorithms Computer algorithms are the basic recipes for programming. Professional programmers need to know how to use algorithms to solve… — @John Wiley&Sons Limited, @ @ @ @ Подробнее... | 4632.99 | электронная книга | |
Mark Daskin S. | Network and Discrete Location. Models, Algorithms, and Applications | Praise for the First Edition This book is refreshing to read since it takes an important topic… and presents it in a clear and concise manner by using examples that include visual presentations of… — @John Wiley&Sons Limited, @ @ @ @ Подробнее... | 11316.87 | электронная книга |
Look at other dictionaries:
Introduction to Algorithms — is a book by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. It is used as the textbook for algorithms courses at many universities.Cormen teaches at Dartmouth College, Rivest and Leiserson teach at MIT, and Stein… … Wikipedia
Convex hull algorithms — Algorithms that construct convex hulls of various objects have a broad range of applications in mathematics and computer science, see Convex hull applications . In computational geometry, numerous algorithms are proposed for computing the convex… … Wikipedia
Analysis of algorithms — To analyze an algorithm is to determine the amount of resources (such as time and storage) necessary to execute it. Most algorithms are designed to work with inputs of arbitrary length. Usually the efficiency or running time of an algorithm is… … Wikipedia
Ant colony optimization algorithms — Ant behavior was the inspiration for the metaheuristic optimization technique. In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be… … Wikipedia
Navigational Algorithms — is a source of information whose purpose is to make available the scientific part of the art of navigation, containing specialized articles and software that implements the various procedures of calculus. The topics covered are: Celestial… … Wikipedia
Standard algorithms — In elementary arithmetic, a standard algorithm or method is an efficient manual method of computation which yields one correct answer, and has been traditionally taught over a long period of time. These methods vary somewhat by nation and time,… … Wikipedia
Cryptanalysis of TIA's Common Cryptographic Algorithms — In 1992, the TR 45 working group within the Telecommunications Industry Association (TIA) developed a standard for integration of cryptographic technology into tomorrow s digital cellular systems [TIA92] , which has been updated at least once… … Wikipedia
List of books in computational geometry — This is a list of books in computational geometry. There are two major, largely nonoverlapping categories: *Combinatorial computational geometry, which deals with collections of discrete objects or defined in discrete terms: points, lines,… … Wikipedia
Dynamic programming — For the programming paradigm, see Dynamic programming language. In mathematics and computer science, dynamic programming is a method for solving complex problems by breaking them down into simpler subproblems. It is applicable to problems… … Wikipedia
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Distributed computing — is a field of computer science that studies distributed systems. A distributed system consists of multiple autonomous computers that communicate through a computer network. The computers interact with each other in order to achieve a common goal … Wikipedia