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
[1]
Hilfe
Suche: Author="Daley, Robert"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Breaking the probability
\frac{1}{2}
barrier in FIN-type learning
Robert Daley
,
Bala Kalyanasundaram
,
Mahendran Velauthapillai
Journal of Computer and System Sciences
50
(3), 1995, pp. 574-599
Probabilistic and pluralistic learners with mind changes
Robert Daley
,
Bala Kalyanasundaram
Lecture Notes in Computer Science
629
, 1992, pp. 218-226
On the complexity of inductive inference
Robert P. Daley
,
Carl H. Smith
Lecture Notes in Computer Science
176
, 1984, pp. 255-264
Busy Beaver Sets: Characterizations and Applications
Robert P. Daley
Information and Control
52
(1), 1982, pp. 52-67
The Complexity of the Validity Problem for Dynamic Logic
Kenneth L. Manders
,
Robert R. Daley
Information and Control
54
(1/2), 1982, pp. 48-69
Retraceability, repleteness and busy beaver sets
Robert P. Daley
Lecture Notes in Computer Science
118
, 1981, pp. 252-261
Quantitative and qualitative information in computations
Robert P. Daley
Information and Control
45
, 1980, pp. 236-244
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
The process complexity and the understanding of sequences
Robert P. Daley
Proceedings of the 2nd Symposium and Summer School on Mathematical Foundations of Computer Science, MFCS'1973 (Strbské Pleso, High Tatras, Czechoslovakia, September 3-8, 1973)
, 1973, pp. 215-218
Virtual memory, processes, and sharing in MULTICS
Robert Daley
,
Jack Dennis
Communications of the ACM
11
(5), 1968, May, pp. 306-312