An edition of Data structures, algorithms, and performance
(1992)
Data structures, algorithms, and performance
by Derick Wood
- 1 Want to read
Share
×Close
This edition doesn't have a description yet. Can you add one?
Check nearby libraries
Buy this book
Previews available in: English
| Edition | Availability |
|---|---|
1
Data structures, algorithms, and performance
1993, Addison-Wesley
in English
0201521482 9780201521481
|
aaaa
|
2
Data structures, algorithms and performance
1992, Addison-Wesley
in English
0201521482 9780201521481
|
zzzz
|
Book Details
Table of Contents
1.1. Data-Structure Design
1.2. The Reversal Problem
1.3. Data Abstraction Revisited
1.4. ADT Specification
1.5. QUEUE Representations
1.6. STACK Representations
1.7. Summary
1.8. History
Exercises
2.1. Empirical Measurement
2.2. Simulational Measurement
2.3. Analytical Measurement
2.4. Performance Comparison and Evaluation
2.5. The Analysis of Recursive Subprograms
2.6. Summary
2.7. History
Exercises
3.1. LIST Specification
3.2. Copying and Equality Testing
3.3. Polynomial Manipulation
3.4. LIST Representations
3.5. The SIMPLIST ADT
3.6. Performance Reports
3.7. Element and Window Assumptions
3.8. Summary
3.9. History
Exercises
4.1. MAP and ARRAY Specification
4.2. MAP Representations
4.3. ARRAY Representations
4.4. Sparse-Array Representations
4.5. Performance Reports
4.6. Summary
4.7. History
Exercises
5.1. TREE Definitions
5.2. BINTREE, TREE, and ORCHARD Specification
5.3. Tree Traversals
5.4. Binary-Tree Display
5.5. BINTREE Representations
5.6. TREE Representations
5.7. Performance Reports
5.8. Summary
5.9. History
Exercises
6.1. Text, Codes, and Compression
6.2. Spell Checking and Tries
6.3. Arrays Defined at Execution-Time
6.4. Summary
6.5. History
Exercises
7.1. STRING Specification
7.2. Pattern Matching
7.3. Suffix and Patricia Tries
7.4. Minimum Edit Distance
7.5. Adaptive Data Compression
7.6. STRING Representations
7.7. Summary
7.8. History
Exercises
8.1. SET, TABLE, and DICTIONARY Specifications
8.2. SET Representations
8.3. TABLE Representations
8.4. DICTIONARY Representations
8.5. Search Trees and Dictionaries
8.6. Performance Reports
8.7. Summary
8.8. History
Exercises
9.1. Hashed Representations of TABLE
9.2. Bucketing and Separate Chaining
9.3. Open Addressing
9.4. Dynamic Tables
9.5. External Tables
9.6. Performance Reports
9.7. Summary
9.8. History
Exercises
10.1. Optimal Binary Search Trees
10.2. Red-Black Trees
10.3. Splay Search Trees
10.4. B+-Trees
10.5. Performance Reports
10.6. Summary
10.7. History
Exercises
11.1. PRIORITY QUEUE Specification
11.2. PRIORITY QUEUE Representations
11.3. Priority Search Queues
11.4. Summary
11.5. History
Exercises
12.1. Comparison-based Sorting
12.2. Sorting: A Lower Bound
12.3. Digital Sorting
12.4. Adaptive Sorting
12.5. External Sorting
12.6. Performance Reports
12.7. Summary
12.8. History
Exercises
13.1. GRAPH and DIGRAPH Specifications
13.2. GRAPH and DIGRAPH Representations
13.3. Digraph Algorithms
13.4. Graph Algorithms
13.5. Memory Management
13.6. Performance Reports
13.7. Summary
13.8. History
Exercises
14.1. PARTITION Specification
14.2. Representations in Particular
14.3. Representations in General
14.4. Back to the Past
14.5. Performance Reports
14.6. Summary
14.7. History
Exercises
15.1. Skip Lists
15.2. Quad Trees
15.3. k-d Trees
15.4. Grid Files
15.5. Segment Trees, Range Trees, and Segment Intersection
15.6. Hierarchical Trees and Rectangles
15.7. Dynamization
15.8. Persistence
Exercises
Edition Notes
Includes bibliographical references (p. 571-581) and index.
Classifications
The Physical Object
Edition Identifiers
Work Identifiers
Source records
Community Reviews (0)
Lists
History
- Created April 1, 2008
- 9 revisions
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
| September 22, 2025 | Edited by Drini | Add TOC from Tocky |
| March 20, 2024 | Edited by Scott365Bot | Linking back to Internet Archive. |
| December 6, 2022 | Edited by ImportBot | import existing book |
| November 13, 2020 | Edited by MARC Bot | import existing book |
| April 1, 2008 | Created by an anonymous user | Imported from Scriblio MARC record |