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 YEAR=2003

• On shortest-path all-optical networks without wavelength conversion requirements
  Thomas Erlebach, Stamatis Stefanakos
  Lecture Notes in Computer Science 2607, 2003, pp. 133-144
• On the ultimate complexity of factorials
  Qi Cheng
  Lecture Notes in Computer Science 2607, 2003, pp. 157-166
• Some results on derandomization
  Harry Buhrman, Lance Fortnow, A. Pavan
  Lecture Notes in Computer Science 2607, 2003, pp. 212-222
• Analysis of the harmonic algorithm for three servers
  Marek Chrobak, Sgall Jȓí
  Lecture Notes in Computer Science 2607, 2003, pp. 247-259
• Non-clairvoyant scheduling for minimizing mean slowdown
  N. Bansal, K. Dhamdhere, J. Könemann, A. Sinha
  Lecture Notes in Computer Science 2607, 2003, pp. 260-270
• Space efficient hash tables with worst case constant access time
  Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul Spirakis
  Lecture Notes in Computer Science 2607, 2003, pp. 271-282
• Randomized jumplists: A jump-and-walk dictionary data structure
  Hervé Brönnimann, Frédéric Cacals, Marianne Durand
  Lecture Notes in Computer Science 2607, 2003, pp. 283-294
• Complexity theoretical results on nondeterministic graph-driven read-once branching programs
  Beate Bollig
  Lecture Notes in Computer Science 2607, 2003, pp. 295-306
• Representing graph metrics with fewest edges
  Tomas Feder, Adam Meyerson, Rajeev Motwani, Loc O'Callaghan, Rinap Panigrahy
  Lecture Notes in Computer Science 2607, 2003, pp. 355-366
• Computing shortest paths with uncertainty
  T. Feder, R. Motwani, L. O'Callaghan, C. Olston, R. Panigrahy
  Lecture Notes in Computer Science 2607, 2003, pp. 367-378
• The inversion problem for computable linear operators
  Vasco Brattka
  Lecture Notes in Computer Science 2607, 2003, pp. 391-402
• Algebras of minimal rank over arbitrary fields
  Markus Bläser
  Lecture Notes in Computer Science 2607, 2003, pp. 403-414
• The inference problem for propositional circumscription of affine formulas is coNP-complete
  Arnaud Durand, Miki Hermann
  Lecture Notes in Computer Science 2607, 2003, pp. 451-462
• Colouring random graphs in expected polynomial time
  Amin Coja-Oghlan, Anusch Taraz
  Lecture Notes in Computer Science 2607, 2003, pp. 487-498
• An information-theoretic upper bound of planar graphs using triangulation
  Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse
  Lecture Notes in Computer Science 2607, 2003, pp. 499-510
• Finding large independent sets in polynomial expected time
  Amin Coja-Oghlan
  Lecture Notes in Computer Science 2607, 2003, pp. 511-522
• Distributed soft path coloring
  Peter Damaschke
  Lecture Notes in Computer Science 2607, 2003, pp. 523-534
• Competing provers yield improved Karp-Lipton collapse results
  Jin-Yi Cai, Venkatesan T. Chakaravarthy, Lane A. Hemaspaandra, Mitsunori Ogihara
  Lecture Notes in Computer Science 2607, 2003, pp. 535-546
• One bit of advice
  Harry Buhrman, Richard Chang, Lance Fortnow
  Lecture Notes in Computer Science 2607, 2003, pp. 547-558
• Untameable timed automata!
  Patricia Bouyer
  Lecture Notes in Computer Science 2607, 2003, pp. 620-631
• On sand automata
  Julien Cervelle, Enrico Formenti
  Lecture Notes in Computer Science 2607, 2003, pp. 642-653
• Adaptive sorting and the information theoretic lower bound
  Amr Elmasry, Michael L. Fredman
  Lecture Notes in Computer Science 2607, 2003, pp. 654-662
• A discrete subexponential algorithm for parity games
  Henrik Björklund, Sven Sandberg, Sergei Vorobyov
  Lecture Notes in Computer Science 2607, 2003, pp. 663-674
• Cryptographically sound and machine-assisted verification of security protocols
  Michael Backes, Christian Jacobi
  Lecture Notes in Computer Science 2607, 2003, pp. 675-686
• Durations, parametric model-checking in timed automata with Presburger arithmetic
  Véronique Bruère, Emmanuel Dall'Olio, Jean-François Raskin
  Lecture Notes in Computer Science 2607, 2003, pp. 687-698