Data Structures and Algorithms 1 | Sorting and Searching
K. Mehlhorn
ISBN 10: 3642696740 ISBN 13: 9783642696749
Published by Springer, 2011
New
Taschenbuch
From
preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
AbeBooks Seller since 5 August 2024
This specific item is no longer available.
About this Item
Description:
Data Structures and Algorithms 1 | Sorting and Searching | K. Mehlhorn | Taschenbuch | xiv | Englisch | 2011 | Springer | EAN 9783642696749 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Seller Inventory # 106332689
Synopsis:
The design and analysis of data structures and efficient algorithms has gained considerable importance in recent years. The concept of "algorithm" is central in computer science, and "efficiency" is central in the world of money. I have organized the material in three volumes and nine chapters. Vol. 1: Sorting and Searching (chapters I to III) Vol. 2: Graph Algorithms and NP-completeness (chapters IV to VI) Vol. 3: Multi-dimensional Searching and Computational G- metry (chapters VII and VIII) Volumes 2 and 3 have volume 1 as a common basis but are indepen dent from each other. Most of volumes 2 and 3 can be understood without knowing volume 1 in detail. A general kowledge of algorith mic principles as laid out in chapter 1 or in many other books on algorithms and data structures suffices for most parts of volumes 2 and 3. The specific prerequisites for volumes 2 and 3 are listed in the prefaces to these volumes. In all three volumes we present and analyse many important efficient algorithms for the fundamental computa tional problems in the area. Efficiency is measured by the running time on a realistic model of a computing machine which we present in chapter I. Most of the algorithms presented are very recent inven tions; after all computer science is a very young field. There are hardly any theorems in this book which are older than 20 years and at least fifty percent of the material is younger than 10 years.
"About this title" may belong to another edition of this title.
Bibliographic Details
Title: Data Structures and Algorithms 1 | Sorting ...
Publisher: Springer
Publication Date: 2011
Binding: Taschenbuch
Condition: Neu
Top Search Results from the AbeBooks Marketplace
Seller Image
Data Structures and Algorithms 1: Sorting and Searching.
Published by
Berlin: Springer, 2011
ISBN 10: 3642696740
ISBN 13: 9783642696749
Used
Hardcover
First Edition
Seller: Plurabelle Books Ltd, Cambridge, United Kingdom
Seller rating 5 out of 5 stars
Hardcover. Condition: Very Good. Series: Monographs in Theoretical Computer Science. An EATCS Series. xiii 336p large hardback, silver boards with red rule, text from typescript, excellent fresh copy, no library markings, Language: English. Seller Inventory # 243151
Seller Image
Data Structures and Algorithms 1 : Sorting and Searching
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 18758149-n
Buy New
£ 41.34
£ 15 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Stock Image
Data Structures and Algorithms 1
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # DB-9783642696749
Buy New
£ 41.35
£ 5.02 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Seller Image
Data Structures and Algorithms 1
Published by
Springer Berlin Heidelberg, 2011
ISBN 10: 3642696740
ISBN 13: 9783642696749
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. The design and analysis of data structures and efficient algorithms has gained considerable importance in recent years. The concept of algorithm is central in computer science, and efficiency is central in the world of money. I have organized the materi. Seller Inventory # 5068346
Buy New
£ 42.15
£ 42.45 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available
Seller Image
Data Structures and Algorithms 1 : Sorting and Searching
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 18758149-n
Stock Image
Data Structures and Algorithms 1: Sorting and Searching (Monographs in Theoretical Computer Science. An EATCS Series)
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Mar3113020234299
Stock Image
Data Structures and Algorithms 1
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # DB-9783642696749
Seller Image
Data Structures and Algorithms 1 : Sorting and Searching
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 18758149
Seller Image
Data Structures and Algorithms 1
Published by
Springer, Springer Berlin Heidelberg Dez 2011, 2011
ISBN 10: 3642696740
ISBN 13: 9783642696749
New
Taschenbuch
Seller: Wegmann1855, Zwiesel, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Neuware -The design and analysis of data structures and efficient algorithms has gained considerable importance in recent years. The concept of 'algorithm' is central in computer science, and 'efficiency' is central in the world of money. I have organized the material in three volumes and nine chapters. Vol. 1: Sorting and Searching (chapters I to III) Vol. 2: Graph Algorithms and NP-completeness (chapters IV to VI) Vol. 3: Multi-dimensional Searching and Computational G- metry (chapters VII and VIII) Volumes 2 and 3 have volume 1 as a common basis but are indepen dent from each other. Most of volumes 2 and 3 can be understood without knowing volume 1 in detail. A general kowledge of algorith mic principles as laid out in chapter 1 or in many other books on algorithms and data structures suffices for most parts of volumes 2 and 3. The specific prerequisites for volumes 2 and 3 are listed in the prefaces to these volumes. In all three volumes we present and analyse many important efficient algorithms for the fundamental computa tional problems in the area. Efficiency is measured by the running time on a realistic model of a computing machine which we present in chapter I. Most of the algorithms presented are very recent inven tions; after all computer science is a very young field. There are hardly any theorems in this book which are older than 20 years and at least fifty percent of the material is younger than 10 years. Seller Inventory # 9783642696749
Seller Image
Data Structures and Algorithms 1 : Sorting and Searching
Published by
Springer Berlin Heidelberg, 2011
ISBN 10: 3642696740
ISBN 13: 9783642696749
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - The design and analysis of data structures and efficient algorithms has gained considerable importance in recent years. The concept of 'algorithm' is central in computer science, and 'efficiency' is central in the world of money. I have organized the material in three volumes and nine chapters. Vol. 1: Sorting and Searching (chapters I to III) Vol. 2: Graph Algorithms and NP-completeness (chapters IV to VI) Vol. 3: Multi-dimensional Searching and Computational G- metry (chapters VII and VIII) Volumes 2 and 3 have volume 1 as a common basis but are indepen dent from each other. Most of volumes 2 and 3 can be understood without knowing volume 1 in detail. A general kowledge of algorith mic principles as laid out in chapter 1 or in many other books on algorithms and data structures suffices for most parts of volumes 2 and 3. The specific prerequisites for volumes 2 and 3 are listed in the prefaces to these volumes. In all three volumes we present and analyse many important efficient algorithms for the fundamental computa tional problems in the area. Efficiency is measured by the running time on a realistic model of a computing machine which we present in chapter I. Most of the algorithms presented are very recent inven tions; after all computer science is a very young field. There are hardly any theorems in this book which are older than 20 years and at least fifty percent of the material is younger than 10 years. Seller Inventory # 9783642696749