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

• Partial order reductions for bisimulation checking
  Michaela Huhn, Peter Niebert, Heike Wehrheim
  Lecture Notes in Computer Science 1530, 1998, pp. 271-282
• First-order-CTL model checking
  Jürgen Bohn, Werner Damm, Orna Grumberg, Hardi Hungar, Karen Laster
  Lecture Notes in Computer Science 1530, 1998, pp. 283-294
• On the complexity of counting the number of vertices moved by graph automorphisms
  Antoni Lozano, Vijay Raghavan
  Lecture Notes in Computer Science 1530, 1998, pp. 295-306
• Remarks on graph complexity
  Satyanarayana V. Lokam
  Lecture Notes in Computer Science 1530, 1998, pp. 307-318
• On the confluence of trace rewriting systems
  Markus Lohrey
  Lecture Notes in Computer Science 1530, 1998, pp. 319-330
• A string-rewriting characterization of Muller and Schupp's context-free graphs
  Hugues Calbrix, Teodor Knapik
  Lecture Notes in Computer Science 1530, 1998, pp. 331-342
• Different types of monotonicity for restarting automata
  Petr Janc̑ar, Frantis̑ek Mráz, Martin Plátek abd Jörg Vogel
  Lecture Notes in Computer Science 1530, 1998, pp. 343-354
• A Kleene iteration for parallelism
  Kamal Lodaya, Pascal Weil
  Lecture Notes in Computer Science 1530, 1998, pp. 355-366
• Quantum computation and information
  Umesh Vazirani
  Lecture Notes in Computer Science 1530, 1998, pp. 367-367