Suche ›

The Power of Algorithms

Inspiration and Examples in Everyday Life

Springer Berlin,
42,79 € Lieferbar in 5-7 Tagen
Dieses Produkt ist auch verfügbar als:


This book will help readers design and construct algorithms to solve problems. It features many application examples.


Titel: The Power of Algorithms
Autoren/Herausgeber: Giorgio Ausiello, Rossella Petreschi (Hrsg.)
Ausgabe: Softcover reprint of the original 1st ed. 2013

ISBN/EAN: 9783662523667

Seitenzahl: 255
Format: 23,5 x 15,5 cm
Produktform: Taschenbuch/Softcover
Gewicht: 421 g
Sprache: Englisch

Giorgio Ausiello is Professor Emeritus in the Dipartimento di Ingegneria Informatica, Automatica e Gestionale, Università di Roma "La Sapienza". He has coauthored numerous formal academic journal and conference publications, and his book publications include the Springer title "Complexity and Approximation" published in 2000. He is the Editor-in-Chief of the leading journal Elsevier journal "Theoretical Computer Science", Part A, and co-Editor-in-Chief of the Springer LNCS series "Advanced Research in Computing and Software Science". He has chaired many related conferences and research groups, and he was a founding member of the European Association for Theoretical Computer Science (EATCS), and its President from 2006 to 2009. His main research interests include on-line algorithms, approximation algorithms, dynamic graph algorithms, optimization problems in vehicle routing and logistics, and streaming algorithms; he has also researched and published on programming theorys, computational complexity, and database theory. Rossella Petreschi is Professor in the Dipartimento di Informatica, Università di Roma "La Sapienza", where she was a founding faculty member and the director from 2003 to 2009. She cofounded the International Conference on Algorithms and Complexity (CIAC), and she coauthored many formal academic journal and conference publications. Her research interests include algorithm design and analysis, parallel and distributed computing, efficient solutions of graph problems, labelled tree encodings, and frequency assignments in wireless networks. She has also researched and published on graph drawing, interconnection topologies and experimental algorithmics. Many of her former students occupy key positions in industry and research.

To examine, analyze, and manipulate a problem to the point of designing an algorithm for solving it is an exercise of fundamental value in many fields. With so many everyday activities governed by algorithmic principles, the power, precision, reliability and speed of execution demanded by users have transformed the design and construction of algorithms from a creative, artisanal activity into a full-fledged science in its own right. This book is aimed at all those who exploit the results of this new science, as designers and as consumers.  The first chapter is an overview of the related history, demonstrating the long development of ideas such as recursion and more recent formalizations such as computability. The second chapter shows how the design of algorithms requires appropriate techniques and sophisticated organization of data. In the subsequent chapters the contributing authors present examples from diverse areas – such as routing and networking problems, Web search, information security, auctions and games, complexity and randomness, and the life sciences – that show how algorithmic thinking offers practical solutions and also deepens domain knowledge. The contributing authors are top-class researchers with considerable academic and industrial experience; they are also excellent educators and communicators and they draw on this experience with enthusiasm and humor. This book is an excellent introduction to an intriguing domain and it will be enjoyed by undergraduate and postgraduate students in computer science, engineering, and mathematics, and more broadly by all those engaged with algorithmic thinking. - Newsletter
Möchten Sie sich für den Newsletter anmelden?

Bitte geben Sie eine gültige E-Mail-Adresse ein.
Lieber nicht