Christopher M. Homan, Ph.D.

Affiliations: 
2003 University of Rochester, Rochester, NY 
Area:
Computer Science
Google:
"Christopher Homan"

Parents

Sign in to add mentor
Lane A. Hemaspaandra grad student 2003 Rochester
 (Redundancy: Eliminating it, exploiting it.)
BETA: Related publications

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.

Homan CM, Kosub S. (2015) Dichotomy results for fixed point counting in boolean dynamical systems Theoretical Computer Science. 573: 16-25
Caragiannis I, Covey JA, Feldman M, et al. (2009) On the approximability of dodgson and young elections Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1058-1067
Hemaspaandra LA, Homan CM, Kosub S. (2007) Cluster computing and the power of edge recognition Information and Computation. 205: 1274-1293
Hemaspaandra LA, Homan CM, Kosub S, et al. (2006) The complexity of computing the size of an interval Siam Journal On Computing. 36: 1264-1300
Homan CM, Hemaspaandra LA. (2006) Guarantees for the success frequency of an algorithm for finding dodgson-election winners Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4162: 528-539
Homan CM, Hemaspaandra LA. (2006) Guarantees for the success frequency of an algorithm for finding dodgson-election winners Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4162: 528-539
Homan CM. (2004) Tight lower bounds on the ambiguity of strong, total, associative, one-way functions Journal of Computer and System Sciences. 68: 657-674
Homan CM, Thakur M. (2002) One-way permutations and self-witnessing languages Ifip Advances in Information and Communication Technology. 96: 243-254
Homan CM, Thakur M. (2002) One-way permutations and self-witnessing languages Ifip Advances in Information and Communication Technology. 96: 243-254
Beygelzimer A, Hemaspaandra LA, Homan CM, et al. (1999) One-way functions in worst-case cryptography: algebraic and security properties are on the house Sigact News. 30: 25-40
See more...