| Complexity and expressive power of logic programming E Dantsin, T Eiter, G Gottlob, A Voronkov ACM Computing Surveys (CSUR) 33 (3), 374-425, 2001 | 977 | 2001 |
| A deterministic (2− 2/(k+ 1)) n algorithm for k-SAT based on local search E Dantsin, A Goerdt, EA Hirsch, R Kannan, J Kleinberg, C Papadimitriou, ... Theoretical Computer Science 289 (1), 69-83, 2002 | 275 | 2002 |
| Complexity and expressive power of logic programming E Dantsin, T Eiter, G Gottlob, A Voronkov Proceedings of Computational Complexity. Twelfth Annual IEEE Conference, 82-101, 1997 | 140 | 1997 |
| Worst-case upper bounds E Dantsin, EA Hirsch Handbook of Satisfiability, 403-424, 2009 | 75 | 2009 |
| Probabilistic logic programs and their semantics E Dantsin Logic Programming: First Russian Conference on Logic Programming Irkutsk …, 2005 | 65 | 2005 |
| Algorithms for SAT and upper bounds on their complexity E Dantsin, EA Hirsch, S Ivanov, M Vsemirnov Electronic Colloquium on Computational Complexity, Report, 2001 | 51* | 2001 |
| Deterministic algorithms for k-SAT based on covering codes and local search E Dantsin, A Goerdt, EA Hirsch, U Schöning International Colloquium on Automata, Languages, and Programming, 236-247, 2000 | 50 | 2000 |
| Algorithms for SAT based on search in Hamming balls E Dantsin, EA Hirsch, A Wolpert Annual Symposium on Theoretical Aspects of Computer Science, 141-151, 2004 | 38 | 2004 |
| MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in Time E Dantsin, A Wolpert International Conference on Theory and Applications of Satisfiability …, 2006 | 36 | 2006 |
| Population variance under interval uncertainty: a new algorithm E Dantsin, V Kreinovich, A Wolpert, G Xiang Reliable Computing 12 (4), 273-280, 2006 | 31 | 2006 |
| Complexity of query answering in logic databases with complex values E Dantsin, A Voronkov Logical Foundations of Computer Science: 4th International Symposium, LFCS …, 1997 | 31 | 1997 |
| MAX SAT approximation beyond the limits of polynomial-time approximation E Dantsin, M Gavrilovich, EA Hirsch, B Konev Annals of Pure and Applied Logic 113 (1-3), 81-94, 2001 | 28 | 2001 |
| An improved upper bound for SAT E Dantsin, A Wolpert Theory and Applications of Satisfiability Testing: 8th International …, 2005 | 26 | 2005 |
| Derandomization of Schuler’s algorithm for SAT E Dantsin, A Wolpert International Conference on Theory and Applications of Satisfiability …, 2004 | 25 | 2004 |
| Two propositional proof systems based on the splitting method E Dantsin Zapiski Nauchnykh Seminarov LOMI 105, 24-44, 1981 | 25* | 1981 |
| Approximation algorithms for Max SAT: A better performance ratio at the cost of a longer running time E Dantsin, M Gavrilovich, EA Hirsch, B Konev Submitted for publication, 1998 | 22 | 1998 |
| On moderately exponential time for SAT E Dantsin, A Wolpert International Conference on Theory and Applications of Satisfiability …, 2010 | 21 | 2010 |
| Clause shortening combined with pruning yields a new upper bound for deterministic SAT algorithms E Dantsin, EA Hirsch, A Wolpert Italian Conference on Algorithms and Complexity, 60-68, 2006 | 21 | 2006 |
| A nondeterministic polynomial-time unification algorithm for bags, sets and trees E Dantsin, A Voronkov International conference on foundations of software science and computation …, 1999 | 21 | 1999 |
| On quantum versions of record-breaking algorithms for SAT E Dantsin, V Kreinovich, A Wolpert ACM SIGACT News 36 (4), 103-108, 2005 | 19 | 2005 |
Edward A. HirschProfessor of Computer Science at Ariel UniversityVerified email at ariel.ac.il
