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

• Philosophical issues in Kolmogorov complexity
  Ming Li, Paul M.B. Vitányi
  Lecture Notes in Computer Science 623, 1992, pp. 1-15
• Circuit complexity and the expressive power of generalized first-order formulas
  Howard Straubing
  Lecture Notes in Computer Science 623, 1992, pp. 16-27
• One-message statistical zero-knowledge proofs and space-bounded verifier
  Alfredo de Santis, Giuseppe Persiano, Moti Yung
  Lecture Notes in Computer Science 623, 1992, pp. 28-40
• Abelian squares are avoidable on 4 letters
  Veikko Keränen
  Lecture Notes in Computer Science 623, 1992, pp. 41-52
• Polynomial size test sets for context-free languages
  Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
  Lecture Notes in Computer Science 623, 1992, pp. 53-64
• Quasi-deterministic 0L systems
  Taishin Y. Nishida
  Lecture Notes in Computer Science 623, 1992, pp. 65-76
• On growing context-sensitive languages
  Gerhard Buntrock, Krzysztof Loryś
  Lecture Notes in Computer Science 623, 1992, pp. 77-88
• Numeration systems, linear recurrences, and regular sets
  Jeffrey Shallit
  Lecture Notes in Computer Science 623, 1992, pp. 89-100
• The equality problem for rational series with multiplicities in the tropical semiring is undecidable
  Daniel Krob
  Lecture Notes in Computer Science 623, 1992, pp. 101-112
• Semi-commutations and rational expressions
  M. Clerbout, M. Latteux, Y. Roos, W. Zielonka
  Lecture Notes in Computer Science 623, 1992, pp. 113-125
• New results concerning synchronized finite automata
  Oscar H. Ibarra, Nicholas Q. Trân
  Lecture Notes in Computer Science 623, 1992, pp. 126-137
• A Greibach normal form for context-free graph grammars
  Joost Engelfriet
  Lecture Notes in Computer Science 623, 1992, pp. 138-149
• On reverse and general definite tree languages
  Pierre Péladeau, Andreas Podelski
  Lecture Notes in Computer Science 623, 1992, pp. 150-161
• Reductions to sets of low information content
  V. Arvind, Y. Han, L. Hemachandra, J. Köbler, A. Lozano, M. Mundhenk, M. Ogiwara, U. Schöning, R. Silvestri, T. Thierauf
  Lecture Notes in Computer Science 623, 1992, pp. 162-173
• UP and the low and high hierarchies: A relativized separation
  Ming-Jye Sheu, Timothy J. Long
  Lecture Notes in Computer Science 623, 1992, pp. 174-185
• Analytic analysis of algorithms
  Philippe Flajolet
  Lecture Notes in Computer Science 623, 1992, pp. 186-210
• How to count quickly and accurately: A unified analysis of probabilistic counting and other related problems
  Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski
  Lecture Notes in Computer Science 623, 1992, pp. 211-222
• Polynomial hash functions are reliable
  M. Dietzfelbinger, J. Gil, Y. Matias, N. Pippenger
  Lecture Notes in Computer Science 623, 1992, pp. 235-246
• Adaptive pattern matching
  R.C. Sekar, R. Ramesh, I.V. Ramakrishnan
  Lecture Notes in Computer Science 623, 1992, pp. 247-260
• Randomized interpolation and approximation of sparse polynomials
  Yishay Mansour
  Lecture Notes in Computer Science 623, 1992, pp. 261-272
• Two strikes against perfect phylogeny
  Hans L. Bodlaender, Mike R. Fellows, Tandy J. Warnow
  Lecture Notes in Computer Science 623, 1992, pp. 273-283
• Disjunctive systems and L-domains
  Guo-Qiang Zhang
  Lecture Notes in Computer Science 623, 1992, pp. 284-295
• Optimal parallel algorithms for periods, palindromes and squares
  Alberto Apostolico, Dany Breslauer, Zvi Galil
  Lecture Notes in Computer Science 623, 1992, pp. 296-307
• Near-perfect token distribution
  Andrei Z. Broder, Alan M. Frieze, E. Shamir, E. Upfal
  Lecture Notes in Computer Science 623, 1992, pp. 308-317
• Fast integer merging on the EREW PRAM
  Torben Hagerup, Mirosƚaw Kutyƚowski
  Lecture Notes in Computer Science 623, 1992, pp. 318-329