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="Allender, E."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
RUSPACE
(\log n)\subseteq DSPACE(\log^2 n/\log\log n)
E. Allender
,
K.-J. Lange
Theory of Computing Systems
31
(5), 1998, pp. 539-550
Lower bounds for the low hierarchy
E. Allender
,
L.A. Hemachandra
Journal of the ACM
39
(1), 1992, January, pp. 234-251
A note on the almost-everywhere hierarchy for nondeterministic time
E. Allender
,
R. Beigel
,
U. Hertrampf
,
S. Homer
Lecture Notes in Computer Science
415
, 1990, pp. 1-11
On the power of uniform families of constant depth threshold circuits
E. Allender
,
U. Hertrampf
Lecture Notes in Computer Science
452
, 1990, pp. 158-164
Counting hierarchies: Polynomial time and constant depth circuits
E.W. Allender
,
K.W. Wagner
Technical Report (LCSR-TR-143), 1990, January
Width-bounded reducibility and binary search over complexity classes
E. Allender
,
C. Wilson
Proceedings of the 5th Annual Conference on Structure in Complexity Theory, CSCT'90 (Universitat Politcnica de Catalunya, Barcelona, Spain, July 8-11, 1990)
, 1990, pp. 122-129
Lower bounds for the low hierarchy
E. Allender
,
L.A. Hemachandra
Lecture Notes in Computer Science
372
, 1989, pp. 31-45
A note on the power of threshold circuits
E. Allender
Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, FOCS'89 (Research Triangle Park, NC, October 30 - November 1, 1989)
, 1989, pp. 580-584
The generalized Kolmogorov complexity of sets
E. Allender
Proceedings of the 4th Annual Conference on Structure in Complexity Theory, CSCT'89 (University of Oregon, Eugene, Oregon, June 19-22, 1989)
, 1989, pp. 186-194
Limitations of the upward separation technique
E. Allender
Lecture Notes in Computer Science
372
, 1989, pp. 18-30
Kolmogorov complexity and degrees of tally sets
E. Allender
,
O. Watanabe
Proceedings of the 3rd Annual Conference on Structure in Complexity Theory, CSCT'88 (Georgetown University, Washington D.C., June 14-17 1988)
, 1988, pp. 102-111
Some consequences of the existence of pseudorandom generators
E. Allender
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987)
, 1987, pp. 151-159
Some consequences of the existence of pseudorandom generators
E.W. Allender
Proceedings of the 2nd Annual Conference on Structure in Complexity Theory, CSCT'87 (Cornell University, Ithaca, NY, June 16-19, 1987)
, 1987, pp. 157
Isomorphisms and
1-L
reductions
E. Allender
Lecture Notes in Computer Science
223
, 1986, pp. 12-22
The complexity of sparse sets in P
E. Allender
Lecture Notes in Computer Science
223
, 1986, pp. 1-11
The complexity of sparse sets in P
E.W. Allender
Technical Report (DCS-TR-184), 1986, April
P-uniform circuit complexity
E.W. Allender
Technical Report (DCS-TR-198), 1986, August
Improved lower bounds for the cycle detection problem
E. Allender
,
M.M. Klawe
Theoretical Computer Science
36
(2,3), 1985, pp. 231-237