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

• Sequence comparison and statistical significance in molecular biology
  Michael S. Waterman
  Lecture Notes in Computer Science 726, 1993, pp. 396
• The influence of lookahead in competitive paging algorithms (extended abstract)
  Susanne Albers
  Lecture Notes in Computer Science 726, 1993, pp. 1-12
• An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications
  Mikhail J. Atallah, Danny Z. Chen, D.T. Lee
  Lecture Notes in Computer Science 726, 1993, pp. 13-24
• Efficient self simulation algorithms for reconfigurable arrays
  Yosi Ben-Asher, Dan Gordon, Assaf Schuster
  Lecture Notes in Computer Science 726, 1993, pp. 25-36
• Optimal upward planarity testing of single-source digraphs (extended abstract)
  Paola Bertolazzi, Giuseppe Di Battista, Carlo Mannino
  Lecture Notes in Computer Science 726, 1993, pp. 37-48
• On bufferless routing of variable-length messages in leveled networks
  S.N. Bhatt, G. Bilardi, G. Pucci, A. Ranade, A.L. Rosenberg, E.J. Schwabe
  Lecture Notes in Computer Science 726, 1993, pp. 49-60
• Saving comparisons in the Crochemore-Perrin string matching algorithm
  Dany Breslauer
  Lecture Notes in Computer Science 726, 1993, pp. 61-72
• Unambiguity of extended regular expressions in SGML document grammars
  Anne Brüggemann-Klein
  Lecture Notes in Computer Science 726, 1993, pp. 73-84
• On the direct sum conjecture in the straight line model
  Nader H. Bshouty
  Lecture Notes in Computer Science 726, 1993, pp. 85-96
• Combine and conquer: a general technique for dynamic algorithms (extended abstract)
  Robert F. Cohen, Roberto Tamassia
  Lecture Notes in Computer Science 726, 1993, pp. 97-108
• Optimal CREW-PRAM Algorithms for direct dominance problems
  Amitava Datta, Anil Maheshwari, Jörg-Rüdiger Sack
  Lecture Notes in Computer Science 726, 1993, pp. 109-120
• Trekking in the Alps without freezing or getting tired
  Mark de Berg, Marc van Kreveld
  Lecture Notes in Computer Science 726, 1993, pp. 121-132
• Dog bites postman: Point location in the moving Voronoi diagram and related problems
  Olivier Devillers, Mordecai Golin
  Lecture Notes in Computer Science 726, 1993, pp. 133-144
• Parallel approximation schemes for problems on planar graphs (extended abstract)
  J. Díaz, M.J. Serna, J. Torán
  Lecture Notes in Computer Science 726, 1993, pp. 145-156
• DNA physical mapping: Three ways difficult
  Michael R. Fellows, Michael T. Hallett, H. Todd Wareham
  Lecture Notes in Computer Science 726, 1993, pp. 157-168
• A calculus of random generation
  Philippe Flajolet, Paul Zimmermann, Bernard van Cutsem
  Lecture Notes in Computer Science 726, 1993, pp. 169-180
• The bit complexity of distributed sorting (extended abstract)
  O. Gerstel, S. Zaks
  Lecture Notes in Computer Science 726, 1993, pp. 181-191
• Three-clustering of points in the plane
  Johann Hagauer, Günter Rote
  Lecture Notes in Computer Science 726, 1993, pp. 192-199
• Gossiping in vertex-disjoint paths mode in d-dimensional grids and planar graphs (extended abstract)
  Juraj Hromkovic̑, Ralf Klasing, Elena A. Stöhr, Hubert Wagener
  Lecture Notes in Computer Science 726, 1993, pp. 200-211
• Fully dynamic planarity testing in planar embedded graphs (extended abstract)
  Giuseppe F. Italiano, Johannes A. La Poutré, Monika H. Rauch
  Lecture Notes in Computer Science 726, 1993, pp. 212-223
• Fully dynamic algorithms for bin packing: Being (mostly) myopic helps
  Zoran Ivković, Errol L. Lloyd
  Lecture Notes in Computer Science 726, 1993, pp. 224-235
• Increasing the vertex-connectivity in directed graphs
  Tibor Jordán
  Lecture Notes in Computer Science 726, 1993, pp. 236-247
• On the recognition of permuted bottleneck Monge matrices
  Bettina Klinz, Rüdiger Rudolf, Gerhard J. Woeginger
  Lecture Notes in Computer Science 726, 1993, pp. 248-259
• Computing treewidth and minimum fill-in: All you need are the minimal separators
  T. Kloks, H. Bodlaender, H. Müller, D. Kratsch
  Lecture Notes in Computer Science 726, 1993, pp. 260-271
• Block gossiping on grids and tori: Deterministic sorting and routing match the bisection bound
  Manfred Kunde
  Lecture Notes in Computer Science 726, 1993, pp. 272-283