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="Selman, A.L."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Distributionally hard languages
L. Fortnow
,
A. Pavan
,
A.L. Selman
Theory of Computing Systems
34
(3), 2001, pp. 245-261
Hard promise problems and nonuniform complexity
L. Longpré
,
A.L. Selman
Lecture Notes in Computer Science
415
, 1990, pp. 216-226
One-way functions in complexity theory
A.L. Selman
Lecture Notes in Computer Science
452
, 1990, pp. 88-104
Oracles for structural properties: The isomorphism problem and public-key cryptography
S. Homer
,
A.L. Selman
Proceedings of the 4th Annual Conference on Structure in Complexity Theory, CSCT'89 (University of Oregon, Eugene, Oregon, June 19-22, 1989)
, 1989, pp. 3-14
Complexity measures for public-key cryptosystems
J. Grollmann
,
A.L. Selman
SIAM Journal on Computing
17
(2), 1988, April, pp. 309-335
A hierarchy theorem for almost everywhere complex sets with application to polynomial complexity degrees
J.G. Geske
,
D.T. Huynh
,
A.L. Selman
Lecture Notes in Computer Science
247
, 1987, pp. 125-135
Relativizing complexity classes with sparse oracles
T.J. Long
,
A.L. Selman
Journal of the ACM
33
(3), 1986, pp. 618-627
Qualitative relativizations of complexity classes
R.V. Book
,
T.J. Long
,
A.L. Selman
Journal of Computer and System Sciences
30
(3), 1985, June, pp. 395-413
Hard-core theorems for complexity classes
S. Even
,
A.L. Selman
,
Y. Yacobi
Journal of the ACM
32
(1), 1985, pp. 205-217
Quantitative relativizations of complexity classes
R.V. Book
,
T.J. Long
,
A.L. Selman
SIAM Journal on Computing
13
(3), 1984, August, pp. 461-487
Complexity measures for public-key cryptosystems
J. Grollmann
,
A.L. Selman
Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, FOCS'84 (Singer Island, FL, October 24-26, 1984)
, 1984, pp. 495-503
Positive relativizations of complexity classes
A.L. Selman
,
Mei-Rui Xu
,
R.V. Book
SIAM Journal on Computing
12
(3), 1983, August, pp. 565-579
Reductions on
NP
and
P
-selective sets
A.L. Selman
Theoretical Computer Science
19
, 1982, pp. 287-304
Some observations on
NP
, real numbers and
P
-selective sets
A.L. Selman
Journal of Computer and System Sciences
23
(3), 1981, December, pp. 326-332
P-selective sets, tally languages, and the behavior of polynomial time reducibilities on
NP
A.L. Selman
Lecture Notes in Computer Science
71
, 1979, pp. 546-555
Polynomial time enumeration reducibility
A.L. Selman
SIAM Journal on Computing
7
(4), 1978, November, pp. 440-457
A second step toward the polynomial hierarchy
T.P. Baker
,
A.L. Selman
Proceedings of the 17th Annual IEEE Symposium on Foundations of Computer Science, FOCS'76 (Houston, TX, October 25-27, 1976)
, 1976, pp. 71-75
A comparison of polynomial time reducibilities
R.E. Ladner
,
N.A. Lynch
,
A.L. Selman
Theoretical Computer Science
1
(2), 1975, pp. 103-123
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