Vendeur : ThriftBooks-Atlanta, AUSTELL, GA, Etats-Unis
EUR 18,42
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 2.85.
Vendeur : ThriftBooks-Dallas, Dallas, TX, Etats-Unis
EUR 18,42
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 2.85.
Vendeur : Romtrade Corp., STERLING HEIGHTS, MI, Etats-Unis
EUR 38,40
Autre deviseQuantité disponible : 5 disponible(s)
Ajouter au panierEtat : 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.
EUR 36,86
Autre deviseQuantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. pp. 620 68:B&W 7 x 10 in or 254 x 178 mm Case Laminate on White w/Gloss Lam.
EUR 40,92
Autre deviseQuantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. pp. 620.
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
EUR 41,72
Autre deviseQuantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. pp. 620.
Edité par Springer-Verlag New York Inc., 2012
ISBN 10 : 1461266017 ISBN 13 : 9781461266013
Langue: anglais
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
EUR 49,44
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierPAP. Etat : New. New Book. Shipped from UK. Established seller since 2000.
Edité par Springer-Verlag New York Inc., 2012
ISBN 10 : 1461266017 ISBN 13 : 9781461266013
Langue: anglais
Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
EUR 57,09
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierPAP. Etat : New. New Book. Shipped from UK. Established seller since 2000.
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
EUR 55,16
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
EUR 60,75
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
Vendeur : Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlande
EUR 60,53
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierEtat : New. 2012. Paperback. . . . . .
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
EUR 49,43
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierEtat : New.
EUR 57,84
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierEtat : 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,.
Vendeur : Bay State Book Company, North Smithfield, RI, Etats-Unis
EUR 18,42
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierEtat : 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,29
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierEtat : New.
Edité par Birkhäuser Boston, Birkhäuser Boston, 2012
ISBN 10 : 1461266017 ISBN 13 : 9781461266013
Langue: anglais
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
EUR 60,48
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierTaschenbuch. Etat : 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.
EUR 56,22
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierEtat : As New. Unread book in perfect condition.
Edité par Springer-Verlag New York Inc., US, 2012
ISBN 10 : 1461266017 ISBN 13 : 9781461266013
Langue: anglais
Vendeur : Rarewaves.com UK, London, Royaume-Uni
EUR 73,74
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierPaperback. Etat : 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 44,49
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierEtat : 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.
EUR 74,88
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierEtat : New. 2012. Paperback. . . . . . Books ship from the US and Ireland.
EUR 67,94
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierGebunden. Etat : 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,.
Edité par Springer-Verlag New York Inc., US, 2012
ISBN 10 : 1461266017 ISBN 13 : 9781461266013
Langue: anglais
Vendeur : Rarewaves.com USA, London, LONDO, Royaume-Uni
EUR 81,70
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierPaperback. Etat : 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 83,24
Autre deviseQuantité disponible : 10 disponible(s)
Ajouter au panierPF. Etat : New.
EUR 84,92
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierPaperback. Etat : Brand New. 599 pages. 10.00x7.00x1.25 inches. In Stock.
Edité par Birkhauser Boston Nov 2001, 2001
ISBN 10 : 0817642536 ISBN 13 : 9780817642532
Langue: anglais
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
EUR 85,99
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierBuch. Etat : 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.
Vendeur : BennettBooksLtd, North Las Vegas, NV, Etats-Unis
EUR 76,43
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierhardcover. Etat : New. In shrink wrap. Looks like an interesting title!
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
EUR 53,11
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
EUR 53,33
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
EUR 101,61
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierEtat : As New. Unread book in perfect condition.
Vendeur : Mispah books, Redhill, SURRE, Royaume-Uni
EUR 92,06
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierPaperback. Etat : Like New. Like New. book.