EUR 18,36
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbHardcover. Zustand: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 2.85.
EUR 18,36
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbHardcover. Zustand: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 2.85.
Anbieter: Romtrade Corp., STERLING HEIGHTS, MI, USA
EUR 38,27
Währung umrechnenAnzahl: 5 verfügbar
In den WarenkorbZustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
Anbieter: Biblios, Frankfurt am main, HESSE, Deutschland
EUR 41,72
Währung umrechnenAnzahl: 4 verfügbar
In den WarenkorbZustand: New. pp. 620.
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
EUR 36,73
Währung umrechnenAnzahl: 4 verfügbar
In den WarenkorbZustand: New. pp. 620 68:B&W 7 x 10 in or 254 x 178 mm Case Laminate on White w/Gloss Lam.
EUR 40,78
Währung umrechnenAnzahl: 4 verfügbar
In den WarenkorbZustand: New. pp. 620.
Verlag: Springer-Verlag New York Inc., 2012
ISBN 10: 1461266017 ISBN 13: 9781461266013
Sprache: Englisch
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
EUR 49,37
Währung umrechnenAnzahl: 2 verfügbar
In den WarenkorbPAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000.
Verlag: Springer-Verlag New York Inc., 2012
ISBN 10: 1461266017 ISBN 13: 9781461266013
Sprache: Englisch
Anbieter: PBShop.store US, Wood Dale, IL, USA
EUR 56,90
Währung umrechnenAnzahl: 2 verfügbar
In den WarenkorbPAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000.
EUR 57,84
Währung umrechnenAnzahl: 2 verfügbar
In den WarenkorbZustand: New. Data structures and algorithms are presented at the college level in a highly accessible format that presents material with one-page displays in a way that will appeal to both teachers and students. The thirteen chapters cover: Models of Computation, Lists,.
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 55,08
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Verlag: Birkhäuser Boston, Birkhäuser Boston, 2012
ISBN 10: 1461266017 ISBN 13: 9781461266013
Sprache: Englisch
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
EUR 60,48
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbTaschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Data structures and algorithms are presented at the college levelin a highly accessible format that presents material with one-pagedisplays in a way that will appeal to both teachers and students. Thethirteen chapters cover: Models of Computation, Lists, Induction andRecursion, Trees, Algorithm Design, Hashing, Heaps, Balanced Trees,Sets Over a Small Universe, Graphs, Strings, Discrete FourierTransform, Parallel Computation.Key features: Complicated concepts are expressed clearly in asingle page with minimal notation and without the 'clutter' of thesyntax of a particular programming language; algorithms are presentedwith self-explanatory 'pseudo-code.' \* Chapters 1-4 focus onelementary concepts, the exposition unfolding at a slower pace. Sampleexercises with solutions are provided. Sections that may be skippedfor an introductory course are starred. Requires only some basicmathematics background and some computer programming experience. \*Chapters 5-13 progress at a faster pace. The material is suitable forundergraduates or first-year graduates who need only review Chapters 1-4. \* This book may be used for a one-semester introductory course(based on Chapters 1-4 and portions of the chapters on algorithmdesign, hashing, and graph algorithms) and for a one-semester advancedcourse that starts at Chapter 5. A year-long course may be based onthe entire book. \* Sorting, often perceived as rather technical, isnot treated as a separate chapter, but is used in many examples(including bubble sort, merge sort, tree sort, heap sort, quick sort,and several parallel algorithms). Also, lower bounds on sorting bycomparisons are included with the presentation of heaps in the contextof lower bounds for comparison-based structures. \* Chapter 13 onparallel models of computation is something of a mini-book itself, anda good way to end a course. Although it is not clear what parallel.
Anbieter: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irland
EUR 60,53
Währung umrechnenAnzahl: 2 verfügbar
In den WarenkorbZustand: New. 2012. Paperback. . . . . .
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 60,67
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 49,36
Währung umrechnenAnzahl: 2 verfügbar
In den WarenkorbZustand: New.
EUR 67,94
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbGebunden. Zustand: New. Data structures and algorithms are presented at the college level in a highly accessible format that presents material with one-page displays in a way that will appeal to both teachers and students. The thirteen chapters cover: Models of Computation, Lists,.
Anbieter: Bay State Book Company, North Smithfield, RI, USA
EUR 18,36
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbZustand: good. The book is in good condition with all pages and cover intact, including the dust jacket if originally issued. The spine may show light wear. Pages may contain some notes or highlighting, and there might be a "From the library of" label. Boxed set packaging, shrink wrap, or included media like CDs may be missing.
EUR 54,11
Währung umrechnenAnzahl: 2 verfügbar
In den WarenkorbZustand: New.
EUR 56,08
Währung umrechnenAnzahl: 2 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
Verlag: Springer-Verlag New York Inc., US, 2012
ISBN 10: 1461266017 ISBN 13: 9781461266013
Sprache: Englisch
Anbieter: Rarewaves.com UK, London, Vereinigtes Königreich
EUR 73,64
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbPaperback. Zustand: New. Data structures and algorithms are presented at the college level in a highly accessible format that presents material with one-page displays in a way that will appeal to both teachers and students. The thirteen chapters cover: Models of Computation, Lists, Induction and Recursion, Trees, Algorithm Design, Hashing, Heaps, Balanced Trees, Sets Over a Small Universe, Graphs, Strings, Discrete Fourier Transform, Parallel Computation. Key features: Complicated concepts are expressed clearly in a single page with minimal notation and without the "clutter" of the syntax of a particular programming language; algorithms are presented with self-explanatory "pseudo-code." * Chapters 1-4 focus on elementary concepts, the exposition unfolding at a slower pace. Sample exercises with solutions are provided. Sections that may be skipped for an introductory course are starred. Requires only some basic mathematics background and some computer programming experience. * Chapters 5-13 progress at a faster pace. The material is suitable for undergraduates or first-year graduates who need only review Chapters 1 -4. * This book may be used for a one-semester introductory course (based on Chapters 1-4 and portions of the chapters on algorithm design, hashing, and graph algorithms) and for a one-semester advanced course that starts at Chapter 5. A year-long course may be based on the entire book. * Sorting, often perceived as rather technical, is not treated as a separate chapter, but is used in many examples (including bubble sort, merge sort, tree sort, heap sort, quick sort, and several parallel algorithms). Also, lower bounds on sorting by comparisons are included with the presentation of heaps in the context of lower bounds for comparison-based structures. * Chapter 13 on parallel models of computation is something of a mini-book itself, and a good way to end a course. Although it is not clear what parallel Softcover reprint of the original 1st ed. 2002.
EUR 74,63
Währung umrechnenAnzahl: 2 verfügbar
In den WarenkorbZustand: New. 2012. Paperback. . . . . . Books ship from the US and Ireland.
EUR 44,34
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbZustand: Good. [ No Hassle 30 Day Returns ][ Ships Daily ] [ Underlining/Highlighting: NONE ] [ Writing: NONE ] [ Edition: reprint ] Publisher: Springer Pub Date: 1/1/2002 Binding: Paperback Pages: 553 reprint edition.
Verlag: Springer-Verlag New York Inc., US, 2012
ISBN 10: 1461266017 ISBN 13: 9781461266013
Sprache: Englisch
Anbieter: Rarewaves.com USA, London, LONDO, Vereinigtes Königreich
EUR 81,42
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbPaperback. Zustand: New. Data structures and algorithms are presented at the college level in a highly accessible format that presents material with one-page displays in a way that will appeal to both teachers and students. The thirteen chapters cover: Models of Computation, Lists, Induction and Recursion, Trees, Algorithm Design, Hashing, Heaps, Balanced Trees, Sets Over a Small Universe, Graphs, Strings, Discrete Fourier Transform, Parallel Computation. Key features: Complicated concepts are expressed clearly in a single page with minimal notation and without the "clutter" of the syntax of a particular programming language; algorithms are presented with self-explanatory "pseudo-code." * Chapters 1-4 focus on elementary concepts, the exposition unfolding at a slower pace. Sample exercises with solutions are provided. Sections that may be skipped for an introductory course are starred. Requires only some basic mathematics background and some computer programming experience. * Chapters 5-13 progress at a faster pace. The material is suitable for undergraduates or first-year graduates who need only review Chapters 1 -4. * This book may be used for a one-semester introductory course (based on Chapters 1-4 and portions of the chapters on algorithm design, hashing, and graph algorithms) and for a one-semester advanced course that starts at Chapter 5. A year-long course may be based on the entire book. * Sorting, often perceived as rather technical, is not treated as a separate chapter, but is used in many examples (including bubble sort, merge sort, tree sort, heap sort, quick sort, and several parallel algorithms). Also, lower bounds on sorting by comparisons are included with the presentation of heaps in the context of lower bounds for comparison-based structures. * Chapter 13 on parallel models of computation is something of a mini-book itself, and a good way to end a course. Although it is not clear what parallel Softcover reprint of the original 1st ed. 2002.
Verlag: Birkhauser Boston Nov 2001, 2001
ISBN 10: 0817642536 ISBN 13: 9780817642532
Sprache: Englisch
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
EUR 85,99
Währung umrechnenAnzahl: 2 verfügbar
In den WarenkorbBuch. Zustand: Neu. Neuware - Data structures and algorithms are presented at the college levelin a highly accessible format that presents material with one-pagedisplays in a way that will appeal to both teachers and students. Thethirteen chapters cover: Models of Computation, Lists, Induction andRecursion, Trees, Algorithm Design, Hashing, Heaps, Balanced Trees,Sets Over a Small Universe, Graphs, Strings, Discrete FourierTransform, Parallel Computation.Key features: Complicated concepts are expressed clearly in asingle page with minimal notation and without the 'clutter' of thesyntax of a particular programming language; algorithms are presentedwith self-explanatory 'pseudo-code.' \* Chapters 1-4 focus onelementary concepts, the exposition unfolding at a slower pace. Sampleexercises with solutions are provided. Sections that may be skippedfor an introductory course are starred. Requires only some basicmathematics background and some computer programming experience. \*Chapters 5-13 progress at a faster pace. The material is suitable forundergraduates or first-year graduates who need only review Chapters 1-4. \* This book may be used for a one-semester introductory course(based on Chapters 1-4 and portions of the chapters on algorithmdesign, hashing, and graph algorithms) and for a one-semester advancedcourse that starts at Chapter 5. A year-long course may be based onthe entire book. \* Sorting, often perceived as rather technical, isnot treated as a separate chapter, but is used in many examples(including bubble sort, merge sort, tree sort, heap sort, quick sort,and several parallel algorithms). Also, lower bounds on sorting bycomparisons are included with the presentation of heaps in the contextof lower bounds for comparison-based structures. \* Chapter 13 onparallel models of computation is something of a mini-book itself, anda good way to end a course. Although it is not clear what parallel.
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 84,78
Währung umrechnenAnzahl: 2 verfügbar
In den WarenkorbPaperback. Zustand: Brand New. 599 pages. 10.00x7.00x1.25 inches. In Stock.
Anbieter: Chiron Media, Wallingford, Vereinigtes Königreich
EUR 83,12
Währung umrechnenAnzahl: 10 verfügbar
In den WarenkorbPF. Zustand: New.
Anbieter: BennettBooksLtd, North Las Vegas, NV, USA
EUR 76,17
Währung umrechnenAnzahl: 1 verfügbar
In den Warenkorbhardcover. Zustand: New. In shrink wrap. Looks like an interesting title!
EUR 52,93
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
EUR 53,15
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 101,47
Währung umrechnenAnzahl: 2 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
Anbieter: Mispah books, Redhill, SURRE, Vereinigtes Königreich
EUR 91,93
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbPaperback. Zustand: Like New. Like New. book.