An edition of Fundamentals of computer algorithms
(1978)
Fundamentals of computer algorithms
by Ellis Horowitz
- 11 Want to read
- 1 Currently reading
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
Fundamentals of computer algorithms
1984, Computer Science Press
in English
0914894226 9780914894223
|
aaaa
|
2
Fundamentals of computer algorithms
1978, Computer Science Press
in English
3540120351 9783540120353
|
zzzz
|
3
Fundamentals of computer algorithms
1978, Computer Science Press
in English
0914894226 9780914894223
|
cccc
|
Book Details
Table of Contents
Preface. Preface
1. Introduction
1.1. What is an algorithm
1.2. Writing algorithms in SPARKS
1.3. Writing structured programs
1.4. Analyzing algorithms
References and selected readings
Exercises
2. Elementary Data Structures
2.1. Stacks and queues
2.2. Trees
2.3. Heaps and heapsort
2.4. Sets and disjoint set union
2.5. Graphs
2.6. Hashing
References and selected readings
Exercises
3. Divide-and-Conquer
3.1. The general method
3.2. Binary search
3.3. Finding the maximum and minimum
3.4. Mergesort
3.5. Quicksort
3.6. Selection
3.7. Strassen's matrix multiplication
References and selected readings
Exercises
4. The Greedy Method
4.1. The general method
4.2. Optimal storage on tapes
4.3. Knapsack problem
4.4. Job sequencing with deadlines
4.5. Optimal merge patterns
4.6. Minimum spanning trees
4.7. Single source shortest paths
References and selected readings
Exercises
5. Dynamic Programming
5.1. The general method
5.2. Multistage graphs
5.3. All pairs shortest paths
5.4. Optimal binary search trees
5.5. 0/1 knapsack
5.6. Reliability design
5.7. The traveling salesperson problem
5.8. Flow shop scheduling
References and selected readings
Exercises
6. Basic Search and Traversal Techniques
6.1. The techniques
6.2. Code optimization
6.3. AND/OR graphs
6.4. Game trees
6.5. Biconnected components and depth first search
References and selected readings
Exercises
7. Backtracking
7.1. The general method
7.2. The 8-queens problem
7.3. Sum of subsets
7.4. Graph coloring
7.5. Hamiltonian cycles
7.6. Knapsack problem
References and selected readings
Exercises
8. Branch-and-Bound
8.1. The method
8.2. 0/1 knapsack problem
8.3. Traveling salesperson
8.4. Efficiency considerations
References and selected readings
Exercises
9. Algebraic Simplification and Transformations
9.1. The general method
9.2. Evaluation and interpolation
9.3. The fast Fourier transform
9.4. Modular arithmetic
9.5. Even faster evaluation and interpolation
References and selected readings
Exercises
10. Lower Bound Theory
10.1. Comparison trees for sorting and searching
10.2. Oracles and adversary arguments
10.3. Techniques for algebraic problems
10.4. Some lower bounds on parallel computation
References and selected readings
Exercises
11. NP-Hard and NP-Complete Problems
11.1. Basic concepts
11.2. Cook's theorem
11.3. NP-Hard graph problems
11.4. NP-Hard scheduling problems
11.5. NP-Hard code generation problems
11.6. Some simplified NP-Hard problems
References and selected readings
Exercises
12. Approximation Algorithms for NP-Hard Problems
12.1. Introduction
12.2. Absolute approximations
12.3. E-approximations
12.4. Polynomial time approximation schemes
12.5. Fully polynomial time approximation schemes
12.6. Probabilistically good algorithms
References and selected readings
Exercises
Appendix A. SPARKS
Index
Edition Notes
Includes bibliographical references and index.
Classifications
The Physical Object
Edition Identifiers
Work Identifiers
Community Reviews (0)
Lists
History
- Created October 16, 2008
- 12 revisions
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
| September 23, 2025 | Edited by Drini | Add TOC from Tocky |
| March 28, 2025 | Edited by ImportBot | Redacting ocaids |
| December 13, 2023 | Edited by MARC Bot | import existing book |
| December 7, 2022 | Edited by MARC Bot | import existing book |
| October 16, 2008 | Created by ImportBot | Imported from Oregon Libraries MARC record |