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

• Strong price of anarchy for machine load balancing
  Amos Fiat, Haim Kaplan, Meital Levy, Svetlana Olonetsky
  Lecture Notes in Computer Science 4596, 2007, pp. 583-594
• Efficient algorithms for constant well supported approximate equilibria in bimatrix games
  Spyros C. Kontogiannis, Paul G. Spirakis
  Lecture Notes in Computer Science 4596, 2007, pp. 595-606
• Equational systems and free constructions
  Marcelo Fiore, Chung-Kil Hur
  Lecture Notes in Computer Science 4596, 2007, pp. 607-618
• Categorical views on computations on trees
  Ichiro Hasuo, Bart Jacobs, Tarmo Uustalu
  Lecture Notes in Computer Science 4596, 2007, pp. 619-630
• Holographic algorithms: The power of dimensionality resolved
  Jin-Yi Cai, Pinyan Lu
  Lecture Notes in Computer Science 4596, 2007, pp. 631-642
• Reconciling data compression and Kolmogorov complexity
  Laurent Bienvenu, Wolfgang Merkle
  Lecture Notes in Computer Science 4596, 2007, pp. 643-654
• Size competitive meshing without large angles
  Gary L. Miller, Todd Phillips, Donald Sheehy
  Lecture Notes in Computer Science 4596, 2007, pp. 655-666
• A fully abstract trace semantics for general references
  James Laird
  Lecture Notes in Computer Science 4596, 2007, pp. 667-679
• Aliased register allocation for straight-line programs is NP-complete
  Jonathan K. Lee, Jens Palsberg, Fernando Magno Quintão Pereira
  Lecture Notes in Computer Science 4596, 2007, pp. 680-691
• Conservative ambiguity detection in context-free grammars
  Sylvain Schmitz
  Lecture Notes in Computer Science 4596, 2007, pp. 692-703
• Lower bounds for quantile estimation in random-order and multi-pass streaming
  Sudipto Guha, Andrew McGregor
  Lecture Notes in Computer Science 4596, 2007, pp. 704-715
• Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners
  Michael Elkin
  Lecture Notes in Computer Science 4596, 2007, pp. 716-727
• Checking and spot-checking the correctness of priority queues
  Matthew Chu, Sampath Kannan, Andrew McGregor
  Lecture Notes in Computer Science 4596, 2007, pp. 728-739
• Undecidability of 2-label BPP equivalences and behavioral type systems for the \pi-calculus
  Naoki Kobayashi, Takashi Suto
  Lecture Notes in Computer Science 4596, 2007, pp. 740-751
• Ready simulation for concurrency: It's logical!
  Gerald Lüttgen, Walter Vogler
  Lecture Notes in Computer Science 4596, 2007, pp. 752-763
• Continuous capacities on continuous state spaces
  Jean Goubault-Larrecq
  Lecture Notes in Computer Science 4596, 2007, pp. 764-776
• On the chromatic number of random graphs
  Amin Coja-Oghlan, Konstantinos Panagiotou, Angelika Steger
  Lecture Notes in Computer Science 4596, 2007, pp. 777-788
• Quasi-randomness and algorithmic regularity for graphs with general degree distributions
  Noga Alon, Amin Coja-Oghlan, Hiệp Hàn, Mihyun Kang, Vojtȇch Rödl, Mathias Schacht
  Lecture Notes in Computer Science 4596, 2007, pp. 789-800
• Complexity of the cover polynomial
  Markus Bläser, Holger Dell
  Lecture Notes in Computer Science 4596, 2007, pp. 801-812
• A generalization of Cobham's theorem to automata over real numbers
  Bernard Boigelot, Julien Brusten
  Lecture Notes in Computer Science 4596, 2007, pp. 813-824
• Minimum-time reachability in timed games
  Thomas Brihaye, Thomas A. Henzinger, Vinayak S. Prabhu, Jean-François Raskin
  Lecture Notes in Computer Science 4596, 2007, pp. 825-837
• Reachability-time games on timed automata
  Marcin Jurdziński, Ashutosh Trivedi
  Lecture Notes in Computer Science 4596, 2007, pp. 838-849
• Perfect information stochastic priority games
  Hugo Gimbert, Wiesƚaw Zielonka
  Lecture Notes in Computer Science 4596, 2007, pp. 850-861
• Bounded depth data trees
  Henrik Björklund, Mikoƚaj Bojańczyk
  Lecture Notes in Computer Science 4596, 2007, pp. 862-874
• Unranked tree automata with sibling equalities and disequalities
  Wong Karianto, Christof Löding
  Lecture Notes in Computer Science 4596, 2007, pp. 875-887