Librería: HPB-Red, Dallas, TX, Estados Unidos de America
EUR 15,16
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. 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!
Librería: ThriftBooks-Dallas, Dallas, TX, Estados Unidos de America
EUR 18,74
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.
Librería: Romtrade Corp., STERLING HEIGHTS, MI, Estados Unidos de America
EUR 41,82
Cantidad disponible: 5 disponibles
Añadir al carritoCondición: 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.
Librería: SMASS Sellers, IRVING, TX, Estados Unidos de America
EUR 43,67
Cantidad disponible: 5 disponibles
Añadir al carritoCondición: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 40,34
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 620.
EUR 36,40
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 620 68:B&W 7 x 10 in or 254 x 178 mm Case Laminate on White w/Gloss Lam.
Librería: BookHolders, Towson, MD, Estados Unidos de America
EUR 45,42
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: 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.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 39,20
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 620.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 55,43
Cantidad disponible: 2 disponibles
Añadir al carritoCondición: New.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 54,23
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 54,44
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 63,06
Cantidad disponible: 2 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 57,45
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 57,45
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
EUR 56,35
Cantidad disponible: 10 disponibles
Añadir al carritoPF. Condición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 57,44
Cantidad disponible: 2 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 65,23
Cantidad disponible: 2 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: BennettBooksLtd, San Diego, NV, Estados Unidos de America
EUR 78,04
Cantidad disponible: 1 disponibles
Añadir al carritohardcover. Condición: New. In shrink wrap. Looks like an interesting title!
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 83,26
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 620.
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
EUR 73,82
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: New. 2012. Paperback. . . . . .
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
EUR 74,66
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: New. 2001. Hardcover. . . . . .
Librería: Kennys Bookstore, Olney, MD, Estados Unidos de America
EUR 92,18
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: New. 2012. Paperback. . . . . . Books ship from the US and Ireland.
Librería: Kennys Bookstore, Olney, MD, Estados Unidos de America
EUR 93,22
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: New. 2001. Hardcover. . . . . . Books ship from the US and Ireland.
EUR 86,88
Cantidad disponible: 2 disponibles
Añadir al carritoPaperback. Condición: Brand New. 599 pages. 10.00x7.00x1.25 inches. In Stock.
EUR 67,94
Cantidad disponible: Más de 20 disponibles
Añadir al carritoGebunden. Condición: 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,.
EUR 50,35
Cantidad disponible: 5 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. An Introduction to Data Structures and Algorithms | J. A. Storer | Taschenbuch | xvii | Englisch | 2012 | Birkhäuser Boston | EAN 9781461266013 | Verantwortliche Person für die EU: Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Publicado por Birkhäuser Boston, Birkhäuser Boston, 2012
ISBN 10: 1461266017 ISBN 13: 9781461266013
Idioma: Inglés
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 61,18
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: 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.
Publicado por Birkhauser Boston Nov 2001, 2001
ISBN 10: 0817642536 ISBN 13: 9780817642532
Idioma: Inglés
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 85,99
Cantidad disponible: 2 disponibles
Añadir al carritoBuch. Condición: 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.
Publicado por Birkhäuser Boston Nov 2012, 2012
ISBN 10: 1461266017 ISBN 13: 9781461266013
Idioma: Inglés
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 53,49
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: 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.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 84,84
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand pp. 620 66:B&W 7 x 10 in or 254 x 178 mm Perfect Bound on White w/Gloss Lam.