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

• Optimal spaced seeds for faster approximate string matching
  Martin Farach-Colton, Gad M. Landau, S. Cenk Sahinalp, Dekel Tsur
  Lecture Notes in Computer Science 3580, 2005, pp. 1251-1262
• Fast neighbor joining
  Isaac Elias, Jens Lagergren
  Lecture Notes in Computer Science 3580, 2005, pp. 1263-1274
• Randomized fast design of short DNA words
  Ming-Yang Kao, Manan Sanghi, Robert Schweller
  Lecture Notes in Computer Science 3580, 2005, pp. 1275-1286
• A quantum lower bound for the query complexity of Simon's problem
  Pascal Koiran, Vincent Nesme, Natacha Portier
  Lecture Notes in Computer Science 3580, 2005, pp. 1287-1298
• All quantum adversary methods are equivalent
  Robert S̑palek, Mario Szegedy
  Lecture Notes in Computer Science 3580, 2005, pp. 1299-1311
• Quantum complexity of testing group commutativity
  Frédéric Magniez, Ashwin Nayak
  Lecture Notes in Computer Science 3580, 2005, pp. 1312-1324
• Semantic-based code obfuscation by abstract interpretation
  Mila Dalla Preda, Roberto Giacobazzi
  Lecture Notes in Computer Science 3580, 2005, pp. 1325-1336
• About Hoare logics for higher-order store
  Bernhard Reus, Thomas Streicher
  Lecture Notes in Computer Science 3580, 2005, pp. 1337-1348
• The polyranking principle
  Aaron R. Bradley, Zohar Manna, Henny B. Sipma
  Lecture Notes in Computer Science 3580, 2005, pp. 1349-1361
• Approximate guarding of monotone and rectilinear polygons
  Bengt J. Nilsson
  Lecture Notes in Computer Science 3580, 2005, pp. 1362-1373
• Linear time algorithms for clustering problems in any dimensions
  Amit Kumar, Yogish Sabharwal, Sandeep Sen
  Lecture Notes in Computer Science 3580, 2005, pp. 1374-1385
• Dynamic diffusion load balancing
  Petra Berenbrink, Tom Friedetzky, Russell Martin
  Lecture Notes in Computer Science 3580, 2005, pp. 1386-1398
• On the power of random bases in Fourier sampling: Hidden subgroup problem in the Heisenberg group
  Jaikumar Radhakrishnan, Martin Rötteler, Pranab Sen
  Lecture Notes in Computer Science 3580, 2005, pp. 1399-1411
• On the hardness of embeddings between two finite metrics
  Matthew Cary, Atri Rudra, Ashish Sabharwal
  Lecture Notes in Computer Science 3580, 2005, pp. 1412-1423
• Improved lower bounds for locally decodable codes and private information retrieval
  Stephanie Wehner, Ronald de Wolf
  Lecture Notes in Computer Science 3580, 2005, pp. 1424-1436
• Preservation under extensions on well-behaved finite structures
  Albert Atserias, Anuj Dawar, Martin Grohe
  Lecture Notes in Computer Science 3580, 2005, pp. 1437-1449
• Unsafe grammars and panic automata
  Teodor Knapik, Damian Niwiński, Paweƚ Urzyczyn, Igor Walukiewicz
  Lecture Notes in Computer Science 3580, 2005, pp. 1450-1461
• Signaling P systems and verification problems
  Cheng Li, Zhe Dang, Oscar H. Ibarra, Hsu-Chun Yen
  Lecture Notes in Computer Science 3580, 2005, pp. 1462-1473