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="Ladner, R."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Probabilistic game automata
A. Condon
,
R. Ladner
Lecture Notes in Computer Science
223
, 1986, pp. 144-162
Solitaire automata
R.E. Ladner
,
J.K. Norman
Journal of Computer and System Sciences
30
(1), 1985, February, pp. 116-129
Alternating pushdown and stack automata
R.E. Ladner
,
R.J. Lipton
,
L.J. Stockmeyer
SIAM Journal on Computing
13
(1), 1984, February, pp. 135-155
Alternation bounded auxiliary pushdown automata
R.E. Ladner
,
L.J. Stockmeyer
,
R.J. Lipton
Information and Control
62
(2/3), 1984, pp. 93-108
Estimating the multiplicities of conflicts in multiple access channels
A.G. Greenberg
,
R.E. Ladner
Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, FOCS'83 (Tucson, AZ, November 7-9, 1983)
, 1983, pp. 383-392
Efficient parallel algorithms for linear recurrence computation
A.C. Greenberg
,
R.E. Ladner
,
M.S. Paterson
,
Z. Galil
Information Processing Letters
15
(1), 1982, August, pp. 31-35
Testing the universal instance assumption
P. Honeyman
,
R.E. Ladner
,
M. Yannakakis
Information Processing Letters
10
(1), 1980, February, pp. 14-19
The complexity of problems in systems of communicating sequential processes
R.E. Ladner
Journal of Computer and System Sciences
21
(2), 1980, October, pp. 179-194
Propositional dynamic logic of regular programs
M.J. Fischer
,
R.E. Ladner
Journal of Computer and System Sciences
18
(2), 1979, April, pp. 194-211
The complexity of problems in systems of communicating sequential processes
R.E. Ladner
Proceedings of the 11th Annual ACM Symposium on Theory of Computing, STOC'79 (Atlanta, GA, April 30 - May 2, 1979)
, 1979, pp. 214-223
Alternating pushdown automata (preliminary report)
R.E. Ladner
,
R.J. Lipton
,
L.J. Stockmeyer
Proceedings of the 19th Annual IEEE Symposium on Foundations of Computer Science, FOCS'78 (Ann Arbor, MI, October 16-18, 1978)
, 1978, pp. 92-106
Propositional modal logic of programs
M.J. Fischer
,
R.E. Ladner
Proceedings of the 9th Annual ACM Symposium on Theory of Computing, STOC'77 (Boulder, CO, May 2-4, 1977)
, 1977, pp. 286-294
Parallel prefix computations
R.E. Ladner
,
M.J. Fisher
Proceedings of the 1977 Int. Conf. on Parallel Processing, ICPP'77 (Wayne State U., Detroit, MI)
, 1977, pp. 218-233
Space bounds for processing contentless inputs
A.R. Freedman
,
R.E. Ladner
Journal of Computer and System Sciences
11
, 1975, pp. 118-128
A comparison of polynomial time reducibilities
R.E. Ladner
,
N.A. Lynch
,
A.L. Selman
Theoretical Computer Science
1
(2), 1975, pp. 103-123
The circuit value problem is log-space complete for
\P
R.E. Ladner
SIGACT News
7
(1), 1975, pp. 583-590
Comparison of polynomial-time reducibilities
R. Ladner
,
N. Lynch
,
A.L. Selman
Proceedings of the 6th Annual ACM Symposium on Theory of Computing, STOC'74 (Seattle, WA, April 30 - May 2, 1974)
, 1974, pp. 110-121
Polynomial time reducibility
R.E. Ladner
Proceedings of the 5th Annual ACM Symposium on Theory of Computing, STOC'73 (Austin, TX, April 30 - May 2, 1973)
, 1973, pp. 122-129