Alan L. Selman
Affiliations: | 1977 | Mathematics | Florida State University, Tallahassee, FL, United States |
| 1977-1986 | Computer Science | Iowa State University, Ames, IA, United States | |
| 1986-1990 | Northeastern University, Boston, MA, United States | ||
| 1990-2014 | Computer Science and Engineering | State University of New York, Buffalo, Buffalo, NY, United States |
Area:
Computer ScienceWebsite:
https://cse.buffalo.edu/~selman/Google:
"Alan Louis Selman" OR "Alan L Selman"Bio:
(1941 - 2021)
https://www.cs.iastate.edu/dr-alan-l-selman-1941-2021
https://www.proquest.com/openview/c4862d2c01a56958c0ada8dbca518103/1
Parents
Sign in to add mentor| Paul Axt | grad student | 1970 | Penn State (MathTree) | |
| (Arithmetical Reducibilities and Sets of Formulas Valid in Finite Structures) | ||||
Children
Sign in to add trainee| Pavankumar R. Aduri | grad student | 2001 | SUNY Buffalo |
| Samik Sengupta | grad student | 2004 | SUNY Buffalo |
| Liyu Zhang | grad student | 2007 | SUNY Buffalo |
| Dung T. Nguyen | grad student | 2014 | SUNY Buffalo |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Nguyen D, Selman AL. (2016) Structural properties of nonautoreducible sets Acm Transactions On Computation Theory. 8 |
| Hughes A, Mandal D, Pavan A, et al. (2015) A thirty Year old conjecture about promise problems Computational Complexity |
| Nguyen DT, Selman AL. (2014) Non-autoreducible sets for NEXP Leibniz International Proceedings in Informatics, Lipics. 25: 590-601 |
| Glaßer C, Hughes A, Selman AL, et al. (2014) Disjoint NP-Pairs and Propositional Proof Systems Sigact News. 45: 59-75 |
| Glaßer C, Nguyen DT, Reitwießner C, et al. (2013) Autoreducibility of complete sets for log-space and polynomial-time reductions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7965: 473-484 |
| Glaßer C, Selman AL, Zhang L. (2009) The informational content of canonical disjoint np-pairs International Journal of Foundations of Computer Science. 20: 501-522 |
| Glaßer C, Selman AL, Travers S, et al. (2009) Non-mitotic sets Theoretical Computer Science. 410: 2011-2023 |
| Glaßer C, Selman AL, Travers S, et al. (2008) The complexity of unions of disjoint sets Journal of Computer and System Sciences. 74: 1173-1187 |
| Glaßer C, Pavan A, Selman AL, et al. (2007) Splitting np-complete sets* Siam Journal On Computing. 37: 1517-1535 |
| Glaßer C, Selman AL, Zhang L. (2007) Canonical disjoint NP-pairs of propositional proof systems Theoretical Computer Science. 370: 60-73 |