Data structures, algorithms, and performance
By: Derick Wood.
Publisher: Addison-Wesley
Published: 1993
Place of publication: Reading, Mass
Language: eng
Number of pages: 594
Subjects: Data structures (Computer science); Abstract data types (Computer science)
Notes: Includes bibliographical references (p. 571-581) and index.
Table of contents: label: Part I
title: Review
pagenum: 1; label: Chapter 1
title: Data Structures and Data Types
pagenum: 3; label: 1.1
title: Data-Structure Design; label: 1.2
title: The Reversal Problem; label: 1.3
title: Data Abstraction Revisited; label: 1.4
title: ADT Specification; label: 1.5
title: QUEUE Representations; label: 1.6
title: STACK Representations; label: 1.7
title: Summary; label: 1.8
title: History; title: Exercises; label: Chapter 2
title: Performance Measurement
pagenum: 41; label: 2.1
title: Empirical Measurement; label: 2.2
title: Simulational Measurement; label: 2.3
title: Analytical Measurement; label: 2.4
title: Performance Comparison and Evaluation; label: 2.5
title: The Analysis of Recursive Subprograms; label: 2.6
title: Summary; label: 2.7
title: History; title: Exercises; label: Chapter 3
title: Lists
pagenum: 87; label: 3.1
title: LIST Specification; label: 3.2
title: Copying and Equality Testing; label: 3.3
title: Polynomial Manipulation; label: 3.4
title: LIST Representations; label: 3.5
title: The SIMPLIST ADT; label: 3.6
title: Performance Reports; label: 3.7
title: Element and Window Assumptions; label: 3.8
title: Summary; label: 3.9
title: History; title: Exercises; label: Chapter 4
title: Maps and Arrays
pagenum: 117; label: 4.1
title: MAP and ARRAY Specification; label: 4.2
title: MAP Representations; label: 4.3
title: ARRAY Representations; label: 4.4
title: Sparse-Array Representations; label: 4.5
title: Performance Reports; label: 4.6
title: Summary; label: 4.7
title: History; title: Exercises; label: Part II
title: Data Structures and Data Types
pagenum: 139; label: Chapter 5
title: Trees and Forests
pagenum: 141; label: 5.1
title: TREE Definitions; label: 5.2
title: BINTREE, TREE, and ORCHARD Specification; label: 5.3
title: Tree Traversals; label: 5.4
title: Binary-Tree Display; label: 5.5
title: BINTREE Representations; label: 5.6
title: TREE Representations; label: 5.7
title: Performance Reports; label: 5.8
title: Summary; label: 5.9
title: History; title: Exercises; label: Chapter 6
title: Applications of Trees
pagenum: 185; label: 6.1
title: Text, Codes, and Compression; label: 6.2
title: Spell Checking and Tries; label: 6.3
title: Arrays Defined at Execution-Time; label: 6.4
title: Summary; label: 6.5
title: History; title: Exercises; label: Chapter 7
title: Strings
pagenum: 211; label: 7.1
title: STRING Specification; label: 7.2
title: Pattern Matching; label: 7.3
title: Suffix and Patricia Tries; label: 7.4
title: Minimum Edit Distance; label: 7.5
title: Adaptive Data Compression; label: 7.6
title: STRING Representations; label: 7.7
title: Summary; label: 7.8
title: History; title: Exercises; label: Chapter 8
title: Sets, Tables, and Dictionaries
pagenum: 249; label: 8.1
title: SET, TABLE, and DICTIONARY Specifications; label: 8.2
title: SET Representations; label: 8.3
title: TABLE Representations; label: 8.4
title: DICTIONARY Representations; label: 8.5
title: Search Trees and Dictionaries; label: 8.6
title: Performance Reports; label: 8.7
title: Summary; label: 8.8
title: History; title: Exercises; label: Chapter 9
title: Tables and Hashing
pagenum: 301; label: 9.1
title: Hashed Representations of TABLE; label: 9.2
title: Bucketing and Separate Chaining; label: 9.3
title: Open Addressing; label: 9.4
title: Dynamic Tables; label: 9.5
title: External Tables; label: 9.6
title: Performance Reports; label: 9.7
title: Summary; label: 9.8
title: History; title: Exercises; label: Chapter 10
title: Dictionaries and Search Trees
pagenum: 339; label: 10.1
title: Optimal Binary Search Trees; label: 10.2
title: Red-Black Trees; label: 10.3
title: Splay Search Trees; label: 10.4
title: B+-Trees; label: 10.5
title: Performance Reports; label: 10.6
title: Summary; label: 10.7
title: History; title: Exercises; label: Chapter 11
title: Priority Searching
pagenum: 399; label: 11.1
title: PRIORITY QUEUE Specification; label: 11.2
title: PRIORITY QUEUE Representations; label: 11.3
title: Priority Search Queues; label: 11.4
title: Summary; label: 11.5
title: History; title: Exercises; label: Chapter 12
title: Sorting
pagenum: 425; label: 12.1
title: Comparison-based Sorting; label: 12.2
title: Sorting: A Lower Bound; label: 12.3
title: Digital Sorting; label: 12.4
title: Adaptive Sorting; label: 12.5
title: External Sorting; label: 12.6
title: Performance Reports; label: 12.7
title: Summary; label: 12.8
title: History; title: Exercises; label: Chapter 13
title: Graphs and Digraphs
pagenum: 463; label: 13.1
title: GRAPH and DIGRAPH Specifications; label: 13.2
title: GRAPH and DIGRAPH Representations; label: 13.3
title: Digraph Algorithms; label: 13.4
title: Graph Algorithms; label: 13.5
title: Memory Management; label: 13.6
title: Performance Reports; label: 13.7
title: Summary; label: 13.8
title: History; title: Exercises; label: Chapter 14
title: Partitions
pagenum: 511; label: 14.1
title: PARTITION Specification; label: 14.2
title: Representations in Particular; label: 14.3
title: Representations in General; label: 14.4
title: Back to the Past; label: 14.5
title: Performance Reports; label: 14.6
title: Summary; label: 14.7
title: History; title: Exercises; label: Part III
title: Preview
pagenum: 527; label: Chapter 15
title: Further Topics
pagenum: 529; label: 15.1
title: Skip Lists; label: 15.2
title: Quad Trees; label: 15.3
title: k-d Trees; label: 15.4
title: Grid Files; label: 15.5
title: Segment Trees, Range Trees, and Segment Intersection; label: 15.6
title: Hierarchical Trees and Rectangles; label: 15.7
title: Dynamization; label: 15.8
title: Persistence; title: Exercises; title: References
pagenum: 571; title: Index
pagenum: 583