EUR 15,03
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : 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!
Vendeur : ThriftBooks-Dallas, Dallas, TX, Etats-Unis
EUR 18,57
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.
Vendeur : ThriftBooks-Dallas, Dallas, TX, Etats-Unis
EUR 18,57
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.
Vendeur : Romtrade Corp., STERLING HEIGHTS, MI, Etats-Unis
EUR 40,02
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 41,79
Autre deviseQuantité disponible : 5 disponible(s)
Ajouter au panierEtat : New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.
EUR 39,12
Autre deviseQuantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. pp. 620.
EUR 34,96
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 45,11
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierBrand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
EUR 45
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.
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
EUR 38,63
Autre deviseQuantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. pp. 620.
EUR 54,37
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierEtat : New.
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
EUR 53,73
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
EUR 53,94
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
EUR 62,48
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierEtat : As New. Unread book in perfect condition.
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
EUR 58,09
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
EUR 55,11
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierEtat : New.
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
EUR 55,11
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierEtat : As New. Unread book in perfect condition.
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
EUR 58,09
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
EUR 56,98
Autre deviseQuantité disponible : 10 disponible(s)
Ajouter au panierPF. Etat : New.
Vendeur : BennettBooksLtd, San Diego, NV, Etats-Unis
EUR 77,31
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierhardcover. Etat : New. In shrink wrap. Looks like an interesting title!
EUR 81,38
Autre deviseQuantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. pp. 620.
Vendeur : Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlande
EUR 73,93
Autre deviseQuantité disponible : 15 disponible(s)
Ajouter au panierEtat : New. 2012. Paperback. . . . . .
Vendeur : Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlande
EUR 83,53
Autre deviseQuantité disponible : 15 disponible(s)
Ajouter au panierEtat : New. 2001. Hardcover. . . . . .
EUR 91,16
Autre deviseQuantité disponible : 15 disponible(s)
Ajouter au panierEtat : New. 2012. Paperback. . . . . . Books ship from the US and Ireland.
EUR 104,10
Autre deviseQuantité disponible : 15 disponible(s)
Ajouter au panierEtat : New. 2001. Hardcover. . . . . . Books ship from the US and Ireland.
EUR 86,18
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierPaperback. Etat : Brand New. 599 pages. 10.00x7.00x1.25 inches. In Stock.
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 Birkhäuser Boston, Birkhäuser Boston, 2012
ISBN 10 : 1461266017 ISBN 13 : 9781461266013
Langue: anglais
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
EUR 61,18
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.
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.
Edité par Birkhäuser Boston Nov 2012, 2012
ISBN 10 : 1461266017 ISBN 13 : 9781461266013
Langue: anglais
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
EUR 53,49
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - 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 620 pp. Englisch.