Order Total (1 Item Items):
Shipping Destination:
Design Analysis Algorithms by Kozen Dexter (51 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (51)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
Binding
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (15)
- Not Print on Demand (42)
Language (2)
Free Shipping
Seller Location
Seller Rating
-
Condition: Very Good. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.
-
Condition: Very Good. Former library copy. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.
-
Condition: Very Good. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.
-
The Design and Analysis of Algorithms (Monographs in Computer Science)
Seller: Roundabout Books, Greenfield, MA, U.S.A.
Association Member: SNEAB
Seller rating 4 out of 5 stars
hardcover. Condition: Good. Condition Notes: Moderate edge wear. Binding good. May have marking in text. We sometimes source from libraries. We ship in recyclable American-made mailers. 100% money-back guarantee on all orders.
-
Hardcover. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!
-
Condition: very_good. Book has little sign of wear or use.
-
Hardcover. Condition: Very Good. No Jacket. Missing dust jacket; May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.
-
Hardcover. Condition: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.
-
Hardcover. Condition: Good. . Satisfaction 100% guaranteed.
-
hardcover. Condition: Good. 1992nd Edition. Ships in a BOX from Central Missouri! May not include working access code. Will not include dust jacket. Has used sticker(s) and some writing and/or highlighting. UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes).
-
Hardcover. Condition: Near Fine.
-
The Design and Analysis of Algorithms (Monographs in Computer Science)
Seller: World of Books (was SecondSale), Montgomery, IL, U.S.A.
Seller rating 5 out of 5 stars
Condition: Good. Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc.
-
The Design and Analysis of Algorithms (Monographs in Computer Science)
Language: English
Published by Springer December 1991, 1991
ISBN 10: 0387976876 ISBN 13: 9780387976877
Hardcover. Condition: Used Good. No Jacket.
-
Design and Analysis of Algorithms
Language: English
Published by Springer, New York, NY, 1991
ISBN 10: 0387976876 ISBN 13: 9780387976877
Seller: Book Bear, West Brookfield, MA, U.S.A.
Association Member: SNEAB
Seller rating 5 out of 5 stars
Hardcover. Condition: Very Good. 320 pp. Tightly bound. Corners not bumped. Text is free of markings. No ownership markings. Published without dust jacket.
-
Design and Analysis of Algorithms (Texts and Monographs in Computer Science)
Language: English
Published by Springer-Verlag Berlin and Heide
ISBN 10: 3540976876 ISBN 13: 9783540976875
hardcover. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!
-
hardcover. Condition: Good. 1992nd Edition. Ships in a BOX from Central Missouri! May not include working access code. Will not include dust jacket. Has used sticker(s) and some writing or highlighting. UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes).
-
Hardcover. Condition: Very Good. 8 vo, gray boards, tight binding, text clean, with 72 illustrations -- an excellent copy. front cover has thin line top to bottom. Springer-Verlag, 1991, New York, 320 pg.
-
hardcover. Condition: As New. A nice hardcover with a tight binding and an unmarked text. From a private smoke free collection. Shipping within 24 hours, tracking number and delivery Confirmation.
-
Hardcover. Condition: Very Good. 2nd Edition. Second Edition. 9.5 x 6.25 in. 320, [3] pp. Printed paper boards. Light wear to extremities, moderate creasing, no internal markings. Very Good.
-
Condition: Fair. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In fair condition, suitable as a study copy. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,700grams, ISBN:0387976876.
-
Hardcover. Condition: new. New Copy. Customer Service Guaranteed.
-
The Design and Analysis of Algorithms
Published by Springer-Verlag, New York, 1992
Seller: BIBLIOPE by Calvello Books, Oakland, CA, U.S.A.
Seller rating 4 out of 5 stars
Hardcover. Condition: Fine. 2nd Printing. Large octavo with grey boards and red text; x, 320 pages: illustrations; index; 25 cm. "These are my lecture notes from CS681: Design and Analysis of Algorithms, 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"--Preface by the author. Contents: 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. Fine with faint external wear. Crisp and clean within.
-
The Design and Analysis of Algorithms
Language: English
Published by New York: Springer, 1992., 1992
ISBN 10: 0387976876 ISBN 13: 9780387976877
Hardcover. Condition: Very Good. 2nd Edition. Second Edition. 8vo. x, 320 pp. Printed paper boards. Crown of spine bumped, a few light creases to boards, no internal markings. Very Good.
-
The Design and Analysis of Algorithms. Texts and Monographs in Computer Science.
Language: English
Published by Springer-Verlag
Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Sprache: Englisch Gewicht in Gramm: 990.
-
The Design and Analysis of Algorithms (Paperback)
Language: English
Published by Springer-Verlag New York Inc., New York, NY, 2011
ISBN 10: 146128757X ISBN 13: 9781461287575
Paperback. Condition: new. Paperback. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
-
Condition: good. May show signs of wear, highlighting, writing, and previous use. This item may be a former library book with typical markings. No guarantee on products that contain supplements Your satisfaction is 100% guaranteed. Twenty-five year bookseller with shipments to over fifty million happy customers.
-
-
The Design and Analysis of Algorithms (Monographs in Computer Science)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 76.40
£ 11.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Design and Analysis of Algorithms
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: good. May show signs of wear, highlighting, writing, and previous use. This item may be a former library book with typical markings. No guarantee on products that contain supplements Your satisfaction is 100% guaranteed. Twenty-five year bookseller with shipments to over fifty million happy customers.
-
Condition: New. pp. 336.
