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

• Word level model checking
  Edmund M., Jr. Clarke, Xudong Zhao
  Lecture Notes in Computer Science 1113, 1996, pp. 1-1
• Code problems on traces
  Volker Diekert, Anca Muscholl
  Lecture Notes in Computer Science 1113, 1996, pp. 2-17
• Models of DNA computation
  Alan Gibbons, Martyn Amos, David Hodgson
  Lecture Notes in Computer Science 1113, 1996, pp. 18-36
• Theory and practice of action semantics
  Peter D. Mosses
  Lecture Notes in Computer Science 1113, 1996, pp. 37-61
• Linear time temporal logics over Mazurkiewicz traces
  Madhavan Mukund, P.S. Thiagarajan
  Lecture Notes in Computer Science 1113, 1996, pp. 62-92
• Partial order reduction: Model-checking using representatives
  Doron Peled
  Lecture Notes in Computer Science 1113, 1996, pp. 93-112
• Nonmonotonic rule systems: Forward chaining, constraints, and complexity
  Jeffrey B. Remmel
  Lecture Notes in Computer Science 1113, 1996, pp. 113-113
• Mind the gap! Abstract versus concrete models of specifications
  Donald Sannella, Andrzej Tarlecki
  Lecture Notes in Computer Science 1113, 1996, pp. 114-134
• A sequent calculus for subtyping polymorphic types
  Jerzy Tiuryn
  Lecture Notes in Computer Science 1113, 1996, pp. 135-155
• Kolmogorov complexity: Recent research in Moscow
  Vladimir A. Uspensky
  Lecture Notes in Computer Science 1113, 1996, pp. 156-166
• A modal logic for data analysis
  Philippe Balbiani
  Lecture Notes in Computer Science 1113, 1996, pp. 167-179
• From specifications to programs: A fork-algebraic approach to bridge the gap
  Gabriel A. Baum, Marcelo F. Frias, Armando M. Haeberer, PabloE. Martínez López
  Lecture Notes in Computer Science 1113, 1996, pp. 180-191
• Logic of predicates with explicit substitutions
  Marek A. Bednarczyk
  Lecture Notes in Computer Science 1113, 1996, pp. 192-205
• On the query complexity of sets
  Richard Beigel, William Gasarch, Martin Kummer, Georgia Martin, Timothy McNicholl, Frank Stephan
  Lecture Notes in Computer Science 1113, 1996, pp. 206-217
• A lambda calculus of incomplete objects
  Viviana Bono, Michele Bugliesi, Luigi Liquori
  Lecture Notes in Computer Science 1113, 1996, pp. 218-229
• Bisimilarity problems requiring exponential time
  Michele Boreale, Luca Trevisan
  Lecture Notes in Computer Science 1113, 1996, pp. 230-241
• Linear dynamic Kahn networks are deterministic
  Arie de Bruin, S.H. Nienhuys-Cheng
  Lecture Notes in Computer Science 1113, 1996, pp. 242-254
• Shortest path problems with time constraints
  X. Cai, T. Kloks, C.K. Wong
  Lecture Notes in Computer Science 1113, 1996, pp. 255-266
• Parallel alternating-direction access machine
  Bogdan S. Chlebus, Artur Czumaj, Leszek Ga̧sieniec, Miroslaw Kowaluk, Wojciech Plandowski
  Lecture Notes in Computer Science 1113, 1996, pp. 267-278
• Specification and verification of timed lazy systems
  Flavio Corradini, Marco Pistore
  Lecture Notes in Computer Science 1113, 1996, pp. 279-290
• A class of information logics with a decidable validity problem
  Stéphane Demri
  Lecture Notes in Computer Science 1113, 1996, pp. 291-302
• On the power of nonconservative PRAM
  Anders Dessmark, Andrzej Lingas
  Lecture Notes in Computer Science 1113, 1996, pp. 303-311
• Self-similarity viewed as a local property via tile sets
  Bruno Durand
  Lecture Notes in Computer Science 1113, 1996, pp. 312-323
• Simulation of specification statements in Hoare logic
  Kai Engelhardt, Willem-Paul de Roever
  Lecture Notes in Computer Science 1113, 1996, pp. 324-335
• Equational properties of iteration in algebraically complete categories
  Zoltán Ésik, Anna Labella
  Lecture Notes in Computer Science 1113, 1996, pp. 336-347