bokomslag Data Structures and Efficient Algorithms
Data & IT

Data Structures and Efficient Algorithms

Burkhard Monien Thomas Ottmann

Pocket

1009:-

Funktionen begränsas av dina webbläsarinställningar (t.ex. privat läge).

Uppskattad leveranstid 7-11 arbetsdagar

Fri frakt för medlemmar vid köp för minst 249:-

  • 395 sidor
  • 1992
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.
  • Författare: Burkhard Monien, Thomas Ottmann
  • Format: Pocket/Paperback
  • ISBN: 9783540554882
  • Språk: Engelska
  • Antal sidor: 395
  • Utgivningsdatum: 1992-05-01
  • Förlag: Springer-Verlag Berlin and Heidelberg GmbH & Co. K