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

• A direct sum theorem in communication complexity via message compression
  Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
  Lecture Notes in Computer Science 2719, 2003, pp. 300-315
• Optimal cache-oblivious implicit dictionaries
  Gianni Franceschini, Roberto Grossi
  Lecture Notes in Computer Science 2719, 2003, pp. 316-331
• The cell probe complexity of succinct data structures
  Anna Gál, Peter Bro Miltersen
  Lecture Notes in Computer Science 2719, 2003, pp. 332-344
• Succinct representations of permutations
  J. Ian Munro, Rajeev Raman, Venkatesh Raman, Satti Srinivasa Rao
  Lecture Notes in Computer Science 2719, 2003, pp. 345-356
• Succinct dynamic dictionaries and trees
  Rajeev Raman, Satti Srinivasa Rao
  Lecture Notes in Computer Science 2719, 2003, pp. 357-368
• Labeling schemes for weighted dynamic trees
  Amos Korman, David Peleg
  Lecture Notes in Computer Science 2719, 2003, pp. 369-383
• A simple linear time algorithm for computing a (2k-1)-spanner of O(n^{1+1/k}) size in weighted graphs
  Surender Baswana, Sandeep Sen
  Lecture Notes in Computer Science 2719, 2003, pp. 384-396
• Multicommodity flows over time: Efficient algorithms and complexity
  Alex Hall, Steffen Hippler, Martin Skutella
  Lecture Notes in Computer Science 2719, 2003, pp. 397-409
• Multicommodity demand flow in a tree
  Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepherd
  Lecture Notes in Computer Science 2719, 2003, pp. 410-425
• Skew and infinitary formal power series
  Manfred Droste, Dietrich Kuske
  Lecture Notes in Computer Science 2719, 2003, pp. 426-438
• Nondeterminism versus determinism for two-way finite automata: Generalizations of Sipser's separation
  Juraj Hromkovic̑, Georg Schnitger
  Lecture Notes in Computer Science 2719, 2003, pp. 439-451
• Residual languages and probabilistic automata
  François Denis, Yann Esposito
  Lecture Notes in Computer Science 2719, 2003, pp. 452-463
• A testing scenario for probabilistic automata
  Mariëlle Stoelinga, Frits Vaandrager
  Lecture Notes in Computer Science 2719, 2003, pp. 464-477
• The equivalence problem for t-turn DPDA is co-NP
  Géraud Sénizergues
  Lecture Notes in Computer Science 2719, 2003, pp. 478-489
• Flip-pushdown automata: k+1 pushdown reversals are better than k
  Markus Holzer, Martin Kutrib
  Lecture Notes in Computer Science 2719, 2003, pp. 490-501
• Convergence time to Nash equilibria
  Eyal Even-Dar, Alex Kesselman, Yishay Mansour
  Lecture Notes in Computer Science 2719, 2003, pp. 502-513
• Nashification and the coordination ratio for a selfish routing game
  Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode
  Lecture Notes in Computer Science 2719, 2003, pp. 514-526
• Stable marriages with multiple partners: Efficient search for an optimal solution
  Vipul Bansal, Aseem Agrawal, Varun S. Malhotra
  Lecture Notes in Computer Science 2719, 2003, pp. 527-542
• An intersection inequality for discrete distributions and related generation problems
  Endre Boros, Khaled Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
  Lecture Notes in Computer Science 2719, 2003, pp. 543-555
• Higher order pushdown automata, the Caucal hierarchy of graphs and parity games
  Thierry Cachat
  Lecture Notes in Computer Science 2719, 2003, pp. 556-569
• Undecidability of weak bisimulation equivalence for 1-counter processes
  Richard Mayr
  Lecture Notes in Computer Science 2719, 2003, pp. 570-583
• Bisimulation proof methods for mobile ambients
  Massimo Merro, Francesco Zappa Nardelli
  Lecture Notes in Computer Science 2719, 2003, pp. 584-598
• On equivalent representations of infinite structures
  Arnaud Carayol, Thomas Colcombet
  Lecture Notes in Computer Science 2719, 2003, pp. 599-610
• Adaptive raising strategies optimizing relative efficiency
  Arnold Schönhage
  Lecture Notes in Computer Science 2719, 2003, pp. 611-623
• A competitive algorithm for the general 2-server problem
  René A. Sitters, Leen Stougie, Willem E. de Paepe
  Lecture Notes in Computer Science 2719, 2003, pp. 624-636