Algorithmics
The Spirit of Computing
(Sprache: Englisch)
This award-winning best-seller addresses the fundamentals of computer science. The authors discuss the design of algorithms, their efficiency and correctness, quantum algorithms, concurrency, large systems and artificial intelligence.
Leider schon ausverkauft
versandkostenfrei
Buch
74.89 €
Produktdetails
Produktinformationen zu „Algorithmics “
This award-winning best-seller addresses the fundamentals of computer science. The authors discuss the design of algorithms, their efficiency and correctness, quantum algorithms, concurrency, large systems and artificial intelligence.
Klappentext zu „Algorithmics “
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.
Inhaltsverzeichnis zu „Algorithmics “
- Preface- Acknowledgments
PART I. PRELIMINARIES:
1. Introduction And Historical Review
2. Algorithms And Data
3. Programming Languages and Paradigms
PART II. METHODS AND ANALYSIS:
4. Algorithmic Methods
5. The Correctness of Algorithms
6. The Efficiency of Algorithms
PART III. LIMITATIONS AND ROBUSTNESS:
7. Inefficiency and Intractability
8. Noncomputability and Undecidability
9. Algorithmic Universality and Its Robustness
PART IV. RELAXING THE RULES:
10. Parallelism, Concurrency and Alternative Models or, Getting Lots Of Stuff Done at Once
11. Probabilistic Algorithms or, Getting It Done by Tossing Coins
12. Cryptography and Reliable Interaction
PART V. THE BIGGER PICTURE:
13. Software Engineering or, Getting It Done When It's Large
14. Reactive Systems or, Getting It to Behave Properly Over Time
15. Algorithmics And Intelligence
- Postscript
- Selected Solutions
- Bibliographic Notes
- Indexon And Historical Review
2. Algorithms And Data
3. Programming Languages and Paradigms
PART II. METHODS AND ANALYSIS:
4. Algorithmic Methods
5. The Correctness of Algorithms
6. The Efficiency of Algorithms
PART III. LIMITATIONS AND ROBUSTNESS:
7. Inefficiency and Intractability
8. Noncomputability and Undecidability
9. Algorithmic Universality and Its Robustness
PART IV. RELAXING THE RULES:
10. Parallelism, Concurrency and Alternative Models or, Getting Lots Of Stuff Done at Once
11. Probabilistic Algorithms or, Getting It Done by Tossing Coins
12. Cryptography and Reliable Interaction
PART V. THE BIGGER PICTURE:
13. Software Engineering or, Getting It Done When It's Large
14. Reactive Systems or, Getting It to Behave Properly Over Time
15. Algorithmics And Intelligence
Autoren-Porträt von David Harel, Yishai Feldman
David Harel has been at the Weizmann Institute of Science in Israel since 1980. He was Department Head from 1989 to 1995, and was Dean of the Faculty of Mathematics and Computer Science between 1998 and 2004. He was also co-founder of I-Logix, Inc. He received his PhD from MIT in 1978, and has spent time at IBM Yorktown Heights, and sabbaticals at Carnegie-Mellon University, Cornell University, and the University of Edinburgh. In the past he worked mainly in theoretical computer science (logic, computability, automata, database theory), and he now works mainly on software and systems engineering and on modeling biological systems. He is the inventor of statecharts and co-inventor of live sequence charts, and co-designed Statemate, Rhapsody, the Play-Engine and PlayGo. Among his awards are the ACM Karlstrom Outstanding Educator Award (1992), the Israel Prize (2004), the ACM Software System Award (2007), the Emet Prize (2010), and three honorary degrees. He is a Fellow of the ACM, the IEEE and the AAAS, and a member of the Academia Europaea and the Israel Academy of Sciences.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.iversity, and the University of Edinburgh. In the past he worked mainly in theoretical computer science (logic, computability, automata, database theory), and he now works mainly on software and systems engineering and on modeling biological systems. He is the inventor of statecharts and co-inventor of live sequence charts, and co-designed Statemate, Rhapsody, the Play-Engine and PlayGo. Among his awards are the ACM Karlstrom Outstanding Educator Award (1992), the Israel Prize (2004), the ACM Software System Award (2007), the Emet Prize (2010), and three honorary degrees. He is a Fellow of the
... mehr
ACM, the IEEE and the AAAS, and a m
... weniger
Bibliographische Angaben
- Autoren: David Harel , Yishai Feldman
- 2012, 3rd ed., 572 Seiten, Maße: 16 x 24,1 cm, Gebunden, Englisch
- Verlag: Springer
- ISBN-10: 3642272657
- ISBN-13: 9783642272653
- Erscheinungsdatum: 30.03.2012
Sprache:
Englisch
Rezension zu „Algorithmics “
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)
Kommentar zu "Algorithmics"
0 Gebrauchte Artikel zu „Algorithmics“
Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
---|
Schreiben Sie einen Kommentar zu "Algorithmics".
Kommentar verfassen