Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=74

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

A sound and complete proof system for partial program correctness
J.W. de Bakker
Lecture Notes in Computer Science 74, 1979, pp. 1-12
The problem of reachability and verification of programs
J.M. Barzdin
Lecture Notes in Computer Science 74, 1979, pp. 13-25
Assertion programming
Andrzej J. Blikle
Lecture Notes in Computer Science 74, 1979, pp. 26-42
Complexity classes of formal languages
Ronald V. Book
Lecture Notes in Computer Science 74, 1979, pp. 43-56
Fast probabilistic algorithms
Rūsiņs̑ Freivalds
Lecture Notes in Computer Science 74, 1979, pp. 57-69
Relative succinctness of representations of languages and separation of complexity classes
Juris Hartmanis, T.P. Baker
Lecture Notes in Computer Science 74, 1979, pp. 70-88
On two types of loops
Ivan M. Havel
Lecture Notes in Computer Science 74, 1979, pp. 89-107
Full abstraction for a simple parallel programming language
M.C.B. Hennessy, G.D. Plotkin
Lecture Notes in Computer Science 74, 1979, pp. 108-120
On some developments in cryptography and their applications to computer science
Hermann A. Maurer
Lecture Notes in Computer Science 74, 1979, pp. 121-130
Searching, sorting and information theory
Kurt Mehlhorn
Lecture Notes in Computer Science 74, 1979, pp. 131-145
LCF: A way of doing proofs with a machine
Robin Milner
Lecture Notes in Computer Science 74, 1979, pp. 146-159
Axioms or algorithms
Vaughan R. Pratt
Lecture Notes in Computer Science 74, 1979, pp. 160-169
Power from power series
Arto Salomaa
Lecture Notes in Computer Science 74, 1979, pp. 170-181
Computational complexity of string and graph identification
A.O. Slisenko
Lecture Notes in Computer Science 74, 1979, pp. 182-190
A survey of grammar and L forms-1978
Derick Wood
Lecture Notes in Computer Science 74, 1979, pp. 191-200
A theoretical study on the time analysis of programs
Akeo Adachi, Takumi Kasai, Etsuro Moriya
Lecture Notes in Computer Science 74, 1979, pp. 201-207
Completeness problems in verification of programs and program schemes
H. Andréka, I. Németi, I. Sain
Lecture Notes in Computer Science 74, 1979, pp. 208-218
Relationships between AFDL's and cylinders
Jean-Michel Autebert
Lecture Notes in Computer Science 74, 1979, pp. 219-227
Computable data types
G. Comyn, G. Werner
Lecture Notes in Computer Science 74, 1979, pp. 228-236
Program equivalence and provability
G. Cousineau, P. Enjalbert
Lecture Notes in Computer Science 74, 1979, pp. 237-245
Interactive L systems with almost interactionless behaviour
K. Culik II, J. Karhumäki
Lecture Notes in Computer Science 74, 1979, pp. 246-257
On the simplification of constructions in degrees of unsolvability via computational complexity
Robert P. Daley
Lecture Notes in Computer Science 74, 1979, pp. 258-265
An algebraic extension of the Chomsky-hierarchy
W. Damm
Lecture Notes in Computer Science 74, 1979, pp. 266-276
Bounds on computational complexity and approximability of initial segments of recursive sets
M.I. Dekhtjar
Lecture Notes in Computer Science 74, 1979, pp. 277-283
On the weighted path length of binary search trees for unknown access probabilities
Thomas Fischer
Lecture Notes in Computer Science 74, 1979, pp. 284-291

Seiten 1 2 3 >