Data structures and efficient algorithms : final report on the DFG special joint initiative
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 fu...
Salvato in:
| Autore principale: | |
|---|---|
| Altri autori: | |
| Natura: | Livre numérique |
| Lingua: | Anglais |
| Pubblicazione: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serie: | Lecture notes in computer science
594 |
| Soggetti: | |
| Accesso online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Actes d'un symposium tenu à Berlin du 23 au 26 septembre 1991, d'après la préface Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Data structures and efficient algorithms, final report on the DFG special joint initiative, B. Monien, Th. Ottmann (eds.), 1992, Berlin, Springer-Verlag, 1 vol. (VIII-389 p.), Lecture notes in computer science, 3-540-55488-2 • Data Structures and Efficient Algorithms, Texte imprimé, 9783662167700 |
Sommario:
- 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.