Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=88

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

Formal description of programming concepts - A software engineering viewpoint
Dines Bjrner
Lecture Notes in Computer Science 88, 1980, pp. 1-21
Electronic category theory
R.M. Burstall
Lecture Notes in Computer Science 88, 1980, pp. 22-39
An essay about research on sparse NP complete sets
J. Hartmanis, S.R. Mahaney
Lecture Notes in Computer Science 88, 1980, pp. 40-57
Some theoretical aspects of applicative multiprocessing
Robert M. Keller
Lecture Notes in Computer Science 88, 1980, pp. 58-74
On some discrete optimization problems in mass storage systems
C.K. Wong
Lecture Notes in Computer Science 88, 1980, pp. 75-93
Abstract data types: A retrospective and prospective view
Wm.A. Wulf
Lecture Notes in Computer Science 88, 1980, pp. 94-112
Controlling behaviours of systems: Some basic concepts and some applications
A. Arnold, M. Nivat
Lecture Notes in Computer Science 88, 1980, pp. 113-122
Conceptual relations between databases transformed under join and projection
G. Ausiello, C. Batini, M. Moscarini
Lecture Notes in Computer Science 88, 1980, pp. 123-136
The weighted Sperner's set problem
X. Berenguer, J. Diaz
Lecture Notes in Computer Science 88, 1980, pp. 137-141
Proof of a concurrent program finding Euler paths
E. Best
Lecture Notes in Computer Science 88, 1980, pp. 142-153
A theoretical basis for the systematic proof method
Wolfgang Bibel
Lecture Notes in Computer Science 88, 1980, pp. 154-167
Consistent semantics for a data flow language
J. Dean Brock
Lecture Notes in Computer Science 88, 1980, pp. 168-180
Analog processes
Luca Cardelli
Lecture Notes in Computer Science 88, 1980, pp. 181-193
An extended polymorphic type system for applicative languages
Mario Coppo
Lecture Notes in Computer Science 88, 1980, pp. 194-204
A criterion of undecidability of algorithmic theories
Wiktor Dańko
Lecture Notes in Computer Science 88, 1980, pp. 205-218
On finding the optimal access path to resolve a relational data base query
P. Degano, A. Lomanto, F. Sirovich
Lecture Notes in Computer Science 88, 1980, pp. 219-230
Compound algebraic implementations: An approach to stepwise refinement of software systems
H. Ehrig, H.-J. Kreowski, B. Mahr, P. Padawitz
Lecture Notes in Computer Science 88, 1980, pp. 231-245
On and/or schemes
David Harel
Lecture Notes in Computer Science 88, 1980, pp. 246-260
A term model for CCS
M.C.B. Hennessy, G.D. Plotkin
Lecture Notes in Computer Science 88, 1980, pp. 261-274
A mathematical approach to multi-pass parsing
Berthold Hoffmann, Ilse-R. Schmiedecke
Lecture Notes in Computer Science 88, 1980, pp. 275-290
Abstract implementation of abstract data types
Ulrich L. Hupbach
Lecture Notes in Computer Science 88, 1980, pp. 291-304
Parallel algorithms in graph theory: Planarity testing
Joseph Ja'Ja', Janos Simon
Lecture Notes in Computer Science 88, 1980, pp. 305-319
On atomic nets and concurrency relations
Ryszard Janicki
Lecture Notes in Computer Science 88, 1980, pp. 320-333
Node-label controlled graph grammars
D. Janssens, G. Rozenberg
Lecture Notes in Computer Science 88, 1980, pp. 334-347
A method to compare the descriptive power of different types of Petri nets
Kurt Jensen
Lecture Notes in Computer Science 88, 1980, pp. 348-361

Seiten 1 2 3 >