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

• A case study in comparison based complexity: Finding the nearest value(s)
  Walter Cunto, J. Ian Munro, Patricio V. Poblete
  Lecture Notes in Computer Science 519, 1991, pp. 1-12
• On the zone of a surface in a hyperplane arrangement
  Boris Aronov, Micha Sharir
  Lecture Notes in Computer Science 519, 1991, pp. 13-19
• Ray-shooting and isotopy classes of lines in 3-dimensional space
  Marco Pellegrini
  Lecture Notes in Computer Science 519, 1991, pp. 20-31
• Finding level-ancestors in dynamic trees
  Paul F. Dietz
  Lecture Notes in Computer Science 519, 1991, pp. 32-40
• Treewidth of circular-arc graphs
  Ravi Sundaram, Karan Sher Singh, C. Pandu Rangan
  Lecture Notes in Computer Science 519, 1991, pp. 41-41
• Fully dynamic Delaunay triangulation in logarithmic expected time per operation
  Olivier Devillers, Stefan Meiser, Monique Teillaud
  Lecture Notes in Computer Science 519, 1991, pp. 42-53
• On computing the Voronoi diagram for restricted planar figures
  Hristo Djidjev, Andrzej Lingas
  Lecture Notes in Computer Science 519, 1991, pp. 54-64
• The MINSUMCUT problem
  J. Díaz, A.M. Gibbons, M.S. Paterson, J. Torán
  Lecture Notes in Computer Science 519, 1991, pp. 65-79
• Efficient algorithms for the minimum range cut problems
  Naoki Katoh, Kazuo Iwano
  Lecture Notes in Computer Science 519, 1991, pp. 80-91
• Memory access in models of parallel computation: From folklore to synergy and beyond
  Selim G. Akl
  Lecture Notes in Computer Science 519, 1991, pp. 92-104
• Farthest neighbors, maximum spanning trees and related problems in higher dimensions
  Pankaj K. Agarwal, Jiȓí Matous̑ek, Subhash Suri
  Lecture Notes in Computer Science 519, 1991, pp. 105-116
• Shallow interdistance selection and interdistance enumeration
  Jeffrey S. Salowe
  Lecture Notes in Computer Science 519, 1991, pp. 117-128
• Sharing memory in asynchronous message passing systems
  Oscar R. Aguilar, Ajoy Kumar Datta, Sukumar Ghosh
  Lecture Notes in Computer Science 519, 1991, pp. 129-140
• A linear-time scheme for version reconstruction
  Lin Yu, Daniel J. Rosenkrantz
  Lecture Notes in Computer Science 519, 1991, pp. 141-152
• The interval skip list: A data structure for finding all intervals that overlap a point
  Eric N. Hanson
  Lecture Notes in Computer Science 519, 1991, pp. 153-164
• Geometric knapsack problems
  Esther M. Arkin, Samir Khuller, Joseph S.B. Mitchell
  Lecture Notes in Computer Science 519, 1991, pp. 165-176
• A fast derandomization scheme and its applications
  Yijie Han
  Lecture Notes in Computer Science 519, 1991, pp. 177-188
• Unstructured path problems and the making of semirings
  T. Lengauer, D. Theune
  Lecture Notes in Computer Science 519, 1991, pp. 189-200
• Neighborhood graphs and geometric embedding
  Frances Yao
  Lecture Notes in Computer Science 519, 1991, pp. 201-201
• Finding optimal bipartitions of points and polygons
  Joseph S.B. Mitchell, Erik L. Wynters
  Lecture Notes in Computer Science 519, 1991, pp. 202-213
• Immobilizing a polytope
  Jurek Czyzowicz, Ivan Stojmenovic, Jorge Urrutia
  Lecture Notes in Computer Science 519, 1991, pp. 214-227
• What can we learn about suffix trees from independent tries?
  Philippe Jacquet, Wojciech Szpankowski
  Lecture Notes in Computer Science 519, 1991, pp. 228-239
• Competitive algorithms for the weighted list update problem
  Fabrizio d'Amore, Alberto Marchetti-Spaccamela, Umberto Nanni
  Lecture Notes in Computer Science 519, 1991, pp. 240-248
• An optimal algorithm for the rectilinear link center of a rectilinear polygon
  Bengt J. Nilsson, Sven Schuierer
  Lecture Notes in Computer Science 519, 1991, pp. 249-260
• Geometric searching and link distance
  Gautam Das, Giri Narasimhan
  Lecture Notes in Computer Science 519, 1991, pp. 261-272