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

• Molecular assembly and computation: From theory to experimental demonstrations
  John H. Reif
  Lecture Notes in Computer Science 2380, 2002, pp. 1-21
• Towards a predictive computational complexity theory
  Madhav V. Marathe
  Lecture Notes in Computer Science 2380, 2002, pp. 22-31
• Equivariant syntax and semantics
  Andrew M. Pitts
  Lecture Notes in Computer Science 2380, 2002, pp. 32-36
• L(A) = L(B)? Decidability results from complete formal systems
  Géraud Sénizergues
  Lecture Notes in Computer Science 2380, 2002, pp. 37-37
• Discrete tomography: Reconstruction under periodicity constraints
  Alberto Del Lungo, Andrea Frosini, Maurice Nivat, Laurent Vuillon
  Lecture Notes in Computer Science 2380, 2002, pp. 38-56
• Local and global methods in data mining: Basic techniques and open problems
  Heikki Mannila
  Lecture Notes in Computer Science 2380, 2002, pp. 57-68
• Program debugging and validation using semantic approximations and partial specifications
  M. Hermenegildo, G. Puebla, F. Bueno, P. López-García
  Lecture Notes in Computer Science 2380, 2002, pp. 69-72
• Inapproximability results for equations over finite groups
  Lars Engebretsen, Jonas Holmerin, Alexander Russell
  Lecture Notes in Computer Science 2380, 2002, pp. 73-84
• A faster all-pairs shortest path algorithm for real-weighted sparse graphs
  Seth Pettie
  Lecture Notes in Computer Science 2380, 2002, pp. 85-97
• On families of graphs having a decidable first order theory with reachability
  Thomas Colcombet
  Lecture Notes in Computer Science 2380, 2002, pp. 98-109
• Heuristically optimized trade-offs: A new paradigm for power laws in the Internet
  Alex Fabrikant, Elias Koutsoupias, Christos H. Papadimitriou
  Lecture Notes in Computer Science 2380, 2002, pp. 110-122
• The structure and complexity of Nash equilibria for a selfish routing game
  Dimitris Fotakis, Spyros Kontogiannis, Elias Koutsoupias, Marios Mavronicolas, Paul Spirakis
  Lecture Notes in Computer Science 2380, 2002, pp. 123-134
• Control message aggregation in group communication protocols
  Sanjeev Khanna, Joseph (Seffi) Naor, Dan Raz
  Lecture Notes in Computer Science 2380, 2002, pp. 135-146
• Church-Rosser languages vs. UCFL
  Tomasz Jurdzi'nski, Krzysztof Lorys
  Lecture Notes in Computer Science 2380, 2002, pp. 147-158
• Intersection of regular languages and star hierarchy
  Sebastian Bala
  Lecture Notes in Computer Science 2380, 2002, pp. 159-169
• On the construction of reversible automata for reversible languages
  Sylvain Lombardy
  Lecture Notes in Computer Science 2380, 2002, pp. 170-182
• Priority queues, pairing, and adaptive sorting
  Amr Elmasry
  Lecture Notes in Computer Science 2380, 2002, pp. 183-194
• Exponential structures for efficient cache-oblivious algorithms
  Michael A. Bender, Richard Cole, Rajeev Raman
  Lecture Notes in Computer Science 2380, 2002, pp. 195-207
• Bounded-depth frege systems with counting axioms polynomially simulate Nullstellensatz refutations
  Russell Impagliazzo, Nathan Segerlind
  Lecture Notes in Computer Science 2380, 2002, pp. 208-219
• On the complexity of resolution with bounded conjunctions
  Juan Luis Esteban, Nicola Galesi, Jochen Messner
  Lecture Notes in Computer Science 2380, 2002, pp. 220-231
• Cryptographic hardness based on the decoding of Reed-Solomon codes
  Aggelos Kiayias, Moti Yung
  Lecture Notes in Computer Science 2380, 2002, pp. 232-243
• Perfect constant-round secure computation via perfect randomizing polynomials
  Yuval Ishai, Eyal Kushilevitz
  Lecture Notes in Computer Science 2380, 2002, pp. 244-256
• Exponential lower bound for static semi-algebraic proofs
  Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik
  Lecture Notes in Computer Science 2380, 2002, pp. 257-268
• Paths problems in symmetric logarithmic space
  Andreas Jakoby, Maciej Liśkiewicz
  Lecture Notes in Computer Science 2380, 2002, pp. 269-280
• Scheduling search procedures
  Peter Damaschke
  Lecture Notes in Computer Science 2380, 2002, pp. 281-292