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=382

• Efficient text searching of regular expressions
  Ricardo A. Baeza-Yates, Gaston H. Gonnet
  Lecture Notes in Computer Science 382, 1989, pp. 1-2
• Efficient spatial point location
  Franco P. Preparata, Roberto Tamassia
  Lecture Notes in Computer Science 382, 1989, pp. 3-11
• Constructing the Voronoi diagram of a set of line segments in parallel
  Michael T. Goodrich, Colm Ó'Dúnlaing, Chee K. Yap
  Lecture Notes in Computer Science 382, 1989, pp. 12-23
• Analysis of kdt-trees: kd-trees improved by local reorganisations
  Walter Cunto, Gustavo Lau, Philippe Flajolet
  Lecture Notes in Computer Science 382, 1989, pp. 24-38
• Optimal algorithms for list indexing and subset rank
  Paul F. Dietz
  Lecture Notes in Computer Science 382, 1989, pp. 39-46
• The Delaunay triangulation closely approximates the complete Euclidean graph
  J. Mark Keil, Carl A. Gutwin
  Lecture Notes in Computer Science 382, 1989, pp. 47-56
• Computing the furthest site Voronoi diagram for a set of discs
  David Rappaport
  Lecture Notes in Computer Science 382, 1989, pp. 57-66
• Fully persistent arrays
  Paul F. Dietz
  Lecture Notes in Computer Science 382, 1989, pp. 67-74
• String searching algorithms revisited
  Ricardo A. Baeza-Yates
  Lecture Notes in Computer Science 382, 1989, pp. 75-96
• Optimal channel placement for multi-terminal nets
  Mikhail J. Atallah, Susanne E. Hambrusch
  Lecture Notes in Computer Science 382, 1989, pp. 97-114
• Computing the minimum visible vertex distance between two polygons
  Alok Aggarwal, Shlomo Moran, Peter W. Shor, Subhash Suri
  Lecture Notes in Computer Science 382, 1989, pp. 115-134
• Computing the kernel of a point set in a polygon
  Yan Ke, Joseph O'Rourke
  Lecture Notes in Computer Science 382, 1989, pp. 135-146
• Using bounded degree spanning trees in the design of efficient algorithms on claw-free graphs
  Marek Chrobak, Joseph Naor, Mark B. Novick
  Lecture Notes in Computer Science 382, 1989, pp. 147-162
• Linear time algorithms for computing reachability regions from polygonal figures
  Rongyao Zhao
  Lecture Notes in Computer Science 382, 1989, pp. 163-170
• Computing the center of area of a polygon
  Matthew Díaz, Joseph O'Rourke
  Lecture Notes in Computer Science 382, 1989, pp. 171-182
• Weighted orthogonal linear L_\infty-approximation and applications
  Michael E. Houle, Hiroshi Imai, Keiko Imai, Jean-Marc Robert
  Lecture Notes in Computer Science 382, 1989, pp. 183-191
• Discs and other related data structures
  Fabrizio Luccio, Mireille Régnier, René Schott
  Lecture Notes in Computer Science 382, 1989, pp. 192-205
• Digital data structures and order statistics
  Wojciech Szpankowski
  Lecture Notes in Computer Science 382, 1989, pp. 206-217
• On the performance of orthogonal range queries in multiattribute and doubly chained trees
  Danièle Gardy, Philippe Flajolet, Claude Puech
  Lecture Notes in Computer Science 382, 1989, pp. 218-229
• Probabilistic analysis of algorithms and data structures
  Luc Devroye
  Lecture Notes in Computer Science 382, 1989, pp. 230-230
• Stabbing parallel segments with a convex polygon
  Michael T. Goodrich, Jack Scott Snoeyink
  Lecture Notes in Computer Science 382, 1989, pp. 231-242
• Selecting the k^{th} largest-area convex polygon
  Jeffrey S. Salowe
  Lecture Notes in Computer Science 382, 1989, pp. 243-250
• Finding all shortest path edge sequences on a convex polyhedron
  Yie-Huei Hwang, Ruei-Chuan Chang, Hung-Yi Tu
  Lecture Notes in Computer Science 382, 1989, pp. 251-266
• Linear algorithms for parity path and two path problems on circular-arc graph
  A. Srinivasa Rao, C. Pandu Rangan
  Lecture Notes in Computer Science 382, 1989, pp. 267-290
• NC algorithms for circular-arc graphs
  Lin Chen
  Lecture Notes in Computer Science 382, 1989, pp. 291-302