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

Suche: Series=LNCS AND Volume=349

• Time is not a healer
  Nicola Santoro, Peter Widmayer
  Lecture Notes in Computer Science 349, 1989, pp. 304-313
• Area efficient methods to increase the reliability of combinatorial circuits
  Rüdiger Reischuk, Bernd Schmeltz
  Lecture Notes in Computer Science 349, 1989, pp. 314-326
• Fault masking probabilities with single and multiple signature analysis
  Jürgen Doenhardt
  Lecture Notes in Computer Science 349, 1989, pp. 327-338
• Chain properties of rule closures
  Miki Hermann
  Lecture Notes in Computer Science 349, 1989, pp. 339-347
• It is undecidable whether the Knuth-Bendix completion procedure generates a crossed pair
  Paliath Narendran, Jonathan Stillman
  Lecture Notes in Computer Science 349, 1989, pp. 348-359
• Algebraic specifications for domain theory
  Friederike Nickl
  Lecture Notes in Computer Science 349, 1989, pp. 360-374
• The query topology in logic programming
  Aida Batarekh, V.S. Subrahmanian
  Lecture Notes in Computer Science 349, 1989, pp. 375-387
• Testing membership: Beyond permutation groups
  M. Beaudry, P. McKenzie, D. Thérien
  Lecture Notes in Computer Science 349, 1989, pp. 388-399
• Membership in polynomial ideals over Q is exponential space complete
  Ernst W. Mayr
  Lecture Notes in Computer Science 349, 1989, pp. 400-406
• Some complexity theoretic aspects of AC rewriting
  Rakesh M. Verma, I.V. Ramakrishnan
  Lecture Notes in Computer Science 349, 1989, pp. 407-420
• Deciding bisimulation equivalences for a class of non-finite-state programs
  Bengt Jonsson, Joachim Parrow
  Lecture Notes in Computer Science 349, 1989, pp. 421-433
• Measure of parallelism of distributed computations
  Bernadette Charron-Bost
  Lecture Notes in Computer Science 349, 1989, pp. 434-445
• Decidability of weak fairness in Petri nets
  Petr Janc̑ar
  Lecture Notes in Computer Science 349, 1989, pp. 446-457
• New results on the generalized star-height problem
  J.E. Pin, H. Straubing, D. Thérien
  Lecture Notes in Computer Science 349, 1989, pp. 458-467
• On the equivalence problem for deterministic multitape automata and transducers
  Karel Culik II, Juhani Karhumäki
  Lecture Notes in Computer Science 349, 1989, pp. 468-479
• Deciding equivalence of finite tree automata
  Helmut Seidl
  Lecture Notes in Computer Science 349, 1989, pp. 480-492
• Concatenable segment trees
  Marc J. van Kreveld, Mark H. Overmars
  Lecture Notes in Computer Science 349, 1989, pp. 493-504
• Shortest edge-disjoint paths in graphs
  Andreas Schwill
  Lecture Notes in Computer Science 349, 1989, pp. 505-516
• Rounds versus time for the two person pebble game
  Bala Kalyanasundaram, Georg Schnitger
  Lecture Notes in Computer Science 349, 1989, pp. 517-529