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 [1]	Hilfe

Suche: Series=LNCS AND Volume=1284

• Minimum spanning trees in d dimensions
  Drago Krznaric, Christos Levcopoulos, Bengt J. Nilsson
  Lecture Notes in Computer Science 1284, 1997, pp. 341-349
• Relaxed balance for search trees with local rebalancing
  Kim S. Larsen, Thomas Ottmann, Eljas Soisalon-Soininen
  Lecture Notes in Computer Science 1284, 1997, pp. 350-363
• Improved approximations for minimum cardinality quadrangulations of finite element meshes
  Matthias Müller-Hannemann, Karsten Weihe
  Lecture Notes in Computer Science 1284, 1997, pp. 364-377
• Dynamic storage allocation with known durations
  Joseph (Seffi) Naor, Ariel Orda, Yael Petruschka
  Lecture Notes in Computer Science 1284, 1997, pp. 378-387
• Coloring in sublinear time
  Andreas Nolte, Rainer Schrader
  Lecture Notes in Computer Science 1284, 1997, pp. 388-401
• Competitive analysis of on-line stack-up algorithms
  J. Rethmann, E. Wanke
  Lecture Notes in Computer Science 1284, 1997, pp. 402-415
• Scheduling-LPs bear probabilities - Randomized approximations for min-sum criteria
  Andreas S. Schulz, Martin Skutella
  Lecture Notes in Computer Science 1284, 1997, pp. 416-429
• On piercing sets of axis-parallel rectangles and rings
  Michael Segal
  Lecture Notes in Computer Science 1284, 1997, pp. 430-442
• Seven problems: So different yet close
  Sergey Sevastianov
  Lecture Notes in Computer Science 1284, 1997, pp. 443-458
• Linear-time reconstruction of Delaunay triangulations with applications
  Jack Snoeyink, Marc van Kreveld
  Lecture Notes in Computer Science 1284, 1997, pp. 459-471
• Approximating satisfiable satisfiablility problems
  Luca Trevisan
  Lecture Notes in Computer Science 1284, 1997, pp. 472-485
• Algorithms for computing signs of 2 \times 2 determinants: Dynamics and average-case analysis
  Brigitte Vallée
  Lecture Notes in Computer Science 1284, 1997, pp. 486-499
• Reconstructing the topology of a CAD model - A discrete approach
  Karsten Weihe, Thomas Willhalm
  Lecture Notes in Computer Science 1284, 1997, pp. 500-513