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

• New trends in quantum computing
  Gilles Brassard
  Lecture Notes in Computer Science 1046, 1996, pp. 3-10
• Compressibility and resource bounded measure
  Harry Buhrman, Luc Longpré
  Lecture Notes in Computer Science 1046, 1996, pp. 13-24
• On the complexity of random strings
  Martin Kummer
  Lecture Notes in Computer Science 1046, 1996, pp. 25-36
• Remarks on generalized post correspondence problem
  T. Harju, J. Karhumäki, D. Krob
  Lecture Notes in Computer Science 1046, 1996, pp. 39-48
• Cyclic languages and strongly cyclic languages
  Marie-Pierre Béal, Olivier Carton, Christophe Reutenauer
  Lecture Notes in Computer Science 1046, 1996, pp. 49-59
• Resource-bounded balanced genericity, stochasticity and weak randomness
  Klaus Ambos-Spies, Elvira Mayordomo, Yongge Wang, Xizhong Zheng
  Lecture Notes in Computer Science 1046, 1996, pp. 63-74
• The complexity of generating and checking proofs of membership
  Harry Buhrman, Thomas Thierauf
  Lecture Notes in Computer Science 1046, 1996, pp. 75-86
• Observations on measures and lowness for \Delta^P_2
  Jack H. Lutz
  Lecture Notes in Computer Science 1046, 1996, pp. 87-97
• Solvable black-box group problems are low for PP
  V. Arvind, N.V. Vinodchandran
  Lecture Notes in Computer Science 1046, 1996, pp. 99-110
• Languages recognized by finite aperiodic groupoids
  Martin Beaudry
  Lecture Notes in Computer Science 1046, 1996, pp. 113-124
• Star-height of an IN-rational series
  Frédérique Bassino
  Lecture Notes in Computer Science 1046, 1996, pp. 125-135
• An aperiodic set of Wang cubes
  Karel Culik III, Jarkko Kari
  Lecture Notes in Computer Science 1046, 1996, pp. 137-146
• Lyndon factorization of infinite words
  Guy Melançon
  Lecture Notes in Computer Science 1046, 1996, pp. 147-154
• Embedding graphs with bounded treewidth into optimal hypercubes
  Volker Heun, Ernst W. Mayr
  Lecture Notes in Computer Science 1046, 1996, pp. 157-168
• Parallel comparability graph recognition and modular decomposition
  Michel Morvan, Laurent Viennot
  Lecture Notes in Computer Science 1046, 1996, pp. 169-180
• Fault-tolerant shared memory simulations
  Petra Berenbrink, Friedhelm Meyer auf der Heide, Volker Stemann
  Lecture Notes in Computer Science 1046, 1996, pp. 181-192
• On word-level parallelism in fault-tolerant computing
  Piotr Indyk
  Lecture Notes in Computer Science 1046, 1996, pp. 193-204
• Learning with confidence
  Jānis Bārzdiņs̆, Rūsiņs̑ Freivalds, Carl H. Smith
  Lecture Notes in Computer Science 1046, 1996, pp. 207-218
• Extracting best consensus motifs from positive and negative examples
  Erika Tateishi, Osamu Maruyama, Satoru Miyano
  Lecture Notes in Computer Science 1046, 1996, pp. 219-230
• PAC learning with simple examples
  François Denis, Cyrille D'Halluin, Rémi Gilleron
  Lecture Notes in Computer Science 1046, 1996, pp. 231-242
• General inductive inference types based on linearly-ordered sets
  Andris Ambainis, Rūsiņs̑ Freivalds, Carl H. Smith
  Lecture Notes in Computer Science 1046, 1996, pp. 243-253
• On the power of non-observable actions in timed automata
  Béatrice Bérard, Paul Gastin, Antoine Petit
  Lecture Notes in Computer Science 1046, 1996, pp. 257-268
• Trace rewriting: Computing normal forms in time O(n\log n)
  Michael Bertol, Volker Diekert
  Lecture Notes in Computer Science 1046, 1996, pp. 269-280
• A decision procedure for well-formed linear quantum cellular automata
  Christoph Dürr, Huong Lê Thanh, Miklos Santha
  Lecture Notes in Computer Science 1046, 1996, pp. 281-292
• On the complexity of worst case and expected time in a circuit
  Andreas Jacoby, Christian Schindelhauer
  Lecture Notes in Computer Science 1046, 1996, pp. 295-306