Data structures and efficient algorithms : final report on the DFG special joint initiative. B. Monien ; Th. Ottmann (ed.) / Lecture notes in computer science ; 594

Monien, Burkhard (Herausgeber) :

ISBN 10: 3540554882 / ISBN 13: 9783540554882

Published by Berlin ; Heidelberg ; New York ; London ; Paris ; Tokyo ; Hong Kong ; Barcelona ; Budapest : Springer, 1992

About this Item

VIII, 389 S. : graph. Darst. ; 24 cm Kanten etwas berieben / bestossen, Besitzeintrag, papierbedingte Seitenbräunung /// Standort Wimregal HAA-65076 ISBN 9783540554882 Sprache: Englisch Gewicht in Gramm: 674.

Seller Inventory # 202425

Bibliographic Details

• Title: Data structures and efficient algorithms : final report on the DFG special joint initiative. B. Monien ; Th. Ottmann (ed.) / Lecture notes in computer science ; 594
• Publisher: Berlin ; Heidelberg ; New York ; London ; Paris ; Tokyo ; Hong Kong ; Barcelona ; Budapest : Springer
• Publication Date: 1992
• Language: English
• ISBN 10: 3540554882
• ISBN 13: 9783540554882
• Binding: kart.
• Condition: Befriedigend
• Weight: 674 grams
• Seller catalogs:
  • Computer Internet

About this title

Synopsis

Algorithms are a central concept in computer science. The German Science Foundation (DFG) started a special joint initiative on data structures and efficient algorithms in 1986 with the aim of encouraging collaborative research on algorithms. For a period of five years about a dozen projects were funded with an emphasis on algorithms and data structures for geometric problems, on the one hand, and parallel and distributed algorithms, on the other. This volume contains 18 papers that are intended to give an impression of the achievements of this joint research initiative. The first group of papers addresses research on fundamental data structures, computational geometry, graph algorithms, computer graphics, and spatial databases. The second group of papers centers on the following problems: the design of parallel architectures and routing strategies, simulation of parallel machines, and the design of distributed algorithms for solving difficult problems.