Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=594

• Resemblance and symmetries of geometric patterns
  Helmut Alt, Johannes Blömer
  Lecture Notes in Computer Science 594, 1992, pp. 1-24
• Selected topics from computational geometry, data structures and motion planning
  Rudolf Fleischer, Otfried Fries, Kurt Mehlhorn, Stefan Meiser, Stefan Näher, Hans Rohnert, Stefan Schirra, Klaus Simon, Athanasios Tsakalidis, Christian Uhrig
  Lecture Notes in Computer Science 594, 1992, pp. 25-43
• Processing of hierarchically defined graphs and graph families
  Franz Höfting, Thomas Lengauer, Egon Wanke
  Lecture Notes in Computer Science 594, 1992, pp. 44-69
• The combination of spatial access methods and computational geometry in geographic database systems
  Hans-Peter Kriegel, Thomas Brinkhoff, Ralf Schneider
  Lecture Notes in Computer Science 594, 1992, pp. 70-86
• A flexible and extensible index manager for spatial database systems
  Hans-Peter Kriegel, Peter Heep, Stephan Heep, Michael Schiwietz, Ralf Schneider
  Lecture Notes in Computer Science 594, 1992, pp. 87-103
• The performance of object decomposition techniques for spatial query processing
  Hans-Peter Kriegel, Holger Horn, Michael Schiwietz
  Lecture Notes in Computer Science 594, 1992, pp. 104-123
• Distributed image synthesis with breadth-first ray tracing and the ray-z-buffer
  Heinrich Müller, Jörg Winckler
  Lecture Notes in Computer Science 594, 1992, pp. 124-147
• Restricted orientation computational geometry
  Bengt J. Nilsson, Thomas Ottmann, Sven Schuierer, Christian Icking
  Lecture Notes in Computer Science 594, 1992, pp. 148-185
• Monotonous bisector^* trees-A tool for efficient partitioning of complex scenes of geometric objects
  H. Noltemeier, K. Verbarg, C. Zirkelbach
  Lecture Notes in Computer Science 594, 1992, pp. 186-203
• Learning convex sets under uniform distribution
  Bernd Schmeltz
  Lecture Notes in Computer Science 594, 1992, pp. 204-213
• Spatial access structures for geometric databases
  Hans-Werner Six, Peter Widmayer
  Lecture Notes in Computer Science 594, 1992, pp. 214-232
• On spanning trees with low crossing numbers
  Emo Welzl
  Lecture Notes in Computer Science 594, 1992, pp. 233-249
• High performance universal hashing, with applications to shared memory simulations
  Martin Dietzfelbinger, Friedhelm Meyer auf der Heide
  Lecture Notes in Computer Science 594, 1992, pp. 250-269
• Distributed game tree search on a massively parallel system
  R. Feldmann, P. Mysliwietz, B. Monien
  Lecture Notes in Computer Science 594, 1992, pp. 270-288
• Balanced strategies for routing on meshes
  Manfred Kunde, Thomas Tensi
  Lecture Notes in Computer Science 594, 1992, pp. 289-308
• Complexity of Boolean functions on PRAMs-Lower bound techniques
  Mirosƚaw Kutyƚowski
  Lecture Notes in Computer Science 594, 1992, pp. 309-329
• Enumerative vs.\ genetic optimization-Two parallel algorithms for the bin packing problem
  Berthold Kröger, Oliver Vornberger
  Lecture Notes in Computer Science 594, 1992, pp. 330-362
• Area efficient methods to increase the reliability of circuits
  Rüdiger Reischuk, Bernd Schmeltz
  Lecture Notes in Computer Science 594, 1992, pp. 363-389