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

• Optimal resilient sorting and searching in the presence of memory faults
  Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano
  Lecture Notes in Computer Science 4051, 2006, pp. 286-298
• Reliable and efficient computational geometry via controlled perturbation
  Kurt Mehlhorn, Ralf Osbild, Michael Sagraloff
  Lecture Notes in Computer Science 4051, 2006, pp. 299-310
• Tight bounds for selfish and greedy load balancing
  Ioannis Caragiannis, Michele Flammini, Christos Kaklamanis, Panagiotis Kanellopoulos, Luca Moscardelli
  Lecture Notes in Computer Science 4051, 2006, pp. 311-322
• Lower bounds of static Lovász-Schrijver calculus proofs for Tseitin tautologies
  Arist Kojevnikov, Dmitry Itsykson
  Lecture Notes in Computer Science 4051, 2006, pp. 323-334
• Extracting Kolmogorov complexity with applications to dimension zero-one laws
  Lance Fortnow, John M. Hitchcock, A. Pavan, N.V. Vinodchandran, Fengming Wang
  Lecture Notes in Computer Science 4051, 2006, pp. 335-345
• The connectivity of Boolean satisfiability: Computational and structural dichotomies
  Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou
  Lecture Notes in Computer Science 4051, 2006, pp. 346-357
• Suffix trays and suffix trists: Structures for faster text indexing
  Richard Cole, Tsvi Kopelowitz, Moshe Lewenstein
  Lecture Notes in Computer Science 4051, 2006, pp. 358-369
• Optimal lower bounds for rank and select indexes
  Alexander Golynski
  Lecture Notes in Computer Science 4051, 2006, pp. 370-381
• Dynamic interpolation search revisited
  Alexis Kaporis, Christos Makris, Spyros Sioutas, Athanasios Tsakalidis, Kostas Tsichlas, Christos Zaroliagis
  Lecture Notes in Computer Science 4051, 2006, pp. 382-394
• Dynamic matrix rank
  Gudmund Skovbjerg Frandsen, Peter Frands Frandsen
  Lecture Notes in Computer Science 4051, 2006, pp. 395-406
• Nearly optimal visibility representations of plane graphs
  Xin He, Huaming Zhang
  Lecture Notes in Computer Science 4051, 2006, pp. 407-418
• Planar crossing numbers of genus g graphs
  Hristo Djidjev, Imrich Vrt'o
  Lecture Notes in Computer Science 4051, 2006, pp. 419-430
• How to trim an MST: A 2-approximation algorithm for minimum cost tree cover
  Toshihiro Fujito
  Lecture Notes in Computer Science 4051, 2006, pp. 431-442
• Tight approximation algorithm for connectivity augmentation problems
  Guy Kortsarz, Zeev Nutov
  Lecture Notes in Computer Science 4051, 2006, pp. 443-452
• On the bipartite unique perfect matching problem
  Thanh Minh Hoang, Meena Mahajan, Thomas Thierauf
  Lecture Notes in Computer Science 4051, 2006, pp. 453-464
• Comparing reductions to NP-complete sets
  John M. Hitchcock, A. Pavan
  Lecture Notes in Computer Science 4051, 2006, pp. 465-476
• Design is as easy as optimization
  Deeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vazirani
  Lecture Notes in Computer Science 4051, 2006, pp. 477-488
• On the complexity of 2D discrete fixed point problem
  Xi Chen, Xiaotie Deng
  Lecture Notes in Computer Science 4051, 2006, pp. 489-500
• Routing (un-) splittable flow in games with player-specific linear latency functions
  Martin Gairing, Burkhard Monien, Karsten Tiemann
  Lecture Notes in Computer Science 4051, 2006, pp. 501-512
• The game world is flat: The complexity of Nash equilibria in succinct games
  Constantinos Daskalakis, Alex Fabrikant, Christos H. Papadimitriou
  Lecture Notes in Computer Science 4051, 2006, pp. 513-524
• Network games with atomic players
  Roberto Cominetti, José R. Correa, Nicolás E. Stier-Moses
  Lecture Notes in Computer Science 4051, 2006, pp. 525-536
• Finite-state dimension and real arithmetic
  David Doty, Jack H. Lutz, Satyadev Nandakumar
  Lecture Notes in Computer Science 4051, 2006, pp. 537-547
• Exact algorithms for exact satisfiability and number of perfect matchings
  Andreas Björklund, Thore Husfeldt
  Lecture Notes in Computer Science 4051, 2006, pp. 548-559
• The myriad virtues of Wavelet Trees
  Paolo Ferragina, Raffaele Giancarlo, Giovanni Manzini
  Lecture Notes in Computer Science 4051, 2006, pp. 560-571
• Atomic congestion games among coalitions
  Dimitris Fotakis, Spyros Kontogiannis, Paul Spirakis
  Lecture Notes in Computer Science 4051, 2006, pp. 572-583