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

• A protocol for serializing unique strategies
  Marcel Crasmaru, Christian Glaßer, Kenneth W. Regan, Samik Sengupta
  Lecture Notes in Computer Science 3153, 2004, pp. 660-672
• A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
  Henrik Björklund, Sven Sandberg, Sergei Vorobyov
  Lecture Notes in Computer Science 3153, 2004, pp. 673-685
• When can you play positionally?
  Hugo Gimbert, Wiesƚaw Zielonka
  Lecture Notes in Computer Science 3153, 2004, pp. 686-697
• The dual of concatenation
  Alexander Okhotin
  Lecture Notes in Computer Science 3153, 2004, pp. 698-710
• Computational aspects of disjunctive sequences
  Klaus Ambos-Spies, Edgar Busse
  Lecture Notes in Computer Science 3153, 2004, pp. 711-722
• Decidability of trajectory-based equations
  Michael Domaratzki, Kai Salomaa
  Lecture Notes in Computer Science 3153, 2004, pp. 723-734
• Efficient view point selection for silhouettes of convex polyhedra
  Therese Biedl, Masud Hasan, Alejandro López-Ortiz
  Lecture Notes in Computer Science 3153, 2004, pp. 735-747
• Angles and lengths in reconfigurations of polygons and polyhedra
  Therese Biedl, Anna Lubiw, Michael J. Spriggs
  Lecture Notes in Computer Science 3153, 2004, pp. 748-759
• Improved bounds and schemes for the declustering problem
  Benjamin Doerr, Nils Hebbinghaus, Sören Werth
  Lecture Notes in Computer Science 3153, 2004, pp. 760-771
• Crossing number is hard for cubic graphs
  Petr Hlinȇný
  Lecture Notes in Computer Science 3153, 2004, pp. 772-782
• A reducibility for the dot-depth hierarchy
  Victor L. Selivanov, Klaus W. Wagner
  Lecture Notes in Computer Science 3153, 2004, pp. 783-793
• Sublogarithmic ambiguity
  Klaus Wich
  Lecture Notes in Computer Science 3153, 2004, pp. 794-806
• An elementary proof for the non-parametrizability of the equation xyz = zvx
  Elena Petre
  Lecture Notes in Computer Science 3153, 2004, pp. 807-817
• A generalization of repetition threshold
  Lucian Ilie, Pascal Ochem, Jeffrey Shallit
  Lecture Notes in Computer Science 3153, 2004, pp. 818-826
• An algorithmic argument for nonadaptive query complexity lower bounds on advised quantum computation
  Harumichi Nishimura, Tomoyuki Yamakami
  Lecture Notes in Computer Science 3153, 2004, pp. 827-838
• Universal test for quantum one-way permutations
  Akinori Kawachi, Hirotada Kobayashi, Takeshi Koshiba, Raymond H. Putra
  Lecture Notes in Computer Science 3153, 2004, pp. 839-850
• A common algebraic description for probabilistic and quantum computations
  Martin Beaudry, José M. Fernandez, Markus Holzer
  Lecture Notes in Computer Science 3153, 2004, pp. 851-862
• Extraction and implication of path constraints
  Yves André, Anne-Cécile Caron, Denis Debarbieux, Yves Roos, Sophie Tison
  Lecture Notes in Computer Science 3153, 2004, pp. 863-875
• Schema evolution for XML: A consistency-preserving approach
  Béatrice Bouchou, Denio Duarte, Mírian Halfeld Ferrari Alves, Dominique Laurent, Martin A. Musicante
  Lecture Notes in Computer Science 3153, 2004, pp. 876-888
• Complexity of decision problems for simple regular expressions
  Wim Martens, Frank Neven, Thomas Schwentick
  Lecture Notes in Computer Science 3153, 2004, pp. 889-900