Data Structures and Efficient Algorithms: Final Report on the DFG Special Joint Initiative / Edition 1

Data Structures and Efficient Algorithms: Final Report on the DFG Special Joint Initiative / Edition 1

by Burkhard Monien
     
 

ISBN-10: 3540554882

ISBN-13: 9783540554882

Pub. Date: 06/18/1992

Publisher: Springer Berlin Heidelberg

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

…  See more details below

Overview

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.

Read More

Product Details

ISBN-13:
9783540554882
Publisher:
Springer Berlin Heidelberg
Publication date:
06/18/1992
Series:
Lecture Notes in Computer Science Series, #594
Edition description:
1992
Pages:
395
Product dimensions:
9.21(w) x 6.14(h) x 0.84(d)

Table of Contents

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.

Read More

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >