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 [1]	Hilfe

Suche: Series=LNCS AND Volume=3142

• Word problems on compressed words
  Markus Lohrey
  Lecture Notes in Computer Science 3142, 2004, pp. 906-918
• Complexity of pseudoknot prediction in simple models
  Rune B. Lyngs
  Lecture Notes in Computer Science 3142, 2004, pp. 919-931
• Property testing of regular tree languages
  Frédéric Magniez, Michel de Rougemont
  Lecture Notes in Computer Science 3142, 2004, pp. 932-944
• Entropy as a fixed point
  Keye Martin
  Lecture Notes in Computer Science 3142, 2004, pp. 945-958
• Transparent long proofs: A first PCP theorem for NP_R
  K. Meer
  Lecture Notes in Computer Science 3142, 2004, pp. 959-970
• A time lower bound for satisfiability
  Dieter van Melkebeek, Ran Raz
  Lecture Notes in Computer Science 3142, 2004, pp. 971-982
• Some results on effective randomness
  Wolfgang Merkle, Nenad Mihailović, Theodore A. Slaman
  Lecture Notes in Computer Science 3142, 2004, pp. 983-995
• A polynomial quantum query lower bound for the set equality problem
  Gatis Midrijānis
  Lecture Notes in Computer Science 3142, 2004, pp. 996-1005
• Succinct representations of functions
  J. Ian Munro, S. Srinivasa Rao
  Lecture Notes in Computer Science 3142, 2004, pp. 1006-1015
• A note on Karr's algorithm
  Markus Müller-Olm, Helmut Seidl
  Lecture Notes in Computer Science 3142, 2004, pp. 1016-1028
• The existence and efficient construction of large independent sets in general random intersection graphs
  S. Nikoletseas, C. Raptopoulos, P. Spirakis
  Lecture Notes in Computer Science 3142, 2004, pp. 1029-1040
• Efficient consistency proofs for generalized queries on a committed database
  Rafail Ostrovsky, Charles Rackoff, Adam Smith
  Lecture Notes in Computer Science 3142, 2004, pp. 1041-1053
• A 2 \frac{1}{8}-approximation algorithm for rectangle tiling
  Katarzyna Paluch
  Lecture Notes in Computer Science 3142, 2004, pp. 1054-1065
• Extensional theories and rewriting
  Grigore Roşu
  Lecture Notes in Computer Science 3142, 2004, pp. 1066-1079
• Hardness of string similarity search and other indexing problems
  S. Cenk Sahinalp, Andrey Utis
  Lecture Notes in Computer Science 3142, 2004, pp. 1080-1098
• A syntactic characterization of distributive LTL queries
  Marko Samer, Helmut Veith
  Lecture Notes in Computer Science 3142, 2004, pp. 1099-1110
• Online scheduling with bounded migration
  Peter Sanders, Naveen Sivadasan, Martin Skutella
  Lecture Notes in Computer Science 3142, 2004, pp. 1111-1122
• On the expressive power of monadic least fixed point logic
  Nicole Schweikardt
  Lecture Notes in Computer Science 3142, 2004, pp. 1123-1135
• Counting in trees for free
  Helmut Seidl, Thomas Schwentick, Anca Muscholl, Peter Habermehl
  Lecture Notes in Computer Science 3142, 2004, pp. 1136-1149
• Games with winning conditions of high Borel complexity
  Olivier Serre
  Lecture Notes in Computer Science 3142, 2004, pp. 1150-1162
• Propositional PSPACE reasoning with Boolean programs versus quantified Boolean formulas
  Alan Skelley
  Lecture Notes in Computer Science 3142, 2004, pp. 1163-1175
• LA, permutations, and the Hajós calculus
  Michael Soltys
  Lecture Notes in Computer Science 3142, 2004, pp. 1176-1187
• A calibration of ineffective theorems of analysis in a hierarchy of semi-classical logical principles
  Michael Toftdal
  Lecture Notes in Computer Science 3142, 2004, pp. 1188-1200
• Efficiently computing succinct trade-off curves
  Sergei Vassilvitskii, Mihalis Yannakakis
  Lecture Notes in Computer Science 3142, 2004, pp. 1201-1213
• On randomization versus synchronization in distributed systems
  Hagen Völzer
  Lecture Notes in Computer Science 3142, 2004, pp. 1214-1226