data structures algorithms von mehlhorn (131 Ergebnisse)

Hardcover/ Pappband. Zustand: Wie neu. 260 S. Mathematics Mathematik Datenstrukturen Algorithmen Sehr guter Zustand/ very good Ex-Library. ha1079990 Sprache: Englisch Gewicht in Gramm: 600.

Hardcover. Zustand: Very Good. No Jacket. Missing dust jacket; May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 1.36.

Zustand: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.

Zustand: Gut. ex Library Book / aus einer wissenschafltichen Bibliothek / Sprache: Englisch Gewicht in Gramm: 969 23,2 x 16,7 x 2,8 cm, Gebundene Ausgabe.

Zustand: New. Brand New. Soft Cover International Edition. Different ISBN and Cover Image. Priced lower than the standard editions which is usually intended to make them more affordable for students abroad. The core content of the book is generally the same as the standard edition. The country selling restrictions may be printed on the book but is no problem for the self-use. This Item maybe shipped from US or any other country as we have multiple locations worldwide.

Zustand: Good. Used book that is in clean, average condition without any missing pages.

Soft cover. Zustand: New. ISBN:9788132205272.

Hardcover. 336 p. Good condition. Reading pages are clean and without marks. Retired library exemplar, with the usual marking. Book shows slight signs of storage and usage. Edge slightly bumped. Still good copy. 9783540133025 Sprache: Englisch Gewicht in Gramm: 1000.

Hardcover. Zustand: Bon. Ancien livre de bibliothèque. Traces d'usure sur la couverture. Edition 1984. Tome 2. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Good. Former library book. Signs of wear on the cover. Edition 1984. Volume 2. Ammareal gives back up to 15% of this item's net price to charity organizations.

HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

Taschenbuch. Zustand: Neu. Neuware Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 280 pp. Englisch.

Taschenbuch. Zustand: 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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 356 pp. Englisch.

Taschenbuch. Zustand: Neu. Neuware -InhaltsangabeVII. Multidimensional Data Structures.- 1. A Black Box Approach to Data Structures.- 1.1 Dynamization.- 1.2 Weighting and Weighted Dynamization.- 1.3 Order Decomposable Problems.- 2. Multi-dimensional Searching Problems.- 2.1 D-dimensional Trees and Polygon Trees.- 2.2 Range Trees and Multidimensional Divide and Conquer.- 2.3 Lower Bounds.- 2.3.1 Partial MatchRetrieval in Minimum Space.- 2.3.2 The Spanning Bound.- 3. Exercises.- 4. Bibliographic Notes.- VIII. Computational Geometry.- 1. Convex Polygons.- 2. Convex Hulls.- 3. Voronoi Diagrams and Searching Planar Subdivisions.- 3.1 Voronoi Diagrams.- 3.2 Searching Planar Subdivisions.- 3.2.1 Removal of Large Independent Sets.- 3.2.2 Path Decompositions.- 3.2.3 Searching Dynamic Planar Subdivisions.- 3.3 Applications.- 4. The Sweep Paradigm.- 4.1 Intersection of Line Segments and Other Intersection Problems in the Plane.- 4.2 Triangulation and its Applications.- 4.3 Space Sweep.- 5. The Realm of Orthogonal Objects.- 5.1 Plane Sweep for Iso-Oriented Objects.- 5.1.1 The Interval Tree and its Applications.- 5.1.2 The Priority Search Tree and its Applications.- 5.1.3 Segment Trees.- 5.1.4 Path Decomposition and Plane Sweep for Non-Iso-Oriented Objects.- 5.2 Divide and Conquer on Iso-Oriented Objects.- 5.2.1 The Line Segment Intersection Problem.- 5.2.2 The Measure and Contour Problems.- 5.3 Intersection Problems in Higher-Dimensional Space.- 6. Geometric Transforms.- 6.1 Duality.- 6.2 Inversion.- 7. Exercises.- 8. Bibliographic Notes.- IX. Algorithmic Paradigms.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 304 pp. Englisch.

Zustand: New. In.

Zustand: Buone. inglese Condizioni dell'esterno: Discrete con difetti, macchie Condizioni dell'interno: Ottime.

Hardcover. Zustand: Near Fine. 3 hardbacks in near fine condition. 3 volume set. Volume 1, Sorting and Searching ISBN: 038713302x. Volume 2, Graph Algorithms and NP-Completeness ISBN: 038713641x. Volume 3, Multi-Dimensional Searching and Computational Geometry ISBN: 0387136428.

paperback. Zustand: New. Ship out in 2 business day, And Fast shipping, Free Tracking number will be provided after the shipment.Paperback. Pub Date :2013-04-01 Pages: 224 Language: Chinese Publisher: Tsinghua University Press algorithm is the core of every computer application . Algorithms are computer science a new and active area. Each computer scientists and professional programmers should be familiar with the basic algorithm tool kit : the effective organization and retrieval of data structures ; commonly used algorithms: for modeling . understanding and solving algorithmic problems of basic techniques. World famo.Four Satisfaction guaranteed,or money back.