A sharp threshold in proof complexity
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Models and thresholds for random constraint satisfaction problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Stochastic Boolean Satisfiability
Journal of Automated Reasoning
The interface between P and NP: COL, XOR, NAE, 1-in-k, and Horn SAT
Eighteenth national conference on Artificial intelligence
Almost all graphs with average degree 4 are 3-colorable
Journal of Computer and System Sciences - STOC 2002
A sharp threshold in proof complexity yields lower bounds for satisfiability search
Journal of Computer and System Sciences - STOC 2001
An analysis of phase transition in NK landscapes
Journal of Artificial Intelligence Research
Where are the really hard manipulation problems? the phase transition in manipulating the veto rule
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
An Empirical Study of the Manipulability of Single Transferable Voting
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Is computational complexity a barrier to manipulation?
Annals of Mathematics and Artificial Intelligence
Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs
Discrete Applied Mathematics
Where are the hard manipulation problems?
Journal of Artificial Intelligence Research
A smooth transition from powerlessness to absolute power
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |