Teaching Activities
Recent Activities

EditorinChief,
Theory of Computing Systems, 2001

Chaired the NSFSponsored Workshop on Research in Theoretical Computer
Science, March 1999; see link above for final report

Books

Member of the Editorial Board

Member of the Working Group, Theory of Computing,
ACM Workshop on Strategic Directions in Computing Research, June 1996,
and coauthor of the report,
Strategic
Directions for Research in Theory of Computing
Professor Selman is a Fellow of the ACM, recipient of a Humboldt research
award (2005),
an Invitation
Fellowship for research in Japan from the
Japan Society for
the Promotion of Science (1996), and a Fulbright scholar (1981).
Curriculum Vitae:
(pdf)
Recent Papers

C. Glasser, A. Selman, and L. Zhang.
The Informational Content of Canonical Disjoint NPPairs.
(pdf)
13th Annual International Computing and Combinatorics Conference,
Banff, Canada, July 2007.

C. Glasser, A. Pavan, A. Selman, and L. Zhang.
Mitosis in Computational Complexity.
(pdf)
Text of my plenary lecture at the Third International Conference,
Theory and Applications of Models of Computation, Beijing, May, 2006.

C. Glasser, A. Selman, S. Travers, and K. Wagner.
The Complexity of Unions of Disjoint Sets.
(pdf)

C. Glasser, A. Selman, S. Travers, and L. Zhang.
NonMitotic Sets.
(pdf)

C. Glasser, A. Selman, L. Zhang.
Survey of Disjoint NPPairs and Relations to Propositional
Proof Systems.
(ps)
(pdf)
In Theoretical Computer Science, Essays in Memory of
Shimon Even, eds. O. Goldreich, A. Rosenberg, and A. Selman,
LNCS 3895, Springer, 2006.

C. Glasser, A. Pavan, A. Selman, and L. Zhang.
Redundancy in Complete Sets.
(ps)
(pdf)
23rd Annual Symposium on Theoretical Aspects of Computer Science,
Marseille, France, February 2006.

C. Glasser, M. Ogihara, A. Pavan, A. Selman, and L. Zhang.
Autoreducibility, Mitoticity, and Immunity. (ps)
(pdf)
30th International Symposium on Mathematical Foundations of Computer Science,
Gdansk, Poland, 2005.

C. Glasser, A. Selman, and L. Zhang.
Canonical Disjoint NPPairs of Propositional Proof Systems.
(ps)
(pdf)
30th International Symposium on Mathematical Foundations of Computer Science,
Gdansk, Poland, 2005.

C. Glasser, A. Pavan, A. Selman, and S. Sengupta.
Properties of NPComplete Sets.
(ps)
(pdf)
19th IEEE Conference on Computational Complexity, Amherst, MA,
June, 2004.

A. Selman and S. Sengupta.
Polylogarithmicround Interactive Proofs for coNP
Collapse the Exponential Hierarchy.
(ps)
(pdf)
19th IEEE Conference on Computational Complexity, Amherst, MA,
June, 2004.

C. Glasser, A. Selman, and S. Sengupta.
Reductions between Disjoint NPPairs.
(ps)
(pdf)
19th IEEE Conference on Computational Complexity, Amherst, MA,
June, 2004.

C. Glasser, A. Selman, S. Sengupta, and L. Zhang.
Disjoint NPPairs.
(ps)
(pdf)
18th IEEE Conference on Computational Complexity, Aarhus, Denmark,
July, 2003.

A. Pavan and A. Selman.
BiImmunity Separates Strong NPcompleteness Notions.
(ps)
(pdf)
19th International
Symposium on Theoretical Aspects of Computer Science, Antibes JuanlesPins,
France, March, 2002.

A. Pavan and A. Selman.
Separaton of NPcompleteness notions.
(ps)
(pdf)
SIAM Journal on Computing, 31(3):906918, 2002.

J. Savage, A. Selman, and C. Smith.
History and Contributions of Theoretical Computer Science.
(ps)
(pdf)
In Advances in Computing, ed. M. Zelkowitz, Academic Press,
v. 55, 2001.

L. Fortnow, A. Pavan, and A. Selman.
Distributionally hard languages.
Theory of Computing Systems, 34(3):245263, 2001.

A. Selman. Much ado about functions.
(ps)
(pdf)
Text of invited address given at the
Eleventh IEEE Conference on Computational Complexity, May, 1996.

A. Naik, J. Rogers, J. Royer, and A. Selman.
A hierarchy based on output multiplicity.
(ps)
(pdf)
Theoretical Computer Science, 207(1):131157, 1998.

A. Pavan and A. Selman.
Complete distributional problems, hard languages, and resourcebounded
measure.
(ps)
(pdf)
Theoretical Computer Science, 234(12):273286, 2000.

A. Naik and A. Selman.
Adaptive versus nonadaptive queries to NP and pselective sets.
(ps)
(pdf)
Computational Complexity, 8(2):171189, 1999.

JY. Cai and A. Selman.
Fine separation of average time complexity classes.
SIAM Journal on Computing, 28(4):13101325, 1999.

S. Fenner, F. Green, S. Homer, A. Selman, T. Thierauf, and H. Vollmer.
Complements of multivalued functions.
Chicago Journal of Theoretical Computer Science,
March 19, 1999.
ACM Digital Library
Strategic directions in research in theory of computingAnne Condon,
Faith Fich,
Greg N. Frederickson,
Andrew V. Goldberg,
David S. Johnson,
Michael C. Loui,
Steven Mahaney,
Prabhakar Raghavan,
John E. Savage,
Alan L. Selman,
David B. ShmoysACM SIGACT News, 1997
Personal
Photos from my trip to Japan, April 1996
(taken by Professor Namiki,TUAT, with his digital camera). Professor
Nakamori, TUAT, was my host.
Grandchildren