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

• The connection between modal logic and algorithmic logics
  P. van Emde Boas
  Lecture Notes in Computer Science 64, 1978, pp. 1-15
• The algebraic semantics of recursive program schemes
  B. Courcelle, M. Nivat
  Lecture Notes in Computer Science 64, 1978, pp. 16-30
• Finding the correctness proof of a concurrent program
  Edsger W. Dijkstra
  Lecture Notes in Computer Science 64, 1978, pp. 31-38
• An algebra for parallelism based on Petri nets
  V.E. Kotov
  Lecture Notes in Computer Science 64, 1978, pp. 39-55
• Data types as functions
  Brian H. Mayoh
  Lecture Notes in Computer Science 64, 1978, pp. 56-70
• Synthesis of communicating behaviour
  Robin Milner
  Lecture Notes in Computer Science 64, 1978, pp. 71-83
• Programming languages as mathematical objects
  Eric G. Wagner, James W. Thatcher, Jesse B. Wright
  Lecture Notes in Computer Science 64, 1978, pp. 84-101
• Writing and verifying sequential files updating programs
  M. Auguston
  Lecture Notes in Computer Science 64, 1978, pp. 102-111
• On the completeness of query languages for relational data bases
  François Bancilhon
  Lecture Notes in Computer Science 64, 1978, pp. 112-123
• Mastering contextsensitivity in programming languages
  Gerhard Barth
  Lecture Notes in Computer Science 64, 1978, pp. 124-133
• Decision problems concerning parallel programming
  J.A. Bergstra
  Lecture Notes in Computer Science 64, 1978, pp. 134-142
• Attribute grammars and two-level grammars: A unifying approach
  Piotr Dembiński, Jan Maƚuszyński
  Lecture Notes in Computer Science 64, 1978, pp. 143-154
• Extensions and implementations of abstract data type specifications
  H.-D. Ehrich
  Lecture Notes in Computer Science 64, 1978, pp. 155-164
• Concurrency of manipulations in multidimensional information structures
  Hartmut Ehrig, Barry K. Rosen
  Lecture Notes in Computer Science 64, 1978, pp. 165-176
• Deriving structures from structures
  Hartmut Ehrig, Hans-Jörg Kreowski, Andrea Maggiolo-Schettini, Barry K. Rosen, Josef Winkowski
  Lecture Notes in Computer Science 64, 1978, pp. 177-190
• Semantics of nondeterminism, concurrency and communication
  Nissim Francez, C.A.R. Hoare, Willem P. de Roever
  Lecture Notes in Computer Science 64, 1978, pp. 191-200
• Contribution to the theory of concurrency in databases
  G. Gardarin
  Lecture Notes in Computer Science 64, 1978, pp. 201-212
• Facts in place/transition-nets
  Hartmann J. Genrich, Kurt Lautenbach
  Lecture Notes in Computer Science 64, 1978, pp. 213-231
• Loop programs and classes of primitive recursive functions
  Bernhard Goetze, Werner Nehrlich
  Lecture Notes in Computer Science 64, 1978, pp. 232-238
• Dynamic theories of real and complex numbers
  M. Grabowski, A. Kreczmar
  Lecture Notes in Computer Science 64, 1978, pp. 239-249
• Multiplicative complexity of a pair of bilinear forms and of the polynomial multiplication
  D.Yu. Grigoriev
  Lecture Notes in Computer Science 64, 1978, pp. 250-256
• Some applications of algebraic semantics
  Irène Guessarian
  Lecture Notes in Computer Science 64, 1978, pp. 257-266
• Goal-oriented derivation of logic programs
  C.J. Hogger
  Lecture Notes in Computer Science 64, 1978, pp. 267-276
• Transforming recursion equations to algorithms
  Jacek Irlik
  Lecture Notes in Computer Science 64, 1978, pp. 277-285
• Structural invariants for some classes of structured programs
  Gérard Jacob
  Lecture Notes in Computer Science 64, 1978, pp. 286-297