Algorithms and Data Structures

The Basic Toolbox
Langbeschreibung
Algorithms are at the heart of every nontrivial computer application, and algorithmics is a modern and active area of computer science. Every computer scientist and every professional programmer should know about the basic algorithmic toolbox: structures that allow efficient organization and retrieval of data, frequently used algorithms, and basic techniques for modeling, understanding and solving algorithmic problems.
Hauptbeschreibung
Includes supplementary material: sn.pub/extras
Inhaltsverzeichnis
Appetizer: Integer Arithmetics.- Representing Sequences by Arrays and Linked Lists.- Hash Tables and Associative Arrays.- Sorting and Selection.- Priority Queues.- Sorted Sequences.- Graph Representation.- Graph Traversal.- Shortest Paths.- Minimum Spanning Trees.- Generic Approaches to Optimization.
Prof. Kurt Mehlhorn was appointed a Fellow of the ACM (1999) "for important contributions in complexity theory and in the design, analysis, and practice of combinatorial and geometric algorithms." A Professor of Computer Science at Saarland University since 1975, and a director of the Max-Planck-Institut für Informatik in Saarbrücken, he has coauthored over 250 refereed papers/articles, in collaboration with 200 researchers. Other awards include the Leibniz Award of the German Research Foundation in 1986 and the Konrad Zuse Medal of the German Society for Informatics in 1995.
ISBN-13:
9783540779773
Veröffentl:
2008
Erscheinungsdatum:
23.06.2008
Seiten:
300
Autor:
Kurt Mehlhorn
Gewicht:
639 g
Format:
244x161x25 mm
Sprache:
Englisch

64,19 €*

Lieferzeit: Sofort lieferbari
Alle Preise inkl. MwSt. | zzgl. Versand