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

Suche: Series=LNCS AND Volume=1136

• Negative cycle detection algorithms
  Boris V. Cherkassky, Andrew V. Goldberg
  Lecture Notes in Computer Science 1136, 1996, pp. 349-363
• A new regular grammar pattern matching algorithm
  Bruce W. Watson
  Lecture Notes in Computer Science 1136, 1996, pp. 364-377
• Lempel-Ziv index for q-grams
  Juha Kärkkäinen, Erkki Sutinen
  Lecture Notes in Computer Science 1136, 1996, pp. 378-391
• Computing upper and lower bounds on textile nesting problems
  Ralf Heckmann, Thomas Lengauer
  Lecture Notes in Computer Science 1136, 1996, pp. 392-405
• On-line and off-line algorithms for vector covering
  Noga Alon, János Csirik, Sergey V. Sevastianov, Arjen P.A. Vestjens, Gerhard J. Woeginger
  Lecture Notes in Computer Science 1136, 1996, pp. 406-418
• Competitive analysis of randomized paging algorithms
  Dimitris Achlioptas, Marek Chrobak, John Noga
  Lecture Notes in Computer Science 1136, 1996, pp. 419-430
• On-line competitive algorithms for call admission in optical networks
  Baruch Awerbuch, Yossi Azar, Amos Fiat, Stefano Leonardi, Adi Rosén
  Lecture Notes in Computer Science 1136, 1996, pp. 431-444
• Race-condition detection in parallel computation with semaphores
  Philip N. Klein, Hsueh-I. Lu, Robert H.B. Netzer
  Lecture Notes in Computer Science 1136, 1996, pp. 445-459
• Efficient wavelength routing on directed fiber trees
  Christos Kaklamanis, Pino Persiano
  Lecture Notes in Computer Science 1136, 1996, pp. 460-470
• A lower bound for nearly minimal adaptive and hot potato algorithms
  Ishai Ben-Aroya, Donald D. Chinn, Assaf Schuster
  Lecture Notes in Computer Science 1136, 1996, pp. 471-485
• The structure of circular decomposable metrics
  George Christopher, Martin Farach, Michael A. Trick
  Lecture Notes in Computer Science 1136, 1996, pp. 486-500
• Faster algorithms for subgraph isomorphism of \kappa-connected partial \kappa-trees
  Anders Dessmark, Andrzej Lingas, Andrzej Proskurowski
  Lecture Notes in Computer Science 1136, 1996, pp. 501-513
• Planar spanners and approximate shortest path queries among obstacles in the plane
  Srinivasa Arikati, Danny Z. Chen, L. Paul Chew, Gautiam Das, Michiel Smid, Christos D. Zaroliagis
  Lecture Notes in Computer Science 1136, 1996, pp. 514-528
• A new approach to optimal planning of robot motion on a tree with obstacles
  Vincenao Auletta, Domenico Parente, Pino Persiano
  Lecture Notes in Computer Science 1136, 1996, pp. 529-545
• Generalized streets revisited
  Alejandro López-Ortiz, Sven Schuierer
  Lecture Notes in Computer Science 1136, 1996, pp. 546-558
• Computational aspects of organization theory
  Christos Papadimitriou
  Lecture Notes in Computer Science 1136, 1996, pp. 559-564