Isbn: 9780387976877 - the design and analysis of algorithms (monographs in computer science) (26 resultados)

Condición: 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.

Condición: 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.

Hardcover. Condición: 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. Condición: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.

Hardcover. Condición: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.

Hardcover. Condición: Fair. No Jacket. Readable copy. Pages may have considerable notes/highlighting. ~ ThriftBooks: Read More, Spend Less.

Hardcover. Condición: Good. . Satisfaction 100% guaranteed.

Hardcover. Condición: Used Good. No Jacket.

Hardcover. Condición: 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. Condición: 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. Condición: 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.

Hardcover. Condición: Very Good. Springer, 1992. Book has faint rubbing to covers with light surface scratches to back cover, a touch of wear o outer corners, a couple of tiny bumps and a smudge to spine area. otherwise in great condition, strong binding, bright and unmarked pages; an overall sturdy copy with clean interiors.…

Condición: 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.…

Condición: Fair. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. Clean from markings. 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. Condición: new. New Copy. Customer Service Guaranteed.

Hardcover. Condición: 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.

Condición: New.

Condición: New. In English.

Gebunden. Condición: New.

Condición: New. pp. 340.

Hardcover. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Buch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 340 pp. Englisch.…

Buch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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. …

Condición: New. Print on Demand pp. 340 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.

Buch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 340 pp. Englisch.…

Condición: New. PRINT ON DEMAND pp. 340.