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

• Offset-polygon annulus placement problems
  Gill Barequet, Amy J. Briggs, Matthew T. Dickerson, Michael T. Goodrich
  Lecture Notes in Computer Science 1272, 1997, pp. 378-391
• Trans-dichotomous algorithms without multiplication - Some upper and lower bounds
  Andrej Brodnik, Peter Bro Miltersen, J. Ian Munro
  Lecture Notes in Computer Science 1272, 1997, pp. 426-439
• Planarity, revisited
  Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou
  Lecture Notes in Computer Science 1272, 1997, pp. 472-473
• Average-case complexity of shortest-paths problems in the vertex-potential model
  Colin Cooper, Alan Frieze, Kurt Mehlhorn, Volker Priebe
  Lecture Notes in Computer Science 1269, 1997, pp. 15-26
• Nearly linear time approximation schemes for Euclidean TSP and other geometric problems
  Sanjeev Arora
  Lecture Notes in Computer Science 1269, 1997, pp. 55-55
• Approximation on the Web: A compendium of NP optimization problems
  P. Crescenzi, V. Kann
  Lecture Notes in Computer Science 1269, 1997, pp. 111-118
• Weak and strong recognition by 2-way randomized automata
  Andris Ambainis, Rūsiņs̑ Freivalds, Marek Karpinski
  Lecture Notes in Computer Science 1269, 1997, pp. 175-185
• Episode matching
  Gautam Das, Rudolf Fleischer, Leszek Ga̧sieniec, Dimitris Gunopulos, Juha Kärkkäinen
  Lecture Notes in Computer Science 1264, 1997, pp. 12-27
• On the complexity of pattern matching for highly compressed two-dimensional texts
  Piotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, Wojciech Rytter
  Lecture Notes in Computer Science 1264, 1997, pp. 40-51
• Direct construction of compact directed acyclic word graphs
  Maxime Crochemore, Renaud Vérin
  Lecture Notes in Computer Science 1264, 1997, pp. 116-129
• Approximation algorithms for the fixed-topology phylogenetic number problem
  Mary Cryan, Leslie Ann Goldberg, Cynthia A. Phillips
  Lecture Notes in Computer Science 1264, 1997, pp. 130-149
• On incremental computation of transitive closure and greedy alignment
  Saïd Abdeddaïm
  Lecture Notes in Computer Science 1264, 1997, pp. 167-179
• Aligning coding DNA in the presence of frame-shift errors
  Lars Arvestad
  Lecture Notes in Computer Science 1264, 1997, pp. 180-190
• Trie-based data structures for sequence assembly
  Ting Chen, Steven S. Skiena
  Lecture Notes in Computer Science 1264, 1997, pp. 206-223
• Banishing bias from consensus sequences
  Amir Ben-Dor, Giuseppe Lancia, Jennifer Perone, R. Ravi
  Lecture Notes in Computer Science 1264, 1997, pp. 247-261
• Iterative versus simultaneous multiple sequence alignment
  Andreas Dress
  Lecture Notes in Computer Science 1264, 1997, pp. 275-275
• The Wadge-Wagner hierarchy of \omega-rational sets
  Olivier Carton, Dominique Perrin
  Lecture Notes in Computer Science 1256, 1997, pp. 17-35
• From chaotic iteration to constraint propagation
  Krzysztof R. Apt
  Lecture Notes in Computer Science 1256, 1997, pp. 36-55
• Enumerative sequences of leaves in rational trees
  Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin
  Lecture Notes in Computer Science 1256, 1997, pp. 76-86
• A completion algorithm for codes with bounded synchronization delay
  Véronique Bruyère
  Lecture Notes in Computer Science 1256, 1997, pp. 87-97
• Finite loops recognize exactly the regular open languages
  Martin Beaudry, François Lemieux, Denis Thérien
  Lecture Notes in Computer Science 1256, 1997, pp. 110-120
• Some bounds on the computational power of piecewise constant derivative systems
  Olivier Bournez
  Lecture Notes in Computer Science 1256, 1997, pp. 143-153
• Worst-case hardness suffices for derandomization: A new method for hardness-randomness trade-offs
  Alexander E. Andreev, Andrea E.F. Clementi, José D.P. Rolim
  Lecture Notes in Computer Science 1256, 1997, pp. 177-187
• Results on resource-bounded measure
  Harry Buhrman, Stephen Fenner, Lance Fortnow
  Lecture Notes in Computer Science 1256, 1997, pp. 188-194
• Randomization and nondeterminism are comparable for oredered read-once branching programs
  Farid Ablayev
  Lecture Notes in Computer Science 1256, 1997, pp. 195-202