Importo totale (1 articolo articoli):
Destinazione ordine:
introduction data structures algorithms di storer j a (34 risultati)
Vai alla pagina principale dei risultati di ricerca
Filtri di ricerca
Tipo di articolo
- Tutti i tipi di prodotto
- Libri (34)
- Riviste e Giornali (Nessun altro risultato corrispondente a questo perfezionamento)
- Fumetti (Nessun altro risultato corrispondente a questo perfezionamento)
- Spartiti (Nessun altro risultato corrispondente a questo perfezionamento)
- Arte, Stampe e Poster (Nessun altro risultato corrispondente a questo perfezionamento)
- Fotografie (Nessun altro risultato corrispondente a questo perfezionamento)
- Mappe (Nessun altro risultato corrispondente a questo perfezionamento)
- Manoscritti e Collezionismo cartaceo (Nessun altro risultato corrispondente a questo perfezionamento)
Condizioni Maggiori informazioni
- Nuovo (29)
- Come nuovo, Ottimo o Quasi ottimo (2)
- Molto buono o Buono (3)
- Discreto o Mediocre (Nessun altro risultato corrispondente a questo perfezionamento)
- Come descritto (Nessun altro risultato corrispondente a questo perfezionamento)
Legatura
Ulteriori caratteristiche
- Prima ed. (Nessun altro risultato corrispondente a questo perfezionamento)
- Copia autograf. (Nessun altro risultato corrispondente a questo perfezionamento)
- Sovracoperta (Nessun altro risultato corrispondente a questo perfezionamento)
- Con foto (11)
- Non Print on Demand (29)
Lingua (1)
Spedizione gratuita
Paese del venditore
Valutazione venditore
-
Hardcover. Condizione: 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!
-
An Introduction to Data Structures and Algorithms
Da: ThriftBooks-Dallas, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.
-
An Introduction To Data Structures And Algorithms
Da: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: 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.
-
Condizione: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.
-
An Introduction to Data Structures and Algorithms
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. pp. 620.
-
An Introduction to Data Structures and Algorithms
Da: Majestic Books, Hounslow, Regno Unito
Valutazione del venditore 4 su 5 stelle
EUR 36,12
EUR 7,38 per la spedizione da Regno Unito a U.S.A.Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. pp. 620 68:B&W 7 x 10 in or 254 x 178 mm Case Laminate on White w/Gloss Lam.
-
Condizione: 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.
-
An Introduction to Data Structures and Algorithms
Da: Biblios, Frankfurt am main, HESSE, Germania
Valutazione del venditore 4 su 5 stelle
EUR 39,20
EUR 9,95 per la spedizione da Germania a U.S.A.Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. pp. 620.
-
Introduction to Data Structures and Algorithms
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New.
-
Condizione: New. SUPER FAST SHIPPING.
-
Condizione: New. SUPER FAST SHIPPING.
-
An Introduction to Data Structures and Algorithms
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New.
-
An Introduction to Data Structures and Algorithms
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New.
-
Introduction to Data Structures and Algorithms
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: As New. Unread book in perfect condition.
-
An Introduction to Data Structures and Algorithms
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 57,44
EUR 13,60 per la spedizione da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
-
An Introduction to Data Structures and Algorithms
Da: Chiron Media, Wallingford, Regno Unito
Valutazione del venditore 4 su 5 stelle
EUR 56,34
EUR 17,58 per la spedizione da Regno Unito a U.S.A.Quantità: 10 disponibili
Aggiungi al carrelloPF. Condizione: New.
-
Introduction to Data Structures and Algorithms
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 57,43
EUR 17,03 per la spedizione da Regno Unito a U.S.A.Quantità: 2 disponibili
Aggiungi al carrelloCondizione: New.
-
Introduction to Data Structures and Algorithms
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 65,21
EUR 17,03 per la spedizione da Regno Unito a U.S.A.Quantità: 2 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
-
An Introduction to Data Structures and Algorithms
Da: BennettBooksLtd, San Diego, NV, U.S.A.
Valutazione del venditore 5 su 5 stelle
hardcover. Condizione: New. In shrink wrap. Looks like an interesting title!
-
An Introduction to Data Structures and Algorithms
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. pp. 620.
-
An Introduction to Data Structures and Algorithms
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Valutazione del venditore 5 su 5 stelle
EUR 73,82
EUR 10,50 per la spedizione da Irlanda a U.S.A.Quantità: 15 disponibili
Aggiungi al carrelloCondizione: New. 2012. Paperback. . . . . .
-
An Introduction to Data Structures and Algorithms
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Valutazione del venditore 5 su 5 stelle
EUR 74,66
EUR 10,50 per la spedizione da Irlanda a U.S.A.Quantità: 15 disponibili
Aggiungi al carrelloCondizione: New. 2001. Hardcover. . . . . .
-
An Introduction to Data Structures and Algorithms
Da: Kennys Bookstore, Olney, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. 2012. Paperback. . . . . . Books ship from the US and Ireland.
-
An Introduction to Data Structures and Algorithms
Da: Kennys Bookstore, Olney, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. 2001. Hardcover. . . . . . Books ship from the US and Ireland.
-
An Introduction to Data Structures and Algorithms
Da: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 86,17
EUR 17,03 per la spedizione da Regno Unito a U.S.A.Quantità: 2 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 599 pages. 10.00x7.00x1.25 inches. In Stock.
-
EUR 67,94
EUR 48,99 per la spedizione da Germania a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloGebunden. Condizione: 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
EUR 70,00 per la spedizione da Germania a U.S.A.Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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.
-
An Introduction to Data Structures and Algorithms
Editore: Birkhäuser Boston, Birkhäuser Boston, 2012
ISBN 10: 1461266017 ISBN 13: 9781461266013
Lingua: Inglese
EUR 61,18
EUR 65,74 per la spedizione da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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.
-
An Introduction to Data Structures and Algorithms
Editore: Birkhauser Boston Nov 2001, 2001
ISBN 10: 0817642536 ISBN 13: 9780817642532
Lingua: Inglese
EUR 85,99
EUR 66,43 per la spedizione da Germania a U.S.A.Quantità: 2 disponibili
Aggiungi al carrelloBuch. Condizione: 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.
-
An Introduction to Data Structures and Algorithms
Editore: Birkhäuser Boston Nov 2012, 2012
ISBN 10: 1461266017 ISBN 13: 9781461266013
Lingua: Inglese
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
EUR 53,49
EUR 23,00 per la spedizione da Germania a U.S.A.Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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.
