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

• When worlds collide: Derandomization, lower bounds, and Kolmogorov complexity
  Eric Allender
  Lecture Notes in Computer Science 2245, 2001, pp. 1-15
• Approximation schemes for geometric NP-hard problems: A survey
  Sanjeev Arora
  Lecture Notes in Computer Science 2245, 2001, pp. 16-17
• On clustering using random walks
  David Harel, Yehuda Koren
  Lecture Notes in Computer Science 2245, 2001, pp. 18-41
• An introduction to decidability of DPDA equivalence
  Colin Stirling
  Lecture Notes in Computer Science 2245, 2001, pp. 42-56
• Semidefinite programming based approximation algorithms
  Uri Zwick
  Lecture Notes in Computer Science 2245, 2001, pp. 57-57
• Hard sets and pseudo-random generators for constant depth circuits
  Manindra Agrawal
  Lecture Notes in Computer Science 2245, 2001, pp. 58-69
• The first-order isomorphism theorem
  Manindra Agrawal
  Lecture Notes in Computer Science 2245, 2001, pp. 70-82
• Thresholds and optimal binary comparison search trees
  Richard Anderson, Sampath Kannan, Howard Karloff, Richard E. Ladner
  Lecture Notes in Computer Science 2245, 2001, pp. 83-95
• Distributed LTL model checking based on negative cycle detection
  Lubos̑s Brim, Ivana C̑erná, Pavel Krc̑ál, Radek Pelánek
  Lecture Notes in Computer Science 2245, 2001, pp. 96-107
• Computability and complexity results for a spatial assertion language for data structures
  Cristiano Calcagno, Hongseok Yang, Peter W. O'Hearn
  Lecture Notes in Computer Science 2245, 2001, pp. 108-119
• Using nondeterminism to design deterministic algorithms
  Jianer Chen, Donald K. Friesen, Weijia Jia, Iyad A. Kanj
  Lecture Notes in Computer Science 2245, 2001, pp. 120-131
• Liveness verification of reversal-bounded multicounter machines with a free counter
  Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro
  Lecture Notes in Computer Science 2245, 2001, pp. 132-143
• A mechanically verified compiling specification for a Lisp compiler
  Axel Dold, Vincent Vialard
  Lecture Notes in Computer Science 2245, 2001, pp. 144-155
• Beyond regular model checking
  Dana Fisman, Amir Pnueli
  Lecture Notes in Computer Science 2245, 2001, pp. 156-170
• Relations between communication complexity, linear arrangements, and computational complexity
  Jürgen Forster, Matthias Krause, Satyanarayana V. Lokam, Rustam Mubarakzjanov, Niels Schmitt, Hans Ulrich Simon
  Lecture Notes in Computer Science 2245, 2001, pp. 171-182
• Optimal, output-sensitive algorithms for constructing upper envelope of line segments in parallel
  Neelima Gupta, Sumit Chopra, Sandeep Sen
  Lecture Notes in Computer Science 2245, 2001, pp. 183-194
• List decoding from erasures: Bounds and code constructions
  Venkatesan Guruswami
  Lecture Notes in Computer Science 2245, 2001, pp. 195-206
• Verification of a leader election algorithm in timed asynchronous systems
  Neeraj Jaggi, K. Gopinath
  Lecture Notes in Computer Science 2245, 2001, pp. 207-218
• Efficient addition on field programmable gate arrays
  Andreas Jakoby, Christian Schindelhauer
  Lecture Notes in Computer Science 2245, 2001, pp. 219-231
• The directed minimum-degree spanning tree problem
  Radha Krishnan, Balaji Raghavachari
  Lecture Notes in Computer Science 2245, 2001, pp. 232-243
• I/O-efficient batched range counting and its applications to proximity problems
  Tamás Lukovszki, Anil Maheshwari, Norbert Zeh
  Lecture Notes in Computer Science 2245, 2001, pp. 244-255
• Beyond message sequence graphs
  P. Madhusudan, B. Meenakshi
  Lecture Notes in Computer Science 2245, 2001, pp. 256-267
• Grouping techniques for one machine scheduling subject to precedence constraints
  Monaldo Mastrolilli
  Lecture Notes in Computer Science 2245, 2001, pp. 268-279
• Properties of distributed timed-arc Petri nets
  Mogens Nielsen, Vladimiro Sassone, Jiȓí Srba
  Lecture Notes in Computer Science 2245, 2001, pp. 280-291
• From falsification to verification
  Doron Peled, Amir Pnueli, Lenore Zuck
  Lecture Notes in Computer Science 2245, 2001, pp. 292-304