It looks like you're offline.

An edition of Algorithms and data structures (2008)

Algorithms and data structures

the basic toolbox

by Kurt Mehlhorn

1 Want to read

Cover of: Algorithms and data structures by Kurt Mehlhorn, Kurt Mehlhorn

Read

My Reading Lists:

Use this Work

Create a new list

1 Want to read

Download Options

Check nearby libraries

WorldCat

Buy this book

Last edited by ImportBot

October 4, 2021 | History

Edit

An edition of Algorithms and data structures (2008)

Algorithms and data structures

the basic toolbox

by Kurt Mehlhorn

1 Want to read

The design and analysis of basic algorithms that should be part of every programmer's toolkit.

Publish Date

2008

Publisher

Springer

Language

English

Pages

300

Check nearby libraries

WorldCat

Buy this book

Previews available in: English

Edition	Availability
1 Algorithms and data structures: the basic toolbox 2008, Springer Hardcover in English 3540779779 9783540779773	aaaa Read Listen Locate

Add another edition?

Book Details

Table of Contents

1. Appetizer: Integer Arithmetics

1.2. Multiplication: The School Method

1.3. Result Checking

1.4. A Recursive version of the School Method

1.5. Karatsuba Multiplication

1.6. Algorithm Engineering

1.7. The Programs

1.8. Proofs of Lemma 1.5 and Theorem 1.7

1.9. Implementation Notes

1.10. Historical Notes and Further Findings

2. Introduction

2.1. Asymptotic Notation

2.2. The Machine Model

2.3. Pseudocode

2.4. Designing Correct Algorithms and Programs

2.5. An Example - Binary Search

2.6. Basic Algorithm Analysis

2.7. Average-Case Analysis

2.8. Randomized Algorithms

2.11. Implementation Notes

2.12. Historical Notes and Further Findings

3. Representing Sequences by Arrays and Linked Lists

3.1. Linked Lists

3.2. Unbounded Arrays

3.3. *Amortized Analysis

3.4. Stacks and Queues

3.5. Lists Versus Arrays

3.6. Implementation Notes

3.7. Historical Notes and Further Findings

4. Hash Tables and Associative Arrays

4.1. Hashing and Chaining

4.2. Universal Hashing

4.3. Hashing with Linear Probing

4.4. Chaining Versus Linear Probing

4.5. *Perfect Hashing

4.6. Implementation Notes

4.7. Historical Notes and Further Findings

5. Sorting and Selection

5.1. Simple Sorters

5.2. Mergesort - an O(n log n) Sorting Algorithm

5.3. A Lower Bound

5.6. Breaking the Lower Bound

5.7. *External Sorting

5.8. Implementation Notes

5.9. Historical Notes and Further Findings

6. Priority Queues

6.1. Binary Heaps

6.2. Addressable Priority Queues

6.3. *External Memory

6.4. Implementation Notes

6.5. Historical Notes and Further Findings

7. Sorted Sequences

7.1. Binary Search Trees

7.2. (a, b)-Trees and Red-Black Trees

7.3. More Operations

7.4. Amortized Analysis of Update Operations

7.5. Augmented Search Trees

7.6. Implementation Notes

7.7. Historical Notes and Further Findings

8. Graph Representation

8.1. Unordered Edge Sequences

8.2. Adjacency Arrays - Static Graphs

8.3. Adjacency Lists - Dynamic Graphs

8.4. The Adjacency Matrix Representation

8.5. Implicit Representations

8.6. Implementation Notes

8.7. Historical Notes and Further Findings

9. Graph Traversal

9.1. Breadth-First Search

9.2. Depth-First Search

9.3. Implementation Notes

9.4. Historical Notes and Further Findings

10. Shortest Paths

10.1. From Basic Concepts to a Generic Algorithm

10.2. Directed Acyclic Graphs

10.3. Nonnegative Edge Costs (Dijkstra's Algorithm)

10.4. *Average-Case Analysis of Dijkstra's Algorithm

10.5. Monotone Integer Priority Queues

10.6. Arbitrary Edge Costs (Bellman-Ford Algorithm)

10.7. All-Pairs Shortest Paths and Node Potentials

10.8. Shortest-Path Queries

10.9. Implementation Notes

10.10. Historical Notes and Further Findings

11. Minimum Spanning Trees

11.1. Cut and Cycle Properties

11.2. The Jarnik-Prim Algorithm

11.3. Kruskal's Algorithm

11.4. The Union-Find Data Structure

11.5. *External Memory

11.6. Applications

11.7. Implementation Notes

11.8. Historical Notes and Further Findings

12. Generic Approaches to Optimization

12.1. Linear Programming - a Black-Box Solver

12.2. Greedy Algorithms - Never Look Back

12.3. Dynamic Programming - Building It Piece by Piece

12.4. Systematic Search - When in Doubt, Use Brute Force

12.5. Local Search - Think Globally, Act Locally

12.6. Evolutionary Algorithms

12.7. Implementation Notes

12.8. Historical Notes and Further Findings

A.1. Mathematical Symbols

A.2. Mathematical Concepts

A.3. Basic Probability Theory

A.4. Useful Formulae

Edition Notes

Includes bibliographical references (p. [273]-283) and index.

Published in: Berlin

Classifications

Library of Congress: QA76.9.D35 M47 2008, QA75.5-76.95

The Physical Object

Format: Hardcover
Pagination: xii, 300 p. :
Number of pages: 300

Edition Identifiers

Open Library: OL21897978M
Internet Archive: algorithmsdatast00mehl_045
ISBN 13: 9783540779773, 9783540779780
LCCN: 2008926816
OCLC/WorldCat: 221217367
LibraryThing: 7819176
Goodreads: 3222432

Work Identifiers

Work ID: OL6777805W

Community Reviews (0)

No community reviews have been submitted for this work.

Lists

History

Created December 10, 2009
5 revisions

Download catalog record: RDF / JSON

October 4, 2021	Edited by ImportBot	import existing book
June 28, 2019	Edited by MARC Bot	import existing book
December 4, 2010	Edited by Open Library Bot	Added subjects from MARC records.
July 31, 2010	Edited by 96.242.73.8	added description
December 10, 2009	Created by WorkBot	add works page