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

• Applications of a symbolic perturbation scheme
  C. Yap
  Lecture Notes in Computer Science 318, 1988, pp. 138
• An implicit binomial queue with constant insertion time
  S. Carlsson, J.I. Munro, P.V. Poblete
  Lecture Notes in Computer Science 318, 1988, pp. 1-13
• Implicit selection
  T.W. Lai, D. Wood
  Lecture Notes in Computer Science 318, 1988, pp. 14-23
• An extrapolation of the interpolation search
  S. Carlsson, C. Mattsson
  Lecture Notes in Computer Science 318, 1988, pp. 24-33
• Time parameter and arbitrary deunions in the set union problem
  H. Mannila, E. Ukkonen
  Lecture Notes in Computer Science 318, 1988, pp. 34-42
• Two new algorithms for constructing min-max heaps
  L. Draws, P. Eriksson, E. Forslund, L. Höglund, S. Vallner, T. Strothotte
  Lecture Notes in Computer Science 318, 1988, pp. 43-50
• Extremal cost tree data structures
  D. Wood
  Lecture Notes in Computer Science 318, 1988, pp. 51-63
• Intersecting line segments, ray shooting, and other applications of geometric partitioning techniques
  L. Guibas, M. Overmars, M. Sharir
  Lecture Notes in Computer Science 318, 1988, pp. 64-73
• Problems of posting sentries
  R.P. Krishnaswamy, C.E. Kim
  Lecture Notes in Computer Science 318, 1988, pp. 74-85
• A lower bound and two approximative algorithms for the K-partitioning of rectilinear polygons
  O. Günther
  Lecture Notes in Computer Science 318, 1988, pp. 86-95
• On recognizing and characterizing visibility graphs of simple polygons
  S.K. Ghosh
  Lecture Notes in Computer Science 318, 1988, pp. 96-104
• Connectability problems
  M.H. Overmars
  Lecture Notes in Computer Science 318, 1988, pp. 105-112
• Two hybrid methods for collision resolution in open addressing hashing
  W. Cunto, P.V. Poblete
  Lecture Notes in Computer Science 318, 1988, pp. 113-119
• On an alternative sum useful in the analysis of some data structures
  W. Szpankowski
  Lecture Notes in Computer Science 318, 1988, pp. 120-128
• Bin-packing in 1.5 dimension
  S.-O. Hyland
  Lecture Notes in Computer Science 318, 1988, pp. 129-137
• A fast parallel algorithm for computing all maximal cliques in a graph and the related problems
  E. Dahlhaus, M. Karpinski
  Lecture Notes in Computer Science 318, 1988, pp. 139-144
• Parallel solution of sparse linear systems
  J.R. Gilbert, H. Hafsteinsson
  Lecture Notes in Computer Science 318, 1988, pp. 145-153
• A note on determining the 3-dimensional convex hull of a set of points on a mesh of processors
  F. Dehne, J.-R. Sack, I. Stojmenović
  Lecture Notes in Computer Science 318, 1988, pp. 154-162
• Probabilistic log-space reductions and problems probabilistically hard for P
  L.M. Kirousis, P. Spirakis
  Lecture Notes in Computer Science 318, 1988, pp. 163-175
• Searching with uncertainty
  R.A. Baeza-Yates, J.C. Culberson, G.J.E. Rawlins
  Lecture Notes in Computer Science 318, 1988, pp. 176-189
• An optimal expected-time parallel algorithm for Voronoi diagrams
  C. Levcopoulos, J. Katajainen, A. Lingas
  Lecture Notes in Computer Science 318, 1988, pp. 190-198
• Generating binary trees by transpositions
  A. Proskurowski, F. Ruskey
  Lecture Notes in Computer Science 318, 1988, pp. 199-207
• Approximating the complete Euclidean graph
  J.M. Keil
  Lecture Notes in Computer Science 318, 1988, pp. 208-213
• Upper and lower bounds for the dictionary problem
  M. Dietzfelbinger, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert
  Lecture Notes in Computer Science 318, 1988, pp. 214-215
• Linear algorithms for graph separation problems
  H.N. Djidjev
  Lecture Notes in Computer Science 318, 1988, pp. 216-222