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

• Interactive proofs for quantum computation
  Andrew Chi-Chih Yao
  Lecture Notes in Computer Science 2906, 2003, pp. 1-1
• Drawing plane graphs
  Takao Nishizeki
  Lecture Notes in Computer Science 2906, 2003, pp. 2-5
• Linear time algorithm for approximating a curve by a single-peaked curve
  Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama
  Lecture Notes in Computer Science 2906, 2003, pp. 6-15
• A dynamic dictionary for priced information with application
  Anil Maheshwari, Michiel Smid
  Lecture Notes in Computer Science 2906, 2003, pp. 16-25
• Voronoi diagram in the flow field
  Tetsushi Nishida, Kokichi Sugihara
  Lecture Notes in Computer Science 2906, 2003, pp. 26-35
• Polygonal path approximation: A query based approach
  Ovidiu Daescu, Ningfang Mi
  Lecture Notes in Computer Science 2906, 2003, pp. 36-46
• A vertex incremental approach for dynamically maintaining chordal graphs
  Anne Berry, Pinar Heggernes, Yngve Villanger
  Lecture Notes in Computer Science 2906, 2003, pp. 47-57
• Finding the maximum common subgraph of a partial k-tree and a graph with a polynomially bounded number of spanning trees
  Atsuko Yamaguchi, Hiroshi Mamitsuka
  Lecture Notes in Computer Science 2906, 2003, pp. 58-67
• Hotlink enhancement algorithms for web directories
  Ori Gerstel, Shay Kutten, Rachel Matichin, David Peleg
  Lecture Notes in Computer Science 2906, 2003, pp. 68-77
• Finding a length-constrained maximum-density path in a tree
  Rung-Ren Lin, Wen-Hsiung Kuo, Kun-Mao Chao
  Lecture Notes in Computer Science 2906, 2003, pp. 78-87
• The intractability of computing the Hamming distance
  Bodo Manthey, Rüdiger Reischuk
  Lecture Notes in Computer Science 2906, 2003, pp. 88-97
• Infinitely-often autoreducible sets
  Richard Beigel, Lance Fortnow, Frank Stephan
  Lecture Notes in Computer Science 2906, 2003, pp. 98-107
• Limiting negations in bounded-depth circuits: An extension of Markov's theorem
  Shao Chin Sung, Keisuke Tanaka
  Lecture Notes in Computer Science 2906, 2003, pp. 108-116
• Computational complexity measures of multipartite quantum entanglement
  Tomoyuki Yamakami
  Lecture Notes in Computer Science 2906, 2003, pp. 117-128
• A new simple algorithm for the maximum-weight independent set problem on circle graphs
  Gabriel Valiente
  Lecture Notes in Computer Science 2906, 2003, pp. 129-137
• Polynomial time 2-approximation algorithms for the minmax subtree cover problem
  Hiroshi Nagamochi, Kohei Okada
  Lecture Notes in Computer Science 2906, 2003, pp. 138-147
• Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems
  Jianer Chen, Iyad A. Kanj, Ge Xia
  Lecture Notes in Computer Science 2906, 2003, pp. 148-157
• A new translation from semi-extended regular expressions into NFAs and its application to an approximate matching problem
  Hiroaki Yamamoto
  Lecture Notes in Computer Science 2906, 2003, pp. 158-167
• The quantum query complexity of 0-1 knapsack and associated claw problems
  V. Arvind, Rainer Schuler
  Lecture Notes in Computer Science 2906, 2003, pp. 168-177
• Non-interactive quantum perfect and statistical zero-knowledge
  Hirotada Kobayashi
  Lecture Notes in Computer Science 2906, 2003, pp. 178-188
• Quantum Merlin-Arthur proof systems: Are multiple Merlins more helpful to Arthur?
  Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yamakami
  Lecture Notes in Computer Science 2906, 2003, pp. 189-198
• A faster lattice reduction method using quantum search
  Christoph Ludwig
  Lecture Notes in Computer Science 2906, 2003, pp. 199-208
• Three sorting algorithms using priority queues
  Amr Elmasry
  Lecture Notes in Computer Science 2906, 2003, pp. 209-220
• Lower bounds on correction networks
  Grzegorz Stachowiak
  Lecture Notes in Computer Science 2906, 2003, pp. 221-229
• Approximate regular expression searching with arbitrary integer weights
  Gonzalo Navarro
  Lecture Notes in Computer Science 2906, 2003, pp. 230-239