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

• On the semantics of logic programs
  M. Gabbrielli, G. Levi
  Lecture Notes in Computer Science 510, 1991, pp. 1-19
• Logic programming with recurrence domains
  Hong Chen, Jieh Hsiang
  Lecture Notes in Computer Science 510, 1991, pp. 20-34
• Extensional embedding of a strongly stable model of PCF
  A. Bucciarelli, T. Ehrhard
  Lecture Notes in Computer Science 510, 1991, pp. 35-46
• Uniform ideals and strictness analysis
  C. Ernoult, A. Mycroft
  Lecture Notes in Computer Science 510, 1991, pp. 47-59
• Logical and computational aspects of programming with sets/bags/lists
  V. Breazu-Tannen, R. Subrahmanyam
  Lecture Notes in Computer Science 510, 1991, pp. 60-75
• Safety for branching time semantics
  A. Bouajjani, J.C. Fernández, S. Graf, C. Rodríguez, J. Sifakis
  Lecture Notes in Computer Science 510, 1991, pp. 76-92
• Program composition and modular verification
  L. Fix, N. Francez, O. Grumberg
  Lecture Notes in Computer Science 510, 1991, pp. 93-114
• Model-checking for probabilistic real-time systems
  R. Alur, C. Courcoubetis, D. Dill
  Lecture Notes in Computer Science 510, 1991, pp. 115-126
• Computing behavioural relations, logically
  R. Cleaveland, B. Steffen
  Lecture Notes in Computer Science 510, 1991, pp. 127-138
• The power of reconfiguration
  Y. Ben-Asher, D. Peleg, R. Ramaswami, A. Schuster
  Lecture Notes in Computer Science 510, 1991, pp. 139-150
• General resolution of Tseitin formulas is hard
  J.-D. Fouks
  Lecture Notes in Computer Science 510, 1991, pp. 151-162
• Program checkers for probability generation
  S. Kannan, A. Yao
  Lecture Notes in Computer Science 510, 1991, pp. 163-173
• Running time to recognize nonregular languages by 2-way probabilistic automata
  J. Kaneps, R. Freivalds
  Lecture Notes in Computer Science 510, 1991, pp. 174-185
• Statistics on random trees
  R. Casas, J. Díaz, C. Martínez
  Lecture Notes in Computer Science 510, 1991, pp. 186-203
• The expressive power of implicit specifications
  K.G. Larsen
  Lecture Notes in Computer Science 510, 1991, pp. 204-216
• CCS+time = an interleaving model for real time systems
  Wang Yi
  Lecture Notes in Computer Science 510, 1991, pp. 217-228
• On confluent semi-commutations-decidability and complexity results
  V. Diekert, E. Ochmanski, K. Reinhardt
  Lecture Notes in Computer Science 510, 1991, pp. 229-241
• Lazard's factorizations of free partially commutative monoids
  G. Duchamp, D. Krob
  Lecture Notes in Computer Science 510, 1991, pp. 242-253
• A Kleene theorem for infinite trace languages
  P. Gastin, A. Petit, W. Zielonka
  Lecture Notes in Computer Science 510, 1991, pp. 254-266
• Canonical sets of Horn clauses
  N. Dershowitz
  Lecture Notes in Computer Science 510, 1991, pp. 267-278
• A specialized completion procedure for monadic string-rewriting systems presenting groups
  K. Madlener, P. Narendran, F. Otto
  Lecture Notes in Computer Science 510, 1991, pp. 279-290
• A confluent reduction for the \lambda-calculus with surjective pairing and terminal object
  P.-L. Curien, R. Di Cosmo
  Lecture Notes in Computer Science 510, 1991, pp. 291-302
• Provably recursive programs and program extraction
  T. Fernando
  Lecture Notes in Computer Science 510, 1991, pp. 303-313
• Efficient algorithms for path problems with general cost criteria
  T. Lengauer, D. Theune
  Lecture Notes in Computer Science 510, 1991, pp. 314-326
• Computing shortest paths and distances in planar graphs
  H.N. Djidjev, G.E. Pantziou, C.D. Zaroliagis
  Lecture Notes in Computer Science 510, 1991, pp. 327-338