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 [1]	Hilfe

Suche: Series=LNCS AND Volume=629

• Methods in parallel algorithmics
  Uzi Vishkin
  Lecture Notes in Computer Science 629, 1992, pp. 81
• On range searching with semialgebraic sets
  Pankaj K. Agarwal, Jiȓí Matous̑ek
  Lecture Notes in Computer Science 629, 1992, pp. 1-13
• Graph layout problems
  J. Díaz
  Lecture Notes in Computer Science 629, 1992, pp. 14-23
• Parallel recognition and ranking of context-free languages
  Klaus-Jörn Lange, Peter Rossmanith, Wojciech Rytter
  Lecture Notes in Computer Science 629, 1992, pp. 24-36
• On the expansion of combinatorial polytopes
  Milena Mihail
  Lecture Notes in Computer Science 629, 1992, pp. 37-49
• Neural networks and complexity theory
  Pekka Orponen
  Lecture Notes in Computer Science 629, 1992, pp. 50-61
• Theory of computation over stream algebras, and its applications
  J.V. Tucker, J.I. Zucker
  Lecture Notes in Computer Science 629, 1992, pp. 62-80
• On the complexity of small description and related topics
  Osamu Watanabe
  Lecture Notes in Computer Science 629, 1992, pp. 82-94
• Weak parallel machines: A new class of physically feasible parallel machine models
  Juraj Wiedermann
  Lecture Notes in Computer Science 629, 1992, pp. 95-111
• The complexity of graph connectivity
  Avi Wigderson
  Lecture Notes in Computer Science 629, 1992, pp. 112-132
• A perfect parallel dictionary
  Holger Bast, Martin Dietzfelbinger, Torben Hagerup
  Lecture Notes in Computer Science 629, 1992, pp. 133-141
• Some remarks on the test complexity of iterative logic arrays
  Bernd Becker, Joachim Hartmann
  Lecture Notes in Computer Science 629, 1992, pp. 142-152
• The degree structure of 1-L reductions
  Hans-Jörg Burtschick, Albrecht Hoene
  Lecture Notes in Computer Science 629, 1992, pp. 153-161
• Promise problems and access to unambiguous computation
  Jin-yi Cai, Lane A. Hemachandra, Jozef Vyskoc̑
  Lecture Notes in Computer Science 629, 1992, pp. 162-171
• On the complexity of incremental computation
  Suresh Chari, Desh Ranjan, Pankaj Rohatgi
  Lecture Notes in Computer Science 629, 1992, pp. 172-180
• Rational transductions and complexity of counting problems
  Christian Choffrut, Massimiliano Goldwurm
  Lecture Notes in Computer Science 629, 1992, pp. 181-190
• Negation elimination in equational formulae
  Hubert Comon, Maribel Fernández
  Lecture Notes in Computer Science 629, 1992, pp. 191-199
• Object interaction
  J.F. Costa, A. Sernadas, C. Sernadas, H.-D. Ehrich
  Lecture Notes in Computer Science 629, 1992, pp. 200-208
• Strong normalization of substitutions
  P.-L. Curien, T. Hardin, A. Ríos
  Lecture Notes in Computer Science 629, 1992, pp. 209-217
• Probabilistic and pluralistic learners with mind changes
  Robert Daley, Bala Kalyanasundaram
  Lecture Notes in Computer Science 629, 1992, pp. 218-226
• Parallel complexity of iterated morphisms and the arithmetic of small numbers
  Carsten Damm, Markus Holzer, Klaus-Jörn Lange
  Lecture Notes in Computer Science 629, 1992, pp. 227-235
• On computational power of weighted finite automata
  D. Derencourt, J. Karhumäki, M. Latteux, A. Terlutte
  Lecture Notes in Computer Science 629, 1992, pp. 236-245
• The shuffle exchange network has a Hamiltonian path
  Rainer Feldmann, Peter Mysliwietz
  Lecture Notes in Computer Science 629, 1992, pp. 246-254
• Poset properties of complex traces
  Paul Gastin, Antoine Petit
  Lecture Notes in Computer Science 629, 1992, pp. 255-263
• A threshold for unsatisfiability
  Andreas Goerdt
  Lecture Notes in Computer Science 629, 1992, pp. 264-274