default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDData Structures and Efficient Algorithms 1992
- Burkhard Monien, Thomas Ottmann:
Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative. Lecture Notes in Computer Science 594, Springer 1992, ISBN 3-540-55488-2
Geometric Algorithms
- Helmut Alt, Johannes Blömer:
Resemblance and Symmetries of Geometric Patterns. 1-24 - Rudolf Fleischer, Otfried Fries, Kurt Mehlhorn, Stefan Meiser, Stefan Näher, Hans Rohnert, Stefan Schirra, Klaus Simon, Athanasios K. Tsakalidis, Christian Uhrig:
Selected Topics from Computational Geometry, Data Structures and Motion Planning. 25-43 - Franz Höfting, Thomas Lengauer, Egon Wanke:
Processing of Hierarchically Defined Graphs and Graph Families. 44-69 - Hans-Peter Kriegel, Thomas Brinkhoff, Ralf Schneider:
The Combination of Spatial Access Methods and Computational Geometry in Geographic Database Systems. 70-86 - Hans-Peter Kriegel, Peter Heep, Stephan Heep, Michael Schiwietz, Ralf Schneider:
A Flexible and Extensible Index Manager for Spatial Database Systems. 87-103 - Hans-Peter Kriegel, Holger Horn, Michael Schiwietz:
The Performance of Object Decomposition Techniques for Spatial Query Processing. 104-123 - Heinrich Müller, Jörg Winckler:
Distributed Image Synthesis with Breadth-First Ray Tracing and the Ray-Z-Buffer. 124-147 - Bengt J. Nilsson, Thomas Ottmann, Sven Schuierer, Christian Icking:
Restricted Orientation Computational Geometry. 148-185 - Hartmut Noltemeier, Knut Verbarg, Christian Zirkelbach:
Monotonous Bisector* Trees - A Tool for Efficient Partitioning of Complex Scenes of Geometric Objects. 186-203 - Bernd Schmeltz:
Learning Convex Sets Under Uniform Distribution. 204-213 - Hans-Werner Six, Peter Widmayer:
Spatial Access Structures for Geometric Databases. 214-232 - Emo Welzl:
On Spanning Trees with Low Crossing Numbers. 233-249
Parallel and Distributed Algorithms
- Martin Dietzfelbinger, Friedhelm Meyer auf der Heide:
High Performance Universal Hashing, with Applications to Shared Memory Simulations. 250-269 - Rainer Feldmann, Peter Mysliwietz, Burkhard Monien:
Distributed Game Tree Search on a Massively Parallel System. 270-288 - Manfred Kunde, Thomas Tensi:
Balanced Strategies for Routing on Meshes. 289-308 - Miroslaw Kutylowski:
Complexity of Boolean Functions on PRAMs - Lower Bound Techniques. 309-329 - Berthold Kröger, Oliver Vornberger:
Enumerative vs. Genetic Optimization: Two Parallel Algorithms for the Bin Packing Problem. 330-362 - Rüdiger Reischuk, Bernd Schmeltz:
Area Efficient Methods to Increase the Reliability of Circuits. 363-389
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-08 20:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
