BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
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 DBLP: Selman:Alan_L=

Contributed to:

ICALP (1) 20132013
ICALP (1) 20122012
ICALP 19821982
ICALP 19791979
STOC 19741974
STOC 19721972

Wrote 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.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.