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 Volume=5125

• Graph structure and monadic second-order logic: Language theoretical aspects
  Bruno Courcelle
  Lecture Notes in Computer Science 5125, 2008, pp. 1-13
• Internet ad auctions: Insights and directions
  S. Muthukrishnan
  Lecture Notes in Computer Science 5125, 2008, pp. 14-23
• The complexity of Boolean formula minimization
  David Buchfuhrer, Christopher Umans
  Lecture Notes in Computer Science 5125, 2008, pp. 24-35
• Optimal cryptographic hardness of learning monotone functions
  Dana Dachman-Soled, Homin K. Lee, Tal Malkin, Rocco A. Servedio, Andrew Wan, Hoeteck Wee
  Lecture Notes in Computer Science 5125, 2008, pp. 36-47
• On Berge multiplication for monotone Boolean dualization
  Endre Boros, Khaled Elbassioni, Kazuhisa Makino
  Lecture Notes in Computer Science 5125, 2008, pp. 48-59
• Diagonal circuit identity testing and lower bounds
  Nitin Saxena
  Lecture Notes in Computer Science 5125, 2008, pp. 60-71
• Cell-probe proofs and nondeterministic cell-probe complexity
  Yitong Yin
  Lecture Notes in Computer Science 5125, 2008, pp. 72-83
• Constructing efficient dictionaries in close to sorting time
  Milan Ruz̑ić
  Lecture Notes in Computer Science 5125, 2008, pp. 84-95
• On list update with locality of reference
  Susanne Albers, Sonja Lauer
  Lecture Notes in Computer Science 5125, 2008, pp. 96-107
• A new combinatorial approach for sparse graph problems
  Guy E. Blelloch, Virginia Vassilevska, Ryan Williams
  Lecture Notes in Computer Science 5125, 2008, pp. 108-120
• How to explore a fast-changing world (cover time of a simple random walk on evolving graphs)
  Chen Avin, Michal Koucký, Zvi Lotker
  Lecture Notes in Computer Science 5125, 2008, pp. 121-132
• Networks become navigable as nodes move and forget
  Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle Lebhar
  Lecture Notes in Computer Science 5125, 2008, pp. 133-144
• Fast distributed computation of cuts via random circulations
  David Pritchard
  Lecture Notes in Computer Science 5125, 2008, pp. 145-160
• Finding a maximum matching in a sparse random graph in O(n) expected time
  Prasad Chebolu, Alan Frieze, Páll Melsted
  Lecture Notes in Computer Science 5125, 2008, pp. 161-172
• Function evaluation via linear programming in the priced information model
  Ferdinando Cicalese, Eduardo Sany Laber
  Lecture Notes in Computer Science 5125, 2008, pp. 173-185
• Improved approximation algorithms for budgeted allocations
  Yossi Azar, Benjamin Birnbaum, Anna R. Karlin, Claire Mathieu, C. Thach Nguyen
  Lecture Notes in Computer Science 5125, 2008, pp. 186-197
• The Travelling Salesman Problem in bounded degree graphs
  Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
  Lecture Notes in Computer Science 5125, 2008, pp. 198-209
• Treewidth computation and extremal combinatorics
  Fedor V. Fomin, Yngve Villanger
  Lecture Notes in Computer Science 5125, 2008, pp. 210-221
• Fast scheduling of weighted unit jobs with release times and deadlines
  C. Greg Plaxton
  Lecture Notes in Computer Science 5125, 2008, pp. 222-233
• Approximation algorithms for scheduling parallel jobs: Breaking the approximation ratio of 2
  Klaus Jansen, Ralf Thöle
  Lecture Notes in Computer Science 5125, 2008, pp. 234-245
• A PTAS for static priority real-time scheduling with resource augmentation
  Friedrich Eisenbrand, Thomas Rothvoß
  Lecture Notes in Computer Science 5125, 2008, pp. 246-257
• Optimal monotone encodings
  Noga Alon, Rani Hod
  Lecture Notes in Computer Science 5125, 2008, pp. 258-270
• Polynomial-time construction of linear network coding
  Kazuo Iwama, Harumichi Nishimura, Mike Paterson, Rudy Raymond, Shigeru Yamashita
  Lecture Notes in Computer Science 5125, 2008, pp. 271-282
• Complexity of decoding positive-rate Reed-Solomon codes
  Qi Cheng, Daqing Wan
  Lecture Notes in Computer Science 5125, 2008, pp. 283-293
• Computational complexity of the distance constrained labeling problem for trees
  Jiȓí Fiala, Petr A. Golovach, Jan Kratochvíl
  Lecture Notes in Computer Science 5125, 2008, pp. 294-305