Matches in Harvard for { <http://id.lib.harvard.edu/aleph/002368451/catalog> ?p ?o. }
Showing items 1 to 30 of
30
with 100 items per page.
- catalog alternative "Algorithms.".
- catalog contributor b3407372.
- catalog contributor b3407373.
- catalog contributor b3407374.
- catalog created "c1990.".
- catalog date "1990".
- catalog date "c1990.".
- catalog dateCopyrighted "c1990.".
- catalog description "Growth of functions -- Summations -- Recurrences -- Sets, etc. -- Counting and probability -- Heapsort -- Quicksort -- Sorting in linear time -- Medians and order statistics -- Elementary data structures -- Hash tables -- Binary search trees -- Red-black trees -- Augmenting data structures -- Dynamic programming -- Greedy algorithms -- Amortized analysis -- B-trees -- Binomial heaps -- Fibonacci heaps -- Data structures for disjoint sets -- Elementary graph algorithms -- Minimum spanning trees -- Single-source shortest paths -- All-pairs shortest paths -- Maximum flow -- Sorting networks -- Arithmetic circuits -- Algorithms for parallel computers -- Matrix operations -- Polynomials and the FFT -- Number-theoretic algorithms -- String matching -- Computational geometry -- NP-completeness -- Approximation algorithms.".
- catalog description "Includes bibliographcal references (p. [987]-996) and index.".
- catalog extent "xvii, 1028 p. :".
- catalog hasFormat "Introduction to algorithms.".
- catalog identifier "0070131430 (McGraw-Hill)".
- catalog identifier "0262031418".
- catalog identifier "0262530910 (MIT Press pbk.)".
- catalog isFormatOf "Introduction to algorithms.".
- catalog isPartOf "The MIT electrical engineering and computer science series".
- catalog issued "1990".
- catalog issued "c1990.".
- catalog language "eng".
- catalog publisher "Cambridge, Mass. : MIT Press ; New York : McGraw-Hill,".
- catalog relation "Introduction to algorithms.".
- catalog subject "005.1 20".
- catalog subject "Computer algorithms.".
- catalog subject "Computer programming.".
- catalog subject "QA76.6 .C662 1990".
- catalog tableOfContents "Growth of functions -- Summations -- Recurrences -- Sets, etc. -- Counting and probability -- Heapsort -- Quicksort -- Sorting in linear time -- Medians and order statistics -- Elementary data structures -- Hash tables -- Binary search trees -- Red-black trees -- Augmenting data structures -- Dynamic programming -- Greedy algorithms -- Amortized analysis -- B-trees -- Binomial heaps -- Fibonacci heaps -- Data structures for disjoint sets -- Elementary graph algorithms -- Minimum spanning trees -- Single-source shortest paths -- All-pairs shortest paths -- Maximum flow -- Sorting networks -- Arithmetic circuits -- Algorithms for parallel computers -- Matrix operations -- Polynomials and the FFT -- Number-theoretic algorithms -- String matching -- Computational geometry -- NP-completeness -- Approximation algorithms.".
- catalog title "Algorithms.".
- catalog title "Introduction to algorithms / Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest.".
- catalog type "text".