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

• 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
• Dataflow semantics for Petri nets
  Robert Gold
  Lecture Notes in Computer Science 629, 1992, pp. 275-283
• About boundedness for some DATALOG and \mbox{DATALOG}^{neg} programs
  Irène Guessarian, Marcos Veloso-Peixoto
  Lecture Notes in Computer Science 629, 1992, pp. 284-297
• Merging and sorting strings in parallel
  Torben Hagerup, Ola Petersson
  Lecture Notes in Computer Science 629, 1992, pp. 298-306
• On growing context-sensitive languages
  Gerhard Buntrock, Krzysztof Loryś
  Lecture Notes in Computer Science 623, 1992, pp. 77-88
• 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
• 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
• Analytic analysis of algorithms
  Philippe Flajolet
  Lecture Notes in Computer Science 623, 1992, pp. 186-210
• Polynomial hash functions are reliable
  M. Dietzfelbinger, J. Gil, Y. Matias, N. Pippenger
  Lecture Notes in Computer Science 623, 1992, pp. 235-246
• Two strikes against perfect phylogeny
  Hans L. Bodlaender, Mike R. Fellows, Tandy J. Warnow
  Lecture Notes in Computer Science 623, 1992, pp. 273-283
• 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
• Gröbner bases: An introduction
  Bruno Buchberger
  Lecture Notes in Computer Science 623, 1992, pp. 378-379
• Buchberger's algorithm: The term rewriter's point of view
  Reinhard Bündgen
  Lecture Notes in Computer Science 623, 1992, pp. 380-391
• Completion of rewrite systems with membership constraints
  Hubert Comon
  Lecture Notes in Computer Science 623, 1992, pp. 392-403
• Lower bounds on the complexity of simplex range reporting on a pointer machine
  Bernard Chazelle, Burton Rosenberg
  Lecture Notes in Computer Science 623, 1992, pp. 439-449
• Characterization of temporal property classes
  Edward Chang, Zohar Manna, Amir Pnueli
  Lecture Notes in Computer Science 623, 1992, pp. 474-486