Christopher Homan

Christopher M. Homan

2009
19	EE	Ioannis Caragiannis, Jason A. Covey, Michal Feldman, Christopher M. Homan, Christos Kaklamanis, Nikos Karanikolas, Ariel D. Procaccia, Jeffrey S. Rosenschein: On the approximability of Dodgson and Young elections. SODA 2009: 1058-1067
2008
18	EE	Jason A. Covey, Christopher Homan: A $O(\log m)$, deterministic, polynomial-time computable approximation of Lewis Carroll's scoring rule CoRR abs/0804.1421: (2008)
17	EE	Christopher M. Homan, Sven Kosub: Dichotomy Results for Fixed Point Counting in Boolean Dynamical Systems CoRR abs/0812.0283: (2008)
2007
16		Sven Kosub, Christopher M. Homan: Dichotomy Results for Fixed Point Counting in Boolean Dynamical Systems. ICTCS 2007: 163-174
15	EE	Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub: Cluster computing and the power of edge recognition. Inf. Comput. 205(8): 1274-1293 (2007)
14	EE	Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub, Klaus W. Wagner: The Complexity of Computing the Size of an Interval. SIAM J. Comput. 36(5): 1264-1300 (2007)
2006
13	EE	Christopher Homan, Andrew Pavlo, Jonathan Schull: Smoother Transitions Between Breadth-First-Spanning-Tree-Based Drawings. Graph Drawing 2006: 442-445
12	EE	Christopher M. Homan, Lane A. Hemaspaandra: Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners. MFCS 2006: 528-539
11	EE	Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub: Cluster Computing and the Power of Edge Recognition. TAMC 2006: 283-294
10	EE	Melanie J. Agnew, Christopher M. Homan: Plane Decompositions as Tools for Approximation CoRR abs/cs/0602057: (2006)
9	EE	Andrew Pavlo, Christopher Homan, Jonathan Schull: A parent-centered radial layout algorithm for interactive graph visualization and animation CoRR abs/cs/0606007: (2006)
2005
8	EE	Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub, Klaus W. Wagner: The Complexity of Computing the Size of an Interval CoRR abs/cs/0502058: (2005)
7	EE	Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub: Cluster Computing and the Power of Edge Recognition CoRR abs/cs/0509060: (2005)
6	EE	Christopher M. Homan, Lane A. Hemaspaandra: Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners CoRR abs/cs/0509061: (2005)
2004
5	EE	Christopher M. Homan: Tight lower bounds on the ambiguity of strong, total, associative, one-way functions. J. Comput. Syst. Sci. 68(3): 657-674 (2004)
2003
4	EE	Christopher M. Homan, Mayur Thakur: One-way permutations and self-witnessing languages. J. Comput. Syst. Sci. 67(3): 608-622 (2003)
2002
3		Christopher M. Homan, Mayur Thakur: One-Way Permutations and Self-Witnessing Languages. IFIP TCS 2002: 243-254
2000
2	EE	Christopher M. Homan: Low Ambiguity in Strong, Total, Associative, One-Way Functions CoRR cs.CC/0010005: (2000)
1999
1	EE	Alina Beygelzimer, Lane A. Hemaspaandra, Christopher M. Homan, Jörg Rothe: One-Way Functions in Worst-Case Cryptography: Algebraic and Security Properties CoRR cs.CC/9911007: (1999)

Coauthor Index

1	Melanie J. Agnew	[10]
2	Alina Beygelzimer	[1]
3	Ioannis Caragiannis	[19]
4	Jason A. Covey	[18] [19]
5	Michal Feldman	[19]
6	Lane A. Hemaspaandra (Lane A. Hemachandra)	[1] [6] [7] [8] [11] [12] [14] [15]
7	Christos Kaklamanis	[19]
8	Nikos Karanikolas	[19]
9	Sven Kosub	[7] [8] [11] [14] [15] [16] [17]
10	Andrew Pavlo	[9] [13]
11	Ariel D. Procaccia	[19]
12	Jeffrey S. Rosenschein	[19]
13	Jörg Rothe	[1]
14	Jonathan Schull	[9] [13]
15	Mayur Thakur	[3] [4]
16	Klaus W. Wagner	[8] [14]

Colors in the list of coauthors