An edition of Introduction to Algorithms (1990)

Introduction to Algorithms

  • 4.22 ·
  • 18 Ratings
  • 345 Want to read
  • 22 Currently reading
  • 22 Have read
Not in Library

My Reading Lists:

Create a new list

Check-In

×Close
Add an optional check-in date. Check-in dates are used to track yearly reading goals.
Today

  • 4.22 ·
  • 18 Ratings
  • 345 Want to read
  • 22 Currently reading
  • 22 Have read


Download Options

Buy this book

Last edited by ImportBot
December 19, 2023 | History
An edition of Introduction to Algorithms (1990)

Introduction to Algorithms

  • 4.22 ·
  • 18 Ratings
  • 345 Want to read
  • 22 Currently reading
  • 22 Have read

This edition doesn't have a description yet. Can you add one?

Publish Date
Publisher
MIT Press, McGraw-Hill
Language
English
Pages
1028

Buy this book

Previews available in: English

Edition Availability
Cover of: Introduction to Algorithms
Introduction to Algorithms
2009, MIT Press
Paperback in English - Third edition
Cover of: Introduction to Algorithms
Introduction to Algorithms
2009, The MIT Press
in English - Third Edition
Cover of: Introduction to Algorithms and Java CD-ROM
Introduction to Algorithms and Java CD-ROM
December 16, 2003, McGraw-Hill Science/Engineering/Math
in English
Cover of: Introduction to Algorithms, Second Edition
Introduction to Algorithms, Second Edition
July 16, 2001, McGraw-Hill Science/Engineering/Math
in English
Cover of: Introduction to Algorithms, Second Edition
Introduction to Algorithms, Second Edition
July 16, 2001, McGraw-Hill Science/Engineering/Math
Hardcover in English - 2 edition
Cover of: Introduction to algorithms
Introduction to algorithms
2001, MIT Press
in English - 2nd ed.
Cover of: Introduction to Algorithms
Introduction to Algorithms
1999, MIT Press, McGraw-Hill
in English
Cover of: Introduction to Algorithms
Introduction to Algorithms
1990, MIT Press
in English
Cover of: Introduction to Algorithms
Introduction to Algorithms
1990, MIT Press, McGraw-Hill
in English

Add another edition?

Book Details


Table of Contents

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.

Edition Notes

Includes bibliographcal references (p. [987]-996) and index.

Published in
Cambridge, Mass, New York
Series
The MIT electrical engineering and computer science series

Classifications

Library of Congress
QA76.6 .C662 1990, QA76.6.C662 1990

The Physical Object

Pagination
xvii, 1028 p. :
Number of pages
1028

ID Numbers

Open Library
OL18372918M
Internet Archive
introductiontoal00corm_741
ISBN 10
0262031418
LCCN
89013027
OCLC/WorldCat
44674539
Library Thing
13005
Goodreads
946131

Community Reviews (0)

Feedback?
No community reviews have been submitted for this work.

History

Download catalog record: RDF / JSON
December 19, 2023 Edited by ImportBot import existing book
December 19, 2023 Edited by ImportBot import existing book
October 9, 2023 Edited by Marla Deleted incorrect authors
September 26, 2023 Edited by raybb merge authors
December 10, 2009 Created by WorkBot add works page