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 YEAR=2001

• 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
• 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
• Self-dual codes using image restoration techniques
  A. Baliga, J. Chua
  Lecture Notes in Computer Science 2227, 2001, pp. 46-56
• Low complexity tail-biting trellises of self-dual codes of length 24, 32 and 40 over GF(2) and Z_4 of large minimum distance
  E. Cadic, J.C. Carlach, G. Olocco, A. Otmani, J.P. Tillich
  Lecture Notes in Computer Science 2227, 2001, pp. 57-66
• F_q-linear cyclic codes over F_{q^m}: DFT characterization
  Bikash Kumar Dey, B. Sundar Rajan
  Lecture Notes in Computer Science 2227, 2001, pp. 67-76
• Cyclic projective Reed-Muller codes
  Thierry P. Berger, Louis de Maximy
  Lecture Notes in Computer Science 2227, 2001, pp. 77-81
• Type II codes over IF_{2^r}
  Koichi Betsumiya, Masaaki Harada, Akihiro Munemasa
  Lecture Notes in Computer Science 2227, 2001, pp. 102-111
• On hyperbolic codes
  Olav Geil, Tom Hholdt
  Lecture Notes in Computer Science 2227, 2001, pp. 159-171
• On homogeneous bent functions
  Chris Charnes, Martin Rötteler, Thomas Beth
  Lecture Notes in Computer Science 2227, 2001, pp. 249-259
• Partially identifying codes for copyright protection
  Sylvia Encheva, Gérard Cohen
  Lecture Notes in Computer Science 2227, 2001, pp. 260-267
• An algorithm for computing cocyclic matrices developed over some semidirect products
  V. Álvarez, J.A. Armario, M.D. Frau, P. Real
  Lecture Notes in Computer Science 2227, 2001, pp. 287-296
• Algorithms for large integer matrix problems
  Mark Giesbrecht, Michael, Jr. Jacobson, Arne Storjohann
  Lecture Notes in Computer Science 2227, 2001, pp. 297-307
• On algebraic soft decision decoding of cyclic binary codes
  Vladimir B. Balakirsky
  Lecture Notes in Computer Science 2227, 2001, pp. 315-322
• Lifting decoding schemes over a Galois ring
  Eimear Byrne
  Lecture Notes in Computer Science 2227, 2001, pp. 323-332
• Cartan's characters and stairs of characteristic sets
  François Boulier, Sylvain Neut
  Lecture Notes in Computer Science 2227, 2001, pp. 363-372