Picture 1 of 11











Gallery
Picture 1 of 11











Have one to sell?
The Design and Analysis of Algorithms (Monographs in Computer Science) HC VG
US $4.90
ApproximatelyAU $7.57
Condition:
Very good
A book that does not look new and has been read but is in excellent condition. No obvious damage to the cover, with the dust jacket (if applicable) included for hard covers. No missing or damaged pages, no creases or tears, and no underlining/highlighting of text or writing in the margins. May be very minimal identifying marks on the inside cover. Very minimal wear and tear. See the seller’s listing for full details and description of any imperfections.
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Postage:
US $5.97 (approx. AU $9.22) delivery in 2-4 days
Get it between Wed, 6 Aug and Fri, 8 Aug.
Located in: Los Angeles, California, United States
Returns:
30-day returns. Buyer pays for return postage. If you use an eBay postage label, it will be deducted from your refund amount.
Payments:
Shop with confidence
Seller assumes all responsibility for this listing.
eBay item number:297134785756
Item specifics
- Condition
- Brand
- Unbranded
- Book Title
- The Design and Analysis of Algorithms (Monographs in Computer Sc
- MPN
- Does not apply
- ISBN
- 9780387976877
About this product
Product Identifiers
Publisher
Springer New York
ISBN-10
0387976876
ISBN-13
9780387976877
eBay Product ID (ePID)
117555
Product Key Features
Number of Pages
X, 322 Pages
Language
English
Publication Name
Design and Analysis of Algorithms
Publication Year
1991
Subject
Programming / Algorithms
Type
Textbook
Subject Area
Computers
Series
Monographs in Computer Science Ser.
Format
Hardcover
Dimensions
Item Height
0.3 in
Item Weight
50.8 Oz
Item Length
9.2 in
Item Width
6.1 in
Additional Product Features
Intended Audience
Scholarly & Professional
TitleLeading
The
Number of Volumes
1 vol.
Illustrated
Yes
Table Of Content
I Lectures.- 1 Algorithms and Their Complexity.- 2 Topological Sort and MST.- 3 Matroids and Independence.- 4 Depth-First and Breadth-First Search.- 5 Shortest Paths and Transitive Closure.- 6 Kleene Algebra.- 7 More on Kleene Algebra.- 8 Binomial Heaps.- 9 Fibonacci Heaps.- 10 Union-Find.- 11 Analysis of Union-Find.- 12 Splay Trees.- 13 Random Search Trees.- 14 Planar and Plane Graphs.- 15 The Planar Separator Theorem.- 16 Max Flow.- 17 More on Max Flow.- 18 Still More on Max Flow.- 19 Matching.- 20 More on Matching.- 21 Reductions and NP-Completeness.- 22 More on Reductions and NP-Completeness.- 23 More NP-Complete Problems.- 24 Still More NP-Complete Problems.- 25 Cook's Theorem.- 26 Counting Problems and #P.- 27 Counting Bipartite Matchings.- 28 Parallel Algorithms and NC.- 29 Hypercubes and the Gray Representation.- 30 Integer Arithmetic in NC.- 31 Csanky's Algorithm.- 32 Chistov's Algorithm.- 33 Matrix Rank.- 34 Linear Equations and Polynomial GCDs.- 35 The Fast Fourier Transform (FFT).- 36 Luby's Algorithm.- 37 Analysis of Luby's Algorithm.- 38 Miller's Primality Test.- 39 Analysis of Miller's Primality Test.- 40 Probabilistic Tests with Polynomials.- II Homework Exercises.- Homework 1.- Homework 2.- Homework 3.- Homework 4.- Homework 5.- Homework 6.- Homework 7.- Homework 8.- Homework 9.- Homework 10.- Miscellaneous Exercises.- III Homework Solutions.- Homework 1 Solutions.- Homework 2 Solutions.- Homework 3 Solutions.- Homework 4 Solutions.- Homework 5 Solutions.- Homework 6 Solutions.- Homework 7 Solutions.- Homework 8 Solutions.- Homework 9 Solutions.- Homework 10 Solutions.- Solutions to Miscellaneous Exercises.
Synopsis
These are my lecture notes from CS681: Design and Analysis of Algo- rithms, a one-semester graduate course I taught at Cornell for three consec- utive fall semesters from '88 to '90. The course serves a dual purpose: to cover core material in algorithms for graduate students in computer science preparing for their PhD qualifying exams, and to introduce theory students to some advanced topics in the design and analysis of algorithms. The material is thus a mixture of core and advanced topics. At first I meant these notes to supplement and not supplant a textbook, but over the three years they gradually took on a life of their own. In addition to the notes, I depended heavily on the texts - A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Addison-Wesley, 1975. - M. R. Garey and D. S. Johnson, Computers and Intractibility: A Guide to the Theory of NP-Completeness. w. H. Freeman, 1979. - R. E. Tarjan, Data Structures and Network Algorithms. SIAM Regional Conference Series in Applied Mathematics 44, 1983. and still recommend them as excellent references., These are my lecture notes from CS681: Design and Analysis of Algo rithms, a one-semester graduate course I taught at Cornell for three consec utive fall semesters from '88 to '90. The course serves a dual purpose: to cover core material in algorithms for graduate students in computer science preparing for their PhD qualifying exams, and to introduce theory students to some advanced topics in the design and analysis of algorithms. The material is thus a mixture of core and advanced topics. At first I meant these notes to supplement and not supplant a textbook, but over the three years they gradually took on a life of their own. In addition to the notes, I depended heavily on the texts * A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Addison-Wesley, 1975. * M. R. Garey and D. S. Johnson, Computers and Intractibility: A Guide to the Theory of NP-Completeness. w. H. Freeman, 1979. * R. E. Tarjan, Data Structures and Network Algorithms. SIAM Regional Conference Series in Applied Mathematics 44, 1983. and still recommend them as excellent references., The design and analysis of algorithms is one of the two essential cornerstone topics in computer science (the other being automata theory/theory of computation). Every computer scientist has a copy of Knuth's works on algorithms on his or her shelf. Dexter Kozen, a researcher and professor at Cornell University, has written a text for graduate study of algorithms.
LC Classification Number
QA76.9.A43
Item description from the seller
Popular categories from this Store
Seller feedback (11,321)
- e***f (891)- Feedback left by buyer.Past monthVerified purchasePurchased 6-8-25, track # provided 6-8-25, shipped 6-9-25, delivered 6-13-25 w/bubble envelope & extra bubble inside, 1 item N 👌, all good, job service 👍 & seller, buy again 😀 👍
- d***r (6)- Feedback left by buyer.Past 6 monthsVerified purchasePackaged very well! Shipping was no hassle. Product was as described. Everyone could get a lot of value reading the writings of Mr Bertrand. I was not even aware I was getting two books. It was wrapped well and very well packaged. I was actually just buying the red cover book. So yeah the value was really good because I got them both for like 30.The Autobiography of Bertrand Russell - 2 Volumes 1914-1944 1944-1969 (#297164425258)
- o***a (3652)- Feedback left by buyer.Past monthVerified purchaseA smooth and lovely transaction. Item was packaged with care and arrived in great condition, just as described. Very prompt shipping and a nice value with a very reasonable shipping cost. I enjoyed this eBay transaction and can highly recommend shopping here. Thanks so much! :)
More to explore:
- Computer Science Adult Learning & University Books,
- Computer Science Adult Learning & University Books in English,
- Non-Fiction Books & Business Analysis Fiction International Edition,
- Science Fiction & Non-Fiction Books,
- Non-Fiction Business Analysis Hardcover Illustrated Books in English,
- Science Dictionaries & Reference Books,
- Science Fiction Fiction Novels-Fiction Books,
- Science Fiction Fiction Fiction & Non-Fiction Books,
- Science Fiction Fiction Hardcover Books,
- Science & Medicine Antiquarian & Collectable Books in English