Data Structures and Algorithms 1 by K Mehlhorn
The design and analysis of data structures and efficient algorithms has gained considerable importance in recent years. The concept of algorithm is central in computer science, and efficiency is central in the world of money. I have organized the material in three volumes and nine chapters. Vol. 1: Sorting and Searching (chapters I to I) Vol. 2: Graph Algorithms and NP-completeness (chapters IV to VI) Vol. 3: Multi-dimensional Searching and Computational G- metry (chapters VI and VI) Volumes 2 and 3 have volume 1 as a common basis but are indepen- dent from each other. Most of volumes 2 and 3 can be understood without knowing volume 1 in detail. A general kowledge of algorith- mic principles as laid out in chapter 1 or in many other books on algorithms and data structures suffices for most parts of volumes 2 and 3. The specific prerequisites for volumes 2 and 3 are listed in the prefaces to these volumes. In all three volumes we present and analyse many important efficient algorithms for the fundamental computa- tional problems in the area. Efficiency is measured by the running time on a realistic model of a computing machine which we present in chapter I. Most of the algorithms presented are very recent inven- tions; after all computer science is a very young field. There are hardly any theorems in this book which are older than 20 years and at least fifty percent of the material is younger than 10 years.-
Fundamentals of Algebraic Graph Transformation
-
Models and Algorithms of Time-Dependent Scheduling
-
Theoretical Aspects of Distributed Computing in Sensor Networks
-
Handbook of Weighted Automata
-
Coping with Selfishness in Congestion Games
-
First-Order Programming Theories
-
Restricted-Orientation Convexity
-
Fault-Tolerant Search Algorithms
-
Patterns in Permutations and Words
-
Semantic Integration of Heterogeneous Software Specifications
-
Theoretical Aspects of Local Search
-
Computability
-
Syntax-Directed Semantics
-
The Logic of Partial Information
-
Computing in Horn Clause Theories
-
Nonsequential Processes
-
Data Structures and Algorithms 3
-
Relations and Graphs
-
Fundamentals of Algebraic Specification 1
-
Iteration Theories
-
Semirings, Automata, Languages
-
Petri Nets
-
Kolmogorov Complexity and Computational Complexity
-
Temporal Logic of Programs
-
Confluent String Rewriting
-
Fundamentals of Algebraic Specification 2
-
Parsing Theory
-
Finiteness and Regularity in Semigroups and Formal Languages
-
Coloured Petri Nets
-
Algorithms in Combinatorial Geometry
-
Logics of Specification Languages
-
Graph and Model Transformation
-
Unfoldings
-
Stochastic Coalgebraic Logic
-
Process Algebras for Petri Nets
| SKU | Unavailable |
| ISBN 13 | 9783642696749 |
| ISBN 10 | 3642696740 |
| Title | Data Structures and Algorithms 1 |
| Author | K Mehlhorn |
| Series | Monographs In Theoretical Computer Science An Eatcs Series |
| Condition | Unavailable |
| Binding Type | Paperback |
| Publisher | Springer |
| Year published | 2011-12-08 |
| Number of pages | 336 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |