The SCEAS System
| |||||||

## Search the dblp DataBase
Christopher M. Homan:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Christopher M. Homan, Mayur Thakur
**One-Way Permutations and Self-Witnessing Languages.**[Citation Graph (0, 0)][DBLP] IFIP TCS, 2002, pp:243-254 [Conf] - Christopher M. Homan, Lane A. Hemaspaandra
**Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners.**[Citation Graph (0, 0)][DBLP] MFCS, 2006, pp:528-539 [Conf] - Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub
**Cluster Computing and the Power of Edge Recognition.**[Citation Graph (0, 0)][DBLP] TAMC, 2006, pp:283-294 [Conf] - Christopher M. Homan
**Low Ambiguity in Strong, Total, Associative, One-Way Functions**[Citation Graph (0, 0)][DBLP] CoRR, 2000, v:0, n:, pp:- [Journal] - Alina Beygelzimer, Lane A. Hemaspaandra, Christopher M. Homan, Jörg Rothe
**One-Way Functions in Worst-Case Cryptography: Algebraic and Security Properties**[Citation Graph (0, 0)][DBLP] CoRR, 1999, v:0, n:, pp:- [Journal] - Christopher M. Homan
**Tight lower bounds on the ambiguity of strong, total, associative, one-way functions.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2004, v:68, n:3, pp:657-674 [Journal] - Christopher M. Homan, Mayur Thakur
**One-way permutations and self-witnessing languages.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2003, v:67, n:3, pp:608-622 [Journal] - Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub, Klaus W. Wagner
**The Complexity of Computing the Size of an Interval.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2007, v:36, n:5, pp:1264-1300 [Journal] - Melanie J. Agnew, Christopher M. Homan
**Plane Decompositions as Tools for Approximation**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] - Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub, Klaus W. Wagner
**The Complexity of Computing the Size of an Interval**[Citation Graph (0, 0)][DBLP] CoRR, 2005, v:0, n:, pp:- [Journal] - Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub
**Cluster computing and the power of edge recognition.**[Citation Graph (0, 0)][DBLP] Inf. Comput., 2007, v:205, n:8, pp:1274-1293 [Journal] **Dichotomy Results for Fixed Point Counting in Boolean Dynamical Systems.**[Citation Graph (, )][DBLP]**On the approximability of Dodgson and Young elections.**[Citation Graph (, )][DBLP]**Cluster Computing and the Power of Edge Recognition**[Citation Graph (, )][DBLP]**Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners**[Citation Graph (, )][DBLP]**Dichotomy Results for Fixed Point Counting in Boolean Dynamical Systems**[Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |