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 [2]	Hilfe

Suche: Series=LNCS AND YEAR=1997

• A multithreaded substrate and compilation model for the implicitly parallel language pH
  Arvind, Alejandro Caro, Jan-Willem Maessen, Shail Aditya
  Lecture Notes in Computer Science 1239, 1997, pp. 519-533
• A generalized forall concept for parallel languages
  P.F.G. Dechering, L.C. Breebaart, F. Kuijlman, C. van Reeuwijk, H.J. Sips
  Lecture Notes in Computer Science 1239, 1997, pp. 605-607
• 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
• A grammatical approach to the LBA problem
  Henning Bordihn
  Lecture Notes in Computer Science 1218, 1997, pp. 1-9
• Controlled fuzzy parallel rewriting
  Peter R.J. Asveld
  Lecture Notes in Computer Science 1218, 1997, pp. 49-70
• On controlling rewriting by properties of strings and symbols
  Paolo Bottoni, Giancarlo Mauri, Piero Mussio
  Lecture Notes in Computer Science 1218, 1997, pp. 71-94
• Grammar systems with counting derivation and dynamical priorities
  Tudor Bălănescu, Horia Georgescu, Marian Gheorghe
  Lecture Notes in Computer Science 1218, 1997, pp. 150-166
• Teams in grammar systems: Sub-context-free cases
  Maurice H. Ter Beek
  Lecture Notes in Computer Science 1218, 1997, pp. 197-216
• A note on the incomparability of the E0L family with certain families of languages generated by cooperating grammar systems
  Mohamed Amin
  Lecture Notes in Computer Science 1218, 1997, pp. 217-219
• A grammar characterization of logarithmic-space computation
  Karl Abrahamson, Liming Cai, Steve Gordon
  Lecture Notes in Computer Science 1218, 1997, pp. 247-255
• On the computational complexity of context-free parallel communicating grammar systems
  Ştefan Bruda
  Lecture Notes in Computer Science 1218, 1997, pp. 256-266
• PC grammar systems versus some non-context-free constructions from natural and artificial languages
  Adrian Chiţu
  Lecture Notes in Computer Science 1218, 1997, pp. 278-287
• Networks of parallel language processors
  Erzsébet Csuhaj-Varjú, Arto Salomaa
  Lecture Notes in Computer Science 1218, 1997, pp. 299-318
• The structure of the basic morphisms
  Virgil Emil Căzănescu
  Lecture Notes in Computer Science 1218, 1997, pp. 422-429
• Algorithms and data structures for control dependence and related compiler problems
  Gianfranco Bilardi
  Lecture Notes in Computer Science 1203, 1997, pp. 1-2
• Algorithms and data structures for control dependence and related compiler problems
  Gianfranco Bilardi
  Lecture Notes in Computer Science 1203, 1997, pp. 1-2
• Finding optimum k-vertex connected spanning subgraphs: Improved approximation algorithms for k = 3,4,5
  Yefim Dinitz, Zeev Nutov
  Lecture Notes in Computer Science 1203, 1997, pp. 13-24
• Finding optimum k-vertex connected spanning subgraphs: Improved approximation algorithms for k = 3,4,5
  Yefim Dinitz, Zeev Nutov
  Lecture Notes in Computer Science 1203, 1997, pp. 13-24