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

• Pushdown automata with bounded nondeterminism and bounded ambiguity
  Christian Herzog
  Lecture Notes in Computer Science 911, 1995, pp. 358-370
• Multihead two-way probabilistic finite automata
  Ioan I. Macarie
  Lecture Notes in Computer Science 911, 1995, pp. 371-385
• Non-erasing Turing machines: A new frontier between a decidable halting problem and universality
  Maurice Margenstern
  Lecture Notes in Computer Science 911, 1995, pp. 386-397
• Cyclic automata networks on finite graphs
  Martín Matamala, Eric Goles
  Lecture Notes in Computer Science 911, 1995, pp. 398-410
• Multiple alignment of biological sequences with gap flexibility
  João Meidanis, João C. Setubal
  Lecture Notes in Computer Science 911, 1995, pp. 411-426
• Lower bounds for the modular communication complexity of various graph accessibility problems
  Christoph Meinel, Stephan Waack
  Lecture Notes in Computer Science 911, 1995, pp. 427-435
• On monotonous oracle machines
  M. Mundhenk
  Lecture Notes in Computer Science 911, 1995, pp. 436-448
• On using learning automata for fast graph partitioning
  B. John Oommen, Edward V. De St. Croix
  Lecture Notes in Computer Science 911, 1995, pp. 449-460
• Solution of a problem of Yekutieli and Mandelbrot
  Helmut Prodinger
  Lecture Notes in Computer Science 911, 1995, pp. 461-468
• A rewrite approach for constraint logic programming
  Gilles Richard, Frédéric Saubion
  Lecture Notes in Computer Science 911, 1995, pp. 469-482
• Simulations between cellular automata on Cayley graphs
  Zsuzsanna Róka
  Lecture Notes in Computer Science 911, 1995, pp. 483-493
• A temporal logic for real-time partial-ordering with named transactions
  Farn Wang
  Lecture Notes in Computer Science 911, 1995, pp. 494-508
• A new approach for routing in arrangement graphs and its performance evaluation
  Peter M. Yamakawa, Hiroyuki Ebara, Hideo Nakano
  Lecture Notes in Computer Science 911, 1995, pp. 509-523