×

zbMATH — the first resource for mathematics

Homan, Christopher M.

Compute Distance To:
Author ID: homan.christopher-m Recent zbMATH articles by "Homan, Christopher M."
Published as: Homan, Christopher M.
External Links: MGP
Documents Indexed: 10 Publications since 2003

Publications by Year

Citations contained in zbMATH Open

8 Publications have been cited 34 times in 28 Documents Cited by Year
Guarantees for the success frequency of an algorithm for finding Dodgson-election winners. Zbl 1188.91062
Homan, Christopher M.; Hemaspaandra, Lane A.
9
2009
The complexity of computing the size of an interval. Zbl 1123.68041
Hemaspaandra, Lane A.; Homan, Christopher M.; Kosub, Sven; Wagner, Klaus W.
7
2006
On the approximability of Dodgson and Young elections. Zbl 1251.91026
Caragiannis, Ioannis; Covey, Jason A.; Feldman, Michal; Homan, Christopher M.; Kaklamanis, Christos; Karanikolas, Nikos; Procaccia, Ariel D.; Rosenschein, Jeffrey S.
5
2012
Guarantees for the success frequency of an algorithm for finding Dodgson-election winners. Zbl 1132.91399
Homan, Christopher M.; Hemaspaandra, Lane A.
4
2006
One-way permutations and self-witnessing languages. Zbl 1114.68046
Homan, Christopher M.; Thakur, Mayur
4
2003
Tight lower bounds on the ambiguity of strong, total, associative, one-way functions. Zbl 1069.68052
Homan, Christopher M.
3
2004
Cluster computing and the power of edge recognition. Zbl 1121.68099
Hemaspaandra, Lane A.; Homan, Christopher M.; Kosub, Sven
1
2007
Dichotomy results for fixed point counting in Boolean dynamical systems. Zbl 1318.68089
Homan, Christopher M.; Kosub, Sven
1
2015
Dichotomy results for fixed point counting in Boolean dynamical systems. Zbl 1318.68089
Homan, Christopher M.; Kosub, Sven
1
2015
On the approximability of Dodgson and Young elections. Zbl 1251.91026
Caragiannis, Ioannis; Covey, Jason A.; Feldman, Michal; Homan, Christopher M.; Kaklamanis, Christos; Karanikolas, Nikos; Procaccia, Ariel D.; Rosenschein, Jeffrey S.
5
2012
Guarantees for the success frequency of an algorithm for finding Dodgson-election winners. Zbl 1188.91062
Homan, Christopher M.; Hemaspaandra, Lane A.
9
2009
Cluster computing and the power of edge recognition. Zbl 1121.68099
Hemaspaandra, Lane A.; Homan, Christopher M.; Kosub, Sven
1
2007
The complexity of computing the size of an interval. Zbl 1123.68041
Hemaspaandra, Lane A.; Homan, Christopher M.; Kosub, Sven; Wagner, Klaus W.
7
2006
Guarantees for the success frequency of an algorithm for finding Dodgson-election winners. Zbl 1132.91399
Homan, Christopher M.; Hemaspaandra, Lane A.
4
2006
Tight lower bounds on the ambiguity of strong, total, associative, one-way functions. Zbl 1069.68052
Homan, Christopher M.
3
2004
One-way permutations and self-witnessing languages. Zbl 1114.68046
Homan, Christopher M.; Thakur, Mayur
4
2003

Citations by Year