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=287
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Modules for Re-use
David Gries
Lecture Notes in Computer Science
287
, 1987, pp. 373-375
Hierarchical refinement of a Z specification
D. Neilson
Lecture Notes in Computer Science
287
, 1987, pp. 376-399
Lazy pattern matching in the ML language
A. Laville
Lecture Notes in Computer Science
287
, 1987, pp. 400-419
Program development using lambda abstraction
A. Pettorossi
Lecture Notes in Computer Science
287
, 1987, pp. 420-434
Relativized Arthur-Merlin versus Merlin-Arthur games
M. Santha
Lecture Notes in Computer Science
287
, 1987, pp. 435-442
Probabilistic quantifiers vs. distrustful adversaries
S. Zachos
,
M. Fürer
Lecture Notes in Computer Science
287
, 1987, pp. 443-455
On certain bandwidth restricted versions of the satisfiability problem of propositional CNF formulas
V. Arvind
,
S. Biswas
Lecture Notes in Computer Science
287
, 1987, pp. 456-469
A lock-ahead interpreter for sequential prolog and its implementation
A. Kumar
,
V.M. Malhotra
Lecture Notes in Computer Science
287
, 1987, pp. 470-484
Extension of weakest precondition formalism to a low level language
A. Sanyal
,
S. Biswas
,
V.M. Malhotra
Lecture Notes in Computer Science
287
, 1987, pp. 485-499
Retrospection on the PQCC compiler structure
K.V. Nori
,
S. Kumar
,
M. Pavan Kumar
Lecture Notes in Computer Science
287
, 1987, pp. 500-527
Some recent applications of knowledge
Rohit Parikh
Lecture Notes in Computer Science
287
, 1987, pp. 528-539
Seiten
<
1
2