Algorithmics
Springer Berlin (Verlag)
978-3-642-27265-3 (ISBN)
Computer science is the science of the future, and already underlies every facet of business and technology, and much of our everyday lives. In addition, it will play a crucial role in the science the 21st century, which will be dominated by biology and biochemistry, similar to the role of mathematics in the physical sciences of the 20th century. In this award-winning best-seller, the author and his co-author focus on the fundamentals of computer science, which revolve around the notion of the algorithm. They discuss the design of algorithms, and their efficiency and correctness, the inherent limitations of algorithms and computation, quantum algorithms, concurrency, large systems and artificial intelligence. Throughout, the authors, in their own words, stress the 'fundamental and robust nature of the science in a form that is virtually independent of the details of specific computers, languages and formalisms'.
This version of the book is published to celebrate 25 years since its first edition, and in honor of the Alan M. Turing Centennial year. Turing was a true pioneer of computer science, whose work forms the underlying basis of much of this book.
Yishai Feldman received his PhD from the Weizmann Institute of Science in 1986. He was a faculty member at Tel Aviv University and the Interdisciplinary Center in Herzliya. He is now at the IBM Research lab in Haifa, Israel, where he leads research on tools for program understanding and transformation.
Preliminaries.- and Historical Review.- Algorithms and Data.- Programming Languages and Paradigms.- Methods and Analysis.- Algorithmic Methods.- The Correctness of Algorithms.- The Efficiency of Algorithms.- Limitations and Robustness.- Inefficiency and Intractability.- Noncomputability and Undecidability.- Algorithmic Universality and Its Robustness.- Relaxing the Rules.- Parallelism, Concurrency, and Alternative Models.- Probabilistic Algorithms.- Cryptography and Reliable Interaction.- The Bigger Picture.- Software Engineering.- Reactive Systems.- Algorithmics and Intelligence.
From the reviews of the third edition:
"This book should be on any short list for a central course in computer science. It is designed to provide a uniform background on which all students might draw. It has a good-humored, easy style, which would make any reader unwilling to close the book after opening it anywhere. All computer scientists should have this book. ... the bibliography is organized in a convenient chapter-by-chapter form, which makes the book useful for advanced work, and the exercises will help instructors identify capable students." (Harvey Cohn, ACM Computing Reviews, August, 2012)
"This is a reprint of the 3rd edition on the occasion of the 25th year of the existence of the book; it is also intended to honor Alan Turing's 100th birthday. ... it is highly readable, even if one is largely acquainted with the field. It is very well written, containing many illustrative examples, suited also for the non-specialist." (Gunther Schmidt, Zentralblatt MATH, Vol. 1243, 2012)
| Erscheint lt. Verlag | 30.3.2012 |
|---|---|
| Zusatzinfo | XXII, 572 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 1015 g |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Mathematik / Informatik ► Mathematik ► Analysis | |
| Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
| Schlagworte | Algorithmen • Algorithmics • algorithms • Artificial Intelligence • Computability • computing • Concurrency • cryptography • programming • Programming language • Software engineering |
| ISBN-10 | 3-642-27265-7 / 3642272657 |
| ISBN-13 | 978-3-642-27265-3 / 9783642272653 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
