ISBN: 9780262033848 - introduction to algorithms, third edition (mit press) (40 Ergebnisse)

Zustand: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.…

Zustand: good. All pages and cover are intact including the dust cover, if applicable . Spine may show signs of wear. Pages may include limited notes and highlighting. May include "From the library of" labels. Shrink wrap, dust covers, or boxed set case may be missing. Item may be missing bundled media.…

hardcover. Zustand: Acceptable. DAMAGED - Bruise/tear to cover/spine.

Hardcover. Zustand: Acceptable. 3rd. Book - Hardback book. Book - The cover and pages show normal wear.

Hardback. Zustand: Good. The latest edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-based flow.Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence (now called Divide-and-Conquer), and an appendix on matrices. It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many exercises and problems have been added for this edition. The international paperback edition is no longer available; the hardcover is available worldwide.…

Zustand: good. All pages and cover are intact. Dust jacket included if applicable, though it may be missing on hardcover editions. Spine and cover may show minor signs of wear including scuff marks, curls or bends to corners as well as cosmetic blemishes including stickers. Pages may contain limited notes or highlighting. "From the library of" labels may be present. Shrink wrap, dust covers, or boxed set packaging may be missing. Bundled media e.g., CDs, DVDs, access codes may not be included.…

Zustand: good. This book is in good condition, with minimal signs of wear and tear.

Zustand: Good. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Softcover. Zustand: New. Brand new book. International edition printed overseas but with similar contents as compared to the US edition. Book will have a different ISBN and cover art and paperback bound. Same day shipping with tracking.

Hardback. Zustand: Fair. The latest edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-based flow.Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence (now called Divide-and-Conquer), and an appendix on matrices. It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many exercises and problems have been added for this edition. The international paperback edition is no longer available; the hardcover is available worldwide.…

Hardback. Zustand: Good. The latest edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-based flow.Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence (now called Divide-and-Conquer), and an appendix on matrices. It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many exercises and problems have been added for this edition. The international paperback edition is no longer available; the hardcover is available worldwide.…

Hardback. Zustand: Fair. The latest edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-based flow.Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence (now called Divide-and-Conquer), and an appendix on matrices. It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many exercises and problems have been added for this edition. The international paperback edition is no longer available; the hardcover is available worldwide.…

Zustand: Good. Very clean, very nice example. A few sentences are highlighted, otherwise in great shape! Well packaged and promptly shipped from California. Partnered with Friends of the Library since 2010.

Hardcover. Zustand: Fair. 3rd. The item might be beaten up but readable. May contain markings or highlighting, as well as stains, bent corners, or any other major defect, but the text is not obscured in any way.

Hardcover. Zustand: Very Good. 3rd. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting.

Hardcover. Zustand: Fair. Book in Fair condition.

Hardcover. Zustand: Very Good. 3rd. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting.

Zustand: Very Good. Very Good condition. 3rd edition. A copy that may have a few cosmetic defects. May also contain light spine creasing or a few markings such as an owner's name, short gifter's inscription or light stamp. NOT AVAILABLE FOR SHIPMENT OUTSIDE OF THE UNITED STATES.

Zustand: Like New. Page block firm and clean, binding unblemished, boards straight, without markings of any kind. Fine, like new condition. Without any discs, access codes or extra items. Supporting Bay Area Friends of the Library since 2010. Well packaged and promptly shipped.

Hardcover. Zustand: Good. Book in Good condition.

Hardcover. Zustand: Very Good. Book in Very Good condition.

Hardcover. Zustand: Very Good. 3rd. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting.

hardcover. Zustand: Very Good. Item may have minor cosmetic defects (such as marks, wears, cuts, bends, or crushes) on the cover, spine, pages, or dust cover. Shrink wrap, dust covers, or boxed set case may be missing. Item may contain remainder marks on outside edges. Item may be missing bundled media. Satisfaction guaranteed. Thank you.…

hardcover. Zustand: Very Good. 3rd. Very good condition, no observable damage to pages, cover, or spine/binding. Binding only lightly and still in strong condition. Cover art still clear and bright. Hardcover book, no page markings. EG.

Hardcover. Zustand: Good. 3rd Edition. Clean pages. Sturdy binding. Some creased pages. Ships in sturdy cardboard packaging. Booksellers since 1997 [d4].

Hardcover. Zustand: Good. 3rd Edition. We only honor returns for quality issues and won't accept reasons such as 'change my mind', 'find a better price', or 'school book requirement change', etc.

hardcover. Zustand: Very Good. VERY GOOD ,MAY HAVE ONE PAGE OF WRITING, PAGES ARE IN GREAT CONDITION, USED PRODUCTS DO NOT CONTAIN ORIGINAL CONTENTS, WILL HAVE SHELF WEAR AND STICKERS ON COVER. MAY HAVE MISSING CD, INSERTS, CODES.

Zustand: very good. Gently used. May include previous owner's signature or bookplate on the front endpaper, sticker on back and/or remainder mark on text block.

hardcover. Zustand: Very Good. 3rd. Po name in front, otherwise unmarked, clean interior. Spine extremes lightly bumped. 2 small scratches on rear. Hardcover. Copyright 2009. 3rd edition. (1h).

hardcover. Zustand: Very Good. 3rd. clean, sturdy, and unmarked - rw.