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

• The complexity of the reliable connectivity problem
  Dimitris Kavadias, Lefteris M. Kirousis, Paul Spirakis
  Lecture Notes in Computer Science 520, 1991, pp. 259-266
• Pattern matching in order-sorted languages
  Delia Kesner
  Lecture Notes in Computer Science 520, 1991, pp. 267-276
• Two over three: A two-valued logic for software specification and validation over a three-valued predicate calculus
  Beata Konikowska
  Lecture Notes in Computer Science 520, 1991, pp. 277-286
• A solution of the complement problem in associative-commutative theories
  Emmanuel Kounalis, Denis Lugiez, Loic Pottier
  Lecture Notes in Computer Science 520, 1991, pp. 287-297
• A model for real-time systems
  Padmanabhan Krishnan
  Lecture Notes in Computer Science 520, 1991, pp. 298-307
• On strict codes
  Nguyen Huong Lam, Do Long Van
  Lecture Notes in Computer Science 520, 1991, pp. 308-317
• A decidable case of the semi-unification problem
  Hans Leiß, Fritz Henglein
  Lecture Notes in Computer Science 520, 1991, pp. 318-327
• Maintaining dictionaries in a hierarchical memory
  Claudia Leopold
  Lecture Notes in Computer Science 520, 1991, pp. 328-336
• Upper and lower bounds for certain graph-accessibility-problems on bounded alternating \omega-branching programs
  Christoph Meinel, Stephan Waack
  Lecture Notes in Computer Science 520, 1991, pp. 337-345
• CCS dynamic bisimulation is progressing
  Ugo Montanari, Vladimiro Sassone
  Lecture Notes in Computer Science 520, 1991, pp. 346-356
• Syntax and semantics of a monotonic framework for non-monotonic reasoning
  M.A. Nait Abdallah
  Lecture Notes in Computer Science 520, 1991, pp. 357-366
• On the cardinality of sets of infinite trees recognizable by finite automata
  Damian Niwiński
  Lecture Notes in Computer Science 520, 1991, pp. 367-376
• Extending temporal logic by explicit concurrency
  Barbara Paech
  Lecture Notes in Computer Science 520, 1991, pp. 377-386
• An extensional partial combinatory algebra based on \lambda-terms
  Ramón Pino Perez
  Lecture Notes in Computer Science 520, 1991, pp. 387-396
• Once more on order-sorted algebras
  Axel Poigné
  Lecture Notes in Computer Science 520, 1991, pp. 397-405
• Composition of two semi commutations
  Y. Roos, P.A. Wacrenier
  Lecture Notes in Computer Science 520, 1991, pp. 406-414
• An efficient decision algorithm for the uniform semi-unification problem
  Peter Ruz̑ic̑ka
  Lecture Notes in Computer Science 520, 1991, pp. 415-425
• Different modifications of pointer machines and their computational power
  Konstantin V. Shvachko
  Lecture Notes in Computer Science 520, 1991, pp. 426-435