Sharp threshold and scaling window for the integer partitioning problem
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Statistical mechanics methods and phase transitions in optimizationproblems
Theoretical Computer Science - Phase transitions in combinatorial problems
Upper bounds on the satisfiability threshold
Theoretical Computer Science - Phase transitions in combinatorial problems
A note on random 2-SAT with prescribed literal degrees
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Some interesting research directions in satisfiability
Annals of Mathematics and Artificial Intelligence
On the critical exponents of random k-SAT
Random Structures & Algorithms
Random MAX SAT, random MAX CUT, and their phase transitions
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Some Notes on Random Satisfiability
SAGA '01 Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications
Generalized satisfiability problems: minimal elements and phase transitions
Theoretical Computer Science
A sharp threshold in proof complexity yields lower bounds for satisfiability search
Journal of Computer and System Sciences - STOC 2001
Recognizing frozen variables in constraint satisfaction problems
Theoretical Computer Science
Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
Combinatorics, Probability and Computing
Typical case complexity of satisfiability algorithms and the threshold phenomenon
Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
The probabilistic analysis of a greedy satisfiability algorithm
Random Structures & Algorithms
On threshold properties of k-SAT: an additive viewpoint
European Journal of Combinatorics - Special issue on Eurocomb'03 - graphs and combinatorial structures
Discrete Applied Mathematics
On an online random k-SAT model
Random Structures & Algorithms
Phase transition in a random NK landscape model
Artificial Intelligence
Computational complexity of auditing finite attributes in statistical databases
Journal of Computer and System Sciences
(1,2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Data reductions, fixed parameter tractability, and random weighted d-CNF satisfiability
Artificial Intelligence
A backbone-search heuristic for efficient solving of hard 3-SAT formulae
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Backbones in optimization and approximation
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Typical case complexity of Satisfiability Algorithms and the threshold phenomenon
Discrete Applied Mathematics
Random 2-XORSAT at the satisfiability threshold
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Proceedings of the forty-second ACM symposium on Theory of computing
On Computing Backbones of Propositional Theories
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
The scaling window for a random graph with a given degree sequence
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A tighter upper bound for random MAX 2-SAT
Information Processing Letters
Threshold behaviors of a random constraint satisfaction problem with exact phase transitions
Information Processing Letters
A backbone-based co-evolutionary heuristic for partial MAX-SAT
EA'05 Proceedings of the 7th international conference on Artificial Evolution
Limit theorems for random MAX-2-XORSAT
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Journal of the ACM (JACM)
| Hi-index | 0.01 |