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

• Topological semantics for hybrid systems
  Sergei Artemov, Jennifer Davoren, Anil Nerode
  Lecture Notes in Computer Science 1234, 1997, pp. 1-8
• Domain-free pure type systems
  Gilles Barthe, Morten Heine Srensen
  Lecture Notes in Computer Science 1234, 1997, pp. 9-20
• Generic queries over quasi-o-minimal domains
  Oleg V. Belegradek, Alexei P. Stolboushkin, Michael A. Taitslin
  Lecture Notes in Computer Science 1234, 1997, pp. 21-32
• Towards computing distances between programs via Scott domains
  Michael A. Bukatin, Joshua S. Scott
  Lecture Notes in Computer Science 1234, 1997, pp. 33-43
• A safe recursion scheme for exponential time
  Peter Clote
  Lecture Notes in Computer Science 1234, 1997, pp. 44-52
• Finite model theory, universal algebra and graph grammars
  Bruno Courcelle
  Lecture Notes in Computer Science 1234, 1997, pp. 53-55
• Complexity of query answering in logic databases with complex values
  Evgeny Dantsin, Andrei Voronkov
  Lecture Notes in Computer Science 1234, 1997, pp. 56-66
• Recognition of deductive data base stability
  Michael I. Dekhtyar, Alexander J. Dikovsky
  Lecture Notes in Computer Science 1234, 1997, pp. 67-77
• The concurrency complexity for the Horn fragment of linear logic
  Sergey M. Dudakov
  Lecture Notes in Computer Science 1234, 1997, pp. 78-87
• Studying algorithmic problems for free semi-groups and groups
  Valery Durnev
  Lecture Notes in Computer Science 1234, 1997, pp. 88-101
• Learning small programs with additional information
  Rūsiņs̑ Freivalds, Gints Tervits, Rolf Wiehagen, Carl Smith
  Lecture Notes in Computer Science 1234, 1997, pp. 102-112
• Cut elimination for the second order propositional logic with Hilbert's \epsilon-symbol, extensionality, and full comprehension
  Michael Gavrilovich
  Lecture Notes in Computer Science 1234, 1997, pp. 113-118
• Finite bases of admissible rules for the logic S5_2C
  Mikhail Golovanov
  Lecture Notes in Computer Science 1234, 1997, pp. 119-129
• An algebraic correctness criterion for intuitionistic proof-nets
  Philippe de Groote
  Lecture Notes in Computer Science 1234, 1997, pp. 130-140
• Towards a theory of recursive structures
  David Harel
  Lecture Notes in Computer Science 1234, 1997, pp. 141-144
• On the complexity of prefix formulas in modal logic of subset spaces
  Bernhard Heinemann
  Lecture Notes in Computer Science 1234, 1997, pp. 145-155
• The undecidability of second order linear affine logic
  Alexei P. Kopylov
  Lecture Notes in Computer Science 1234, 1997, pp. 156-166
• Operational logic of proofs with functionality condition on proof predicate
  Vladimir N. Krupski
  Lecture Notes in Computer Science 1234, 1997, pp. 167-177
• On linear ordering of strongly extensional finitely-branching graphs and non-well-founded sets
  Alexei Lisitsa, Vladimir Sazonov
  Lecture Notes in Computer Science 1234, 1997, pp. 178-188
• Functions for the general solution of parametric word equations
  G.S. Makanin, H. Abdulrab, P. Goralcik
  Lecture Notes in Computer Science 1234, 1997, pp. 189-202
• A proof procedure for hereditary Harrop formulas with free equality
  Evgeny Makarov
  Lecture Notes in Computer Science 1234, 1997, pp. 203-213
• Basic forward chaining construction for logic programs
  V.W. Marek, A. Nerode, J.B. Remmel
  Lecture Notes in Computer Science 1234, 1997, pp. 214-225
• Decidability and undecidability of the halting problem on Turing machines, a survey
  Maurice Margenstern
  Lecture Notes in Computer Science 1234, 1997, pp. 226-236
• Case study: Additive linear logic and lattices
  Jean-Yves Marion
  Lecture Notes in Computer Science 1234, 1997, pp. 237-247
• Some decision problems for traces
  Yuri Matiyasevich
  Lecture Notes in Computer Science 1234, 1997, pp. 248-257