| | |
Christopher M. Homan
List of publications from the DBLP Bibliography Server - FAQ
- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| 23 |      | 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. Artif. Intell. 187: 31-51 (2012) |
| 2010 | ||
| 22 | | Noah Stupak, Nicholas DiFonzo, Andrew J. Younge, Christopher Homan: SOCIALSENSE: Graphical user interface design considerations for social network experiment software. Computers in Human Behavior 26(3): 365-370 (2010) |
| 2009 | ||
| 21 | | 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 |
| 20 | | Christopher M. Homan, Lane A. Hemaspaandra: Guarantees for the success frequency of an algorithm for finding Dodgson-election winners. J. Heuristics 15(4): 403-423 (2009) |
| 2008 | ||
| 19 | | 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) |
| 18 | | Christopher M. Homan, Sven Kosub: Dichotomy Results for Fixed Point Counting in Boolean Dynamical Systems CoRR abs/0812.0283: (2008) |
| 2007 | ||
| 17 |  | Sven Kosub, Christopher M. Homan: Dichotomy Results for Fixed Point Counting in Boolean Dynamical Systems. ICTCS 2007: 163-174 |
| 16 | | Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub: Cluster computing and the power of edge recognition. Inf. Comput. 205(8): 1274-1293 (2007) |
| 15 | | 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 | ||
| 14 | | Christopher Homan, Andrew Pavlo, Jonathan Schull: Smoother Transitions Between Breadth-First-Spanning-Tree-Based Drawings. Graph Drawing 2006: 442-445 |
| 13 | | Christopher M. Homan, Lane A. Hemaspaandra: Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners. MFCS 2006: 528-539 |
| 12 | | Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub: Cluster Computing and the Power of Edge Recognition. TAMC 2006: 283-294 |
| 11 | | Melanie J. Agnew, Christopher M. Homan: Plane Decompositions as Tools for Approximation CoRR abs/cs/0602057: (2006) |
| 10 | | Andrew Pavlo, Christopher Homan, Jonathan Schull: A parent-centered radial layout algorithm for interactive graph visualization and animation CoRR abs/cs/0606007: (2006) |
| 2005 | ||
| 9 | | 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) |
| 8 | | Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub: Cluster Computing and the Power of Edge Recognition CoRR abs/cs/0509060: (2005) |
| 7 | | 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 | ||
| 6 | | 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 | ||
| 5 | | Christopher M. Homan, Mayur Thakur: One-way permutations and self-witnessing languages. J. Comput. Syst. Sci. 67(3): 608-622 (2003) |
| 2002 | ||
| 4 | | Christopher M. Homan, Mayur Thakur: One-Way Permutations and Self-Witnessing Languages. IFIP TCS 2002: 243-254 |
| 2000 | ||
| 3 | | Christopher M. Homan: Low Ambiguity in Strong, Total, Associative, One-Way Functions CoRR cs.CC/0010005: (2000) |
| 1999 | ||
| 2 | | 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) |
| 1 | | Alina Beygelzimer, Lane A. Hemaspaandra, Christopher M. Homan, Jörg Rothe: One-way functions in worst-case cryptography: algebraic and security properties are on the house. SIGACT News 30(4): 25-40 (1999) |
| 1 | Melanie J. Agnew | [11] |
| 2 | Alina Beygelzimer | [1] [2] |
| 3 | Ioannis Caragiannis | [21] [23] |
| 4 | Jason A. Covey | [19] [21] [23] |
| 5 | Nicholas DiFonzo | [22] |
| 6 | Michal Feldman | [21] [23] |
| 7 | Lane A. Hemaspaandra (Lane A. Hemachandra) | [1] [2] [7] [8] [9] [12] [13] [15] [16] [20] |
| 8 | Christos Kaklamanis | [21] [23] |
| 9 | Nikos Karanikolas | [21] [23] |
| 10 | Sven Kosub | [8] [9] [12] [15] [16] [17] [18] |
| 11 | Andrew Pavlo | [10] [14] |
| 12 | Ariel D. Procaccia | [21] [23] |
| 13 | Jeffrey S. Rosenschein | [21] [23] |
| 14 | Jörg Rothe | [1] [2] |
| 15 | Jonathan Schull | [10] [14] |
| 16 | Noah Stupak | [22] |
| 17 | Mayur Thakur | [4] [5] |
| 18 | Klaus W. Wagner | [9] [15] |
| 19 | Andrew J. Younge | [22] |
Colors in the list of coauthors
Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page