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

• Sharing one secret vs. sharing many secrets: Tight bounds for the max improvement ratio
  Giovanni Di Crescenzo
  Lecture Notes in Computer Science 2136, 2001, pp. 292-303
• (H,C,K)-coloring: Fast, easy, and hard cases
  Josep Díaz, Maria Serna, Dimitrios M. Thilikos
  Lecture Notes in Computer Science 2136, 2001, pp. 304-315
• Randomness and reducibility
  Rod G. Downey, Denis R. Hirschfeldt, Geoff LaForte
  Lecture Notes in Computer Science 2136, 2001, pp. 316-327
• On the computational complexity of infinite words
  Pavol D̑uris, Ján Man̑uch
  Lecture Notes in Computer Science 2136, 2001, pp. 328-337
• Lower bounds for on-line single-machine scheduling
  Leah Epstein, Rob van Stee
  Lecture Notes in Computer Science 2136, 2001, pp. 338-350
• Approximation algorithms and complexity results for path problems in trees of rings
  Thomas Erlebach
  Lecture Notes in Computer Science 2136, 2001, pp. 351-362
• A 3-approximation algorithm for movement minimization in conveyor flow shop processing
  Wolfgang Espelage, Egon Wanke
  Lecture Notes in Computer Science 2136, 2001, pp. 363-374
• Quantifier rank for parity of embedded finite models
  Hervé Fournier
  Lecture Notes in Computer Science 2136, 2001, pp. 375-386
• Space hierarchy theorem revised
  Viliam Geffert
  Lecture Notes in Computer Science 2136, 2001, pp. 387-397
• Converting two-way nondeterministic unary automata into simpler automata
  Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini
  Lecture Notes in Computer Science 2136, 2001, pp. 398-407
• The complexity of the minimal polynomial
  Thanh Minh Hoang, Thomas Thierauf
  Lecture Notes in Computer Science 2136, 2001, pp. 408-420
• Note on minimal finite automata
  Galina Jirásková
  Lecture Notes in Computer Science 2136, 2001, pp. 421-431
• Synchronizing finite automata on Eulerian digraphs
  Jarkko Kari
  Lecture Notes in Computer Science 2136, 2001, pp. 432-438
• A time hierarchy for bounded one-way cellular automata
  Andreas Klein, Martin Kutrib
  Lecture Notes in Computer Science 2136, 2001, pp. 439-450
• Checking amalgamability conditions for CASL architectural specifications
  Bartek Klin, Piotr Hoffman, Andrzej Tarlecki, Lutz Schröder, Till Mossakowski
  Lecture Notes in Computer Science 2136, 2001, pp. 451-463
• On-line scheduling with tight deadlines
  Chiu-Yuen Koo, Tak-Wah Lam, Tsuen-Wan Ngan, Kar-Keung To
  Lecture Notes in Computer Science 2136, 2001, pp. 464-473
• Complexity note on mixed hypergraphs
  Daniel Král', Jan Kratochvíl, Heinz-Jürgen Voss
  Lecture Notes in Computer Science 2136, 2001, pp. 474-485
• News from the online traveling repairman
  Sven O. Krumke, Willem E. de Paepe, Diana Poensgen, Leen Stougie
  Lecture Notes in Computer Science 2136, 2001, pp. 487-499
• Word problems for 2-homogeneous monoids and symmetric logspace
  Markus Lohrey
  Lecture Notes in Computer Science 2136, 2001, pp. 500-511
• Variations on a theorem of Fine & Wilf
  Filippo Mignosi, Jeffrey Shallit, Ming-wei Wang
  Lecture Notes in Computer Science 2136, 2001, pp. 512-523
• Upper bounds on the bisection width of 3- and 4-regular graphs
  Burkhard Monien, Robert Preis
  Lecture Notes in Computer Science 2136, 2001, pp. 524-536
• Satisfiability of systems of equations over finite monoids
  Cristopher Moore, Pascal Tesson, Denis Thérien
  Lecture Notes in Computer Science 2136, 2001, pp. 537-547
• Rational graphs trace context-sensitive languages
  Christophe Morvan, Colin Stirling
  Lecture Notes in Computer Science 2136, 2001, pp. 548-559
• Towards regular languages over infinite alphabets
  Frank Neven, Thomas Schwentick, Victor Vianu
  Lecture Notes in Computer Science 2136, 2001, pp. 560-572
• Partial information and special case algorithms
  Arfst Nickelsen
  Lecture Notes in Computer Science 2136, 2001, pp. 573-584