Data Structures and Efficient Algorithms: Final Report on the DFG Special Joint Initiative (repost)
Data Structures and Efficient Algorithms: Final Report on the DFG Special Joint Initiative By Burkhard Monien, Thomas Ottmann
Publisher: Springer 1992 | 389 Pages | ISBN: 3540554882 , 0387554882 | DJVU | 4 MB
Publisher: Springer 1992 | 389 Pages | ISBN: 3540554882 , 0387554882 | DJVU | 4 MB
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.