Christopher M. Homan

From MaRDI portal
Revision as of 09:25, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:596321

Available identifiers

zbMath Open homan.christopher-mMaRDI QIDQ596321

List of research outcomes





PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q46339202019-05-06Paper
Dichotomy results for fixed point counting in Boolean dynamical systems2015-02-24Paper
On the approximability of Dodgson and Young elections2012-11-15Paper
Guarantees for the success frequency of an algorithm for finding Dodgson-election winners2009-08-31Paper
The Complexity of Computing the Size of an Interval2007-10-22Paper
Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners2007-09-05Paper
Cluster computing and the power of edge recognition2007-08-23Paper
Theory and Applications of Models of Computation2007-04-30Paper
One-way permutations and self-witnessing languages2004-08-19Paper
Tight lower bounds on the ambiguity of strong, total, associative, one-way functions2004-08-10Paper

Research outcomes over time

This page was built for person: Christopher M. Homan

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:596321&oldid=7725309"
Powered by MediaWiki