Beyond NP: the QSAT phase transition
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Typical random 3-SAT formulae and the satisfiability threshold
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Rigorous results for random (2 + p)-SAT
Theoretical Computer Science - Phase transitions in combinatorial problems
Upper bounds on the satisfiability threshold
Theoretical Computer Science - Phase transitions in combinatorial problems
Stochastic Boolean Satisfiability
Journal of Automated Reasoning
The Probabilistic Analysis of a Greedy Satisfiability Algorithm
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
On good algorithms for determining unsatisfiability of propositional formulas
Discrete Applied Mathematics - The renesse issue on satisfiability
Randomization helps to perform independent tasks reliably
Random Structures & Algorithms
Centering Sequences with Bounded Differences
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
On the solution-space geometry of random constraint satisfaction problems
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The probabilistic analysis of a greedy satisfiability algorithm
Random Structures & Algorithms
Deterministic packet marking for time-varying congestion price estimation
IEEE/ACM Transactions on Networking (TON)
On threshold properties of k-SAT: an additive viewpoint
European Journal of Combinatorics - Special issue on Eurocomb'03 - graphs and combinatorial structures
The unsatisfiability threshold revisited
Discrete Applied Mathematics
International Journal of Information and Computer Security
Atomic congestion games among coalitions
ACM Transactions on Algorithms (TALG)
The Effects of Local Randomness in the Adversarial Queueing Model
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
On the satisfiability threshold and clustering of solutions of random 3-SAT formulas
Theoretical Computer Science
The average-case complexity of counting distinct elements
Proceedings of the 12th International Conference on Database Theory
On the satisfiability threshold of formulas with three literals per clause
Theoretical Computer Science
Multiple Round Random Ball Placement: Power of Second Chance
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
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
Martingales on trees and the empire chromatic number of random trees
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Regular and general resolution: an improved separation
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Discrete Applied Mathematics
A Near-Optimal Separation of Regular and General Resolution
SIAM Journal on Computing
Satisfiability threshold of the skewed random k-SAT
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Fast computation by population protocols with a leader
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Non uniform selection of solutions for upper bounding the 3-SAT threshold
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Near-optimal radio use for wireless network synchronization
Theoretical Computer Science
Probabilistic techniques in algorithmic game theory
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
| Hi-index | 0.00 |