Feldman / Harel | Algorithmics | Buch | 978-3-642-44135-6 | sack.de

Buch, Englisch, 572 Seiten, Previously published in hardcover, Format (B × H): 155 mm x 235 mm, Gewicht: 890 g

Feldman / Harel

Algorithmics

The Spirit of Computing
Third Auflage 1987
ISBN: 978-3-642-44135-6
Verlag: Springer

The Spirit of Computing

Buch, Englisch, 572 Seiten, Previously published in hardcover, Format (B × H): 155 mm x 235 mm, Gewicht: 890 g

ISBN: 978-3-642-44135-6
Verlag: Springer


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 21 century, which will be dominated by biology and biochemistry, similar to the role of mathematics in the physical sciences of the 20 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.

Feldman / Harel Algorithmics jetzt bestellen!

Zielgruppe


Lower undergraduate

Weitere Infos & Material


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.


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.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.