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: Author="Robertson, E.L."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The nearest neighbor problem on bounded domains
R.G. Karlsson
,
J.I. Munro
,
E.L. Robertson
Lecture Notes in Computer Science
194
, 1985, pp. 318-327
On the structure of sets in NP and other complexity classes
L.H. Landweber
,
R.J. Lipton
,
E.L. Robertson
Theoretical Computer Science
15
, 1981, pp. 181-200
Backtracking with multi-level dynamic search rearrangement
P.W., Jr. Purdom
,
C.A. Brown
,
E.L. Robertson
Acta Informatica
15
(2), 1981, pp. 99-113
Properties of conflict-free and persistent Petri nets
L.H. Landweber
,
E.L. Robertson
Journal of the ACM
25
, 1978, pp. 352-364
Structure of complexity in weak monadic second-order theories of the natural numbers
E.L. Robertson
Proceedings of the 6th Annual ACM Symposium on Theory of Computing, STOC'74 (Seattle, WA, April 30 - May 2, 1974)
, 1974, pp. 161-171
Recursive properties of abstract complexity classes
L.H. Landweber
,
E.L. Robertson
Journal of the ACM
19
(2), 1972, April, pp. 296-308
Complexity classes of partial recursive functions
E.L. Robertson
Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, STOC'71 (Shaker Heights, OH, May 3-5, 1971)
, 1971, pp. 258-266
Recursive properties of abstract complexity classes
L.H. Landweber
,
E.L. Robertson
Proceedings of the 2nd Annual ACM Symposium on Theory of Computing, STOC'70 (Northampton, MA, May 4-6, 1970)
, 1970, pp. 31-36