Travelled to:1 × Austria
1 × Denmark
1 × Latvia
1 × United Kingdom
2 × USA
Collaborated with:Y.Yacobi ∅ N.D.Jones R.E.Ladner N.A.Lynch A.Hughes A.Pavan N.Russell C.Glaßer D.T.Nguyen C.Reitwießner M.Witek
Talks about:polynomi (3) time (3) problem (2) promis (2) reduc (2) set (2) comparison (1) conjectur (1) autoreduc (1) behavior (1)
Person: Alan L. Selman
DBLP: Selman:Alan_L=
Contributed to:
2013201219821979
19741972Wrote 6 papers:
- ICALP-v1-2013-GlasserNRSW #polynomial #reduction #set
- Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions (CG, DTN, CR, ALS, MW), pp. 473–484.
- ICALP-v1-2012-HughesPRS #problem
- A Thirty Year Old Conjecture about Promise Problems (AH, AP, NR, ALS), pp. 473–484.
- ICALP-1982-SelmanY #complexity #problem
- The Complexity of Promise Problems (ALS, YY), pp. 502–509.
- ICALP-1979-Selman #behaviour #polynomial #set
- P-Selective Sets, Tally Languages, and the Behavior of Polynomial Time Reducibilities on NP (ALS), pp. 546–555.
- STOC-1974-LadnerLS #polynomial
- Comparisons of Polynomial-Time Reducibilities (REL, NAL, ALS), pp. 110–121.
- STOC-1972-JonesS #first-order #similarity #turing machine
- Turing Machines and the Spectra of First-Order Formulas with Equality (NDJ, ALS), pp. 157–167.