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

• Approximation schemes for metric clustering problems
  Claire Kenyon
  Lecture Notes in Computer Science 2996, 2004, pp. 1-3
• Positional determinacy of infinite games
  Erich Grädel
  Lecture Notes in Computer Science 2996, 2004, pp. 4-18
• Individual communication complexity
  Harry Buhrman, Hartmut Klauck, Nikolai Vereshchagin, Paul Vitányi
  Lecture Notes in Computer Science 2996, 2004, pp. 19-30
• The complexity of satisfiability problems over finite lattices
  Bernhard Schwarz
  Lecture Notes in Computer Science 2996, 2004, pp. 31-43
• Constant width planar computation characterizes ACC^0
  Kristoffer Arnsfelt Hansen
  Lecture Notes in Computer Science 2996, 2004, pp. 44-55
• A simple and fast approach for solving problems on planar graphs
  Fedor V. Fomin, Dimtirios M. Thilikos
  Lecture Notes in Computer Science 2996, 2004, pp. 56-67
• Sum-Multicoloring on paths
  Annamária Kovács
  Lecture Notes in Computer Science 2996, 2004, pp. 68-80
• Matching algorithms are fast in sparse random graphs
  Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki
  Lecture Notes in Computer Science 2996, 2004, pp. 81-92
• Algebraic results on quantum automata
  Andris Ambainis, Martin Beaudry, Marats Golovkins, Arnolds Ķikusts, Mark Mercer, Denis Thérien
  Lecture Notes in Computer Science 2996, 2004, pp. 93-104
• Quantum identification of Boolean oracles
  Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Hiroyuki Masuda, Raymond H. Putra, Shigeru Yamashita
  Lecture Notes in Computer Science 2996, 2004, pp. 105-116
• Local limit distributions in pattern statistics: Beyond the Markovian models
  Alberto Bertoni, Christian Choffrut, Massimiliano Goldwurm, Violetta Lonati
  Lecture Notes in Computer Science 2996, 2004, pp. 117-128
• A discontinuity in pattern inference
  Daniel Reidenbach
  Lecture Notes in Computer Science 2996, 2004, pp. 129-140
• Algorithms for SAT based on search in Hamming balls
  Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert
  Lecture Notes in Computer Science 2996, 2004, pp. 141-151
• Identifying efficiently solvable cases of Max CSP
  David Cohen, Martin Cooper, Peter Jeavons, Andrei Krokhin
  Lecture Notes in Computer Science 2996, 2004, pp. 152-163
• The complexity of Boolean constraint isomorphism
  Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer
  Lecture Notes in Computer Science 2996, 2004, pp. 164-175
• On minimizing the total weighted tardiness on a single machine
  Stavros G. Kolliopoulos, George Steiner
  Lecture Notes in Computer Science 2996, 2004, pp. 176-186
• Online competitive algorithms for maximizing weighted throughput of unit jobs
  Yair Bartal, Francis Y.L. Chin, Marek Chrobak, Stanley P.Y. Fung, Wojciech Jawor, Ron Lavi, Jiȓí Sgall, Tomás̑ Tichý
  Lecture Notes in Computer Science 2996, 2004, pp. 187-198
• Optimal and online preemptive scheduling on uniformly related machines
  Tomás̑ Ebenlendr, Jiȓí Sgall
  Lecture Notes in Computer Science 2996, 2004, pp. 199-210
• Parallel prefetching and caching is hard
  Christoph Ambühl, Birgitta Weber
  Lecture Notes in Computer Science 2996, 2004, pp. 211-221
• Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem
  Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna Paluch
  Lecture Notes in Computer Science 2996, 2004, pp. 222-233
• Approximation algorithms for minimizing average distortion
  Kedar Dhamdhere, Anupam Gupta, R. Ravi
  Lecture Notes in Computer Science 2996, 2004, pp. 234-245
• Digraphs exploration with little memory
  Pierre Fraigniaud, David Ilcinkas
  Lecture Notes in Computer Science 2996, 2004, pp. 246-257
• Approximate path coloring with applications to wavelength assignment in WDM optical networks
  Ioannis Caragiannis, Christos Kaklamanis
  Lecture Notes in Computer Science 2996, 2004, pp. 258-269
• An algorithmic view on OVSF code assignment
  Thomas Erlebach, Riko Jacob, Matús̑ Mihal̑ák, Marc Nunkesser, Gábor Szabó, Peter Widmayer
  Lecture Notes in Computer Science 2996, 2004, pp. 270-281
• The syntactic graph of a sofic shift
  Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin
  Lecture Notes in Computer Science 2996, 2004, pp. 282-293