The complexity of logic-based abduction
Journal of the ACM (JACM)
Polynomial time approximation schemes for dense instances of NP-hard problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
SAT Local Search Algorithms: Worst-Case Study
Journal of Automated Reasoning
Convergence Properties of Optimization Algorithms for the SAT Problem
IEEE Transactions on Computers
A deterministic (2 - 2/(k+ 1))n algorithm for k-SAT based on local search
Theoretical Computer Science
A spectral technique for random satisfiable 3CNF formulas
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Parallelizing local search for CNF satisfiability using vectorization and PVM
Journal of Experimental Algorithmics (JEA)
The Complexity of Boolean Constraint Satisfaction Local Search Problems
Annals of Mathematics and Artificial Intelligence
UnitWalk: A New SAT Solver that Uses Local Search Guided by Unit Clause Elimination
Annals of Mathematics and Artificial Intelligence
Annals of Mathematics and Artificial Intelligence
Solving random satisfiable 3CNF formulas in expected polynomial time
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
An evolutionary computing approach to probabilistic reasoning on bayesian networks
Evolutionary Computation
Updating recursive XML views of relations
Journal of Computer Science and Technology
Detecting Motifs in a Large Data Set: Applying Probabilistic Insights to Motif Finding
BICoB '09 Proceedings of the 1st International Conference on Bioinformatics and Computational Biology
A Theoretical Analysis of Search in GSAT
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
An empirical analysis of search in GSAT
Journal of Artificial Intelligence Research
Backbone fragility and the local search cost peak
Journal of Artificial Intelligence Research
An empirical study of greedy local search for satisfiability testing
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
The very particular structure of the very hard instances
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Tuning local search for satisfiability testing
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Tight bounds on local search to approximate the maximum satisfiability problems
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
UAI'93 Proceedings of the Ninth international conference on Uncertainty in artificial intelligence
Algorithms for satisfiability using independent sets of variables
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Satisfiability threshold of the skewed random k-SAT
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Complete convergence of message passing algorithms for some satisfiability problems
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Pushing random walk beyond golden ratio
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
| Hi-index | 0.90 |