Data Structures and Efficient Algorithms
Final Report on the DFG Special Joint Initiative
Published on 20. May 1992
Book
Paperback/Softback
IX, 395 pages
978-3-540-55488-2 (ISBN)
Description
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.
More details
Series
Edition
1992 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
IX, 395 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 22 mm
Weight
610 gr
ISBN-13
978-3-540-55488-2 (9783540554882)
DOI
10.1007/3-540-55488-2
Schweitzer Classification
Content
Resemblance and symmetries of geometric patterns.- Selected topics from computational geometry, data structures and motion planning.- Processing of hierarchically defined graphs and graph families.- The combination of spatial access methods and computational geometry in geographic database systems.- A flexible and extensible index manager for spatial database systems.- The performance of object decomposition techniques for spatial query processing.- Distributed image synthesis with breadth-first ray tracing and the ray-z-buffer.- Restricted orientation computational geometry.- Monotonous Bisector* Trees - a tool for efficient partitioning of complex scenes of geometric objects.- Learning convex sets under uniform distribution.- Spatial access structures for geometric databases.- On spanning trees with low crossing numbers.- High performance universal hashing, with applications to shared memory simulations.- Distributed game tree search on a massively parallel system.- Balanced strategies for routing on meshes.- Complexity of Boolean functions on PRAMs - Lower bound techniques.- Enumerative vs. genetic optimization two parallel algorithms for the bin packing problem.- Area efficient methods to increase the reliability of circuits.