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 YEAR=1990

• How to update a balanced binary tree with a constant number of rotations
  Thomas Ottmann, Derick Wood
  Lecture Notes in Computer Science 447, 1990, pp. 122-131
• Ranking trees generated by rotations
  W. Samuel Bent
  Lecture Notes in Computer Science 447, 1990, pp. 132-142
• Expected behaviour analysis of AVL trees
  Ricardo Baeza-Yates, Gaston H. Gonnet, Nivio Ziviani
  Lecture Notes in Computer Science 447, 1990, pp. 143-159
• Analysis of the expected search cost in skip lists
  Thomas Papadakis, J. Ian Munro, Patricio V. Poblete
  Lecture Notes in Computer Science 447, 1990, pp. 160-172
• Lower bounds for monotonic list labeling
  Paul F. Dietz, Ju Zhang
  Lecture Notes in Computer Science 447, 1990, pp. 173-180
• Sorting shuffled monotone sequences
  Christos Levcopoulos, Ola Petersson
  Lecture Notes in Computer Science 447, 1990, pp. 181-191
• A faster parallel algorithm for a matrix searching problem
  Mikhail J. Atallah
  Lecture Notes in Computer Science 447, 1990, pp. 192-200
• A rectilinear Steiner minimal tree algorithm for convex point sets
  Dana S. Richards, Jeffrey S. Salowe
  Lecture Notes in Computer Science 447, 1990, pp. 201-212
• Finding shortest paths in the presence of orthogonal obstacles using a combined L_1 and link metric
  Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson, Mark H. Overmars
  Lecture Notes in Computer Science 447, 1990, pp. 213-224
• Input-sensitive compliant motion in the plane
  Joseph Friedman, John Hershberger, Jack Snoeyink
  Lecture Notes in Computer Science 447, 1990, pp. 225-237
• Fast algorithms for greedy triangulation
  Christos Levcopoulos, Andrzej Lingas
  Lecture Notes in Computer Science 447, 1990, pp. 238-250
• Star unfolding of a polytope with applications
  Pankaj K. Agarwal, Boris Aronov, Joseph O'Rourke, Catherine A. Schevon
  Lecture Notes in Computer Science 447, 1990, pp. 251-263
• Space-sweep algorithms for parametric optimization
  David Fernández-Baca
  Lecture Notes in Computer Science 447, 1990, pp. 264-275
• Approximating finite weighted point sets by hyperplanes
  N.M. Korneenko, H. Martini
  Lecture Notes in Computer Science 447, 1990, pp. 276-286
• Data structures for Traveling Salesmen
  David S. Johnson
  Lecture Notes in Computer Science 447, 1990, pp. 287-287
• Efficient parallel algorithms for shortest paths in planar graphs
  Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis
  Lecture Notes in Computer Science 447, 1990, pp. 288-300
• The pathwidth and treewidth of cographs
  Hans L. Bodlaender, Rolf H. Möhring
  Lecture Notes in Computer Science 447, 1990, pp. 301-309
• Canonical representations of partial 2- and 3-trees
  Stefan Arnborg, Andrzej Proskurowski
  Lecture Notes in Computer Science 447, 1990, pp. 310-319
• On matroids and hierarchical graphs
  David Fernández-Baca, Mark A. Williams
  Lecture Notes in Computer Science 447, 1990, pp. 320-331
• Fast algorithms for two dimensional and multiple pattern matching
  Ricardo Baeza-Yates, Mireille Régnier
  Lecture Notes in Computer Science 447, 1990, pp. 332-347
• Boyer-Moore approach to approximate string matching
  Jorma Tarhio, Esko Ukkonen
  Lecture Notes in Computer Science 447, 1990, pp. 348-359
• Complete problems with L-samplable distributions
  Per Grape
  Lecture Notes in Computer Science 447, 1990, pp. 360-367
• Upper envelope onion peeling
  John Hershberger
  Lecture Notes in Computer Science 447, 1990, pp. 368-379
• Applications of a semi-dynamic convex hull algorithm
  John Hershberger, Subhash Suri
  Lecture Notes in Computer Science 447, 1990, pp. 380-392
• Intersection queries in sets of disks
  Marc van Kreveld, Mark Overmars, Pankaj K. Agarwal
  Lecture Notes in Computer Science 447, 1990, pp. 393-403