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

• 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
• Characterization of context-free languages by erasing automata
  Petr Janc̑ar, Frantis̑ek Mrás, Martin Plátek
  Lecture Notes in Computer Science 629, 1992, pp. 307-314
• Insertion and deletion of words: Determinism and reversibility
  Lila Kari
  Lecture Notes in Computer Science 629, 1992, pp. 315-326
• Small universal one-state linear operator algorithm
  F. Kas̑c̑ák
  Lecture Notes in Computer Science 629, 1992, pp. 327-335
• Mobility in the CC-paradigm
  Cosimo Laneve, Ugo Montanari
  Lecture Notes in Computer Science 629, 1992, pp. 336-345
• The emptiness problem for intersections of regular languages
  Klaus-Jörn Lange, Peter Rossmanith
  Lecture Notes in Computer Science 629, 1992, pp. 346-354
• On finite automata with limited nondeterminism
  Hing Leung
  Lecture Notes in Computer Science 629, 1992, pp. 355-363
• Definitions and comparisons of local computations on graphs
  Igor Litovsky, Yvers Métivier, Eric Sopena
  Lecture Notes in Computer Science 629, 1992, pp. 364-373
• Efficient unidimensional universal cellular automaton
  Bruno Martin
  Lecture Notes in Computer Science 629, 1992, pp. 374-382
• Inferring a tree from walks
  Osamu Maruyama, Satoru Miyano
  Lecture Notes in Computer Science 629, 1992, pp. 383-391
• Almost every set in exponential time is P-Bi-immune
  Elvira Mayordomo
  Lecture Notes in Computer Science 629, 1992, pp. 392-400
• A functorial semantics for observed concurrency
  David Murphy, Axel Poigné
  Lecture Notes in Computer Science 629, 1992, pp. 401-411
• Modelling concurrency with semi-commutations
  Edward Ochmański
  Lecture Notes in Computer Science 629, 1992, pp. 412-420
• Decision problems for cellular automata and their semigroups
  John Pedersen
  Lecture Notes in Computer Science 629, 1992, pp. 421-429
• On the nature of events
  G. Michele Pinna, Axel Poigné
  Lecture Notes in Computer Science 629, 1992, pp. 430-441
• New parallel algorithms for convex hull and triangulation in 3-dimensional space
  W. Preilowski, E. Dahlhaus, G. Wechsung
  Lecture Notes in Computer Science 629, 1992, pp. 442-450
• Two simple characterizations of well-founded semantics
  Teodor C. Przymusinski
  Lecture Notes in Computer Science 629, 1992, pp. 451-462
• Fully abstract semantics for higher order communicating systems
  S. Ramesh
  Lecture Notes in Computer Science 629, 1992, pp. 463-471
• Superposable trellis automata
  Nicolas Reimen
  Lecture Notes in Computer Science 629, 1992, pp. 472-482
• Maintaining proximity in higher dimensional spaces
  Thomas Roos, Gerhard Albers
  Lecture Notes in Computer Science 629, 1992, pp. 483-493
• Characterizing regular languages with polynomial densities
  Andrew Szilard, Sheng Yu, Kaizhong Zhang, Jeffrey Shallit
  Lecture Notes in Computer Science 629, 1992, pp. 494-503
• A strategy for speeding-up the computation of characteristic sets
  Dongming Wang
  Lecture Notes in Computer Science 629, 1992, pp. 504-510
• One-rule trace-rewriting systems and confluence
  C. Wrathall, V. Diekert, F. Otto
  Lecture Notes in Computer Science 629, 1992, pp. 511-521