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

• Colouring non-sparse random intersection graphs
  Sotiris Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis
  Lecture Notes in Computer Science 5734, 2009, pp. 600-611
• On the structure of optimal greedy computation (for Job Scheduling)
  Periklis A. Papakonstantinou
  Lecture Notes in Computer Science 5734, 2009, pp. 612-623
• A probabilistic PTAS for shortest common superstring
  Kai Plociennik
  Lecture Notes in Computer Science 5734, 2009, pp. 624-635
• The cost of stability in network flow games
  Ezra Resnick, Yoram Bachrach, Reshef Meir, Jeffrey S. Rosenschein
  Lecture Notes in Computer Science 5734, 2009, pp. 636-650
• (Un)decidability of injectivity and surjectivity in one-dimensional sand automata
  Gaétan Richard
  Lecture Notes in Computer Science 5734, 2009, pp. 651-662
• Quantum algorithms to solve the hidden shift problem for quadratics and for functions of large Gowers norm
  Martin Rötteler
  Lecture Notes in Computer Science 5734, 2009, pp. 663-674
• From parity and payoff games to linear programming
  Sven Schewe
  Lecture Notes in Computer Science 5734, 2009, pp. 675-686
• Partial randomness and dimension of recursively enumerable reals
  Kohtaro Tadaki
  Lecture Notes in Computer Science 5734, 2009, pp. 687-699
• Partial solution and entropy
  Tadao Takaoka
  Lecture Notes in Computer Science 5734, 2009, pp. 700-711
• On pebble automata for data languages with decidable emptiness problem
  Tony Tan
  Lecture Notes in Computer Science 5734, 2009, pp. 712-723
• Size and energy of threshold circuits computing Mod functions
  Kei Uchizawa, Takao Nishizeki, Eiji Takimoto
  Lecture Notes in Computer Science 5734, 2009, pp. 724-735
• Points on computable curves of computable lengths
  Robert Rettinger, Xizhong Zheng
  Lecture Notes in Computer Science 5734, 2009, pp. 736-743
• The expressive power of binary submodular functions
  Stanislav Z̑ivný, David A. Cohen, Peter G. Jeavons
  Lecture Notes in Computer Science 5734, 2009, pp. 744-757