| 2011 |
|---|
| 27 | Satisfiability Certificates Verifiable in Subexponential Time. Evgeny Dantsin, Edward A. Hirsch. SAT 2011, 19-32. Web SearchBibTeXDownload |
| 2010 |
|---|
| 26 | On Moderately Exponential Time for SAT. Evgeny Dantsin, Alexander Wolpert. SAT 2010, 313-325. Web SearchBibTeXDownload |
| 2009 |
|---|
| 25 | Worst-Case Upper Bounds. Evgeny Dantsin, Edward A. Hirsch. Handbook of Satisfiability 2009, 403-424. Web SearchBibTeXDownload |
| 2006 |
|---|
| 24 | Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms. Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert. CIAC 2006, 60-68. Web SearchBibTeXDownload |
| 23 | A Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause Length. Evgeny Dantsin, Alexander Wolpert. JSAT (1): 49-60 (2006). Web SearchBibTeXDownload |
| 22 | Population Variance under Interval Uncertainty: A New Algorithm. Evgeny Dantsin, Vladik Kreinovich, Alexander Wolpert, Gang Xiang. Reliable Computing (12): 273-280 (2006). Web SearchBibTeXDownload |
| 21 | Quantum versions of k-CSP algorithms: a first step towards quantum algorithms for interval-related constraint satisfaction problems. Evgeny Dantsin, Alexander Wolpert, Vladik Kreinovich. SAC 2006, 1640-1644. Web SearchBibTeXDownload |
| 20 | MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in O(s2) Time. Evgeny Dantsin, Alexander Wolpert. SAT 2006, 266-276. Web SearchBibTeXDownload |
| 2005 |
|---|
| 19 | Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms. Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert. Electronic Colloquium on Computational Complexity (ECCC) 2005. Web SearchBibTeXDownload |
| 18 | An Improved Upper Bound for SAT. Evgeny Dantsin, Alexander Wolpert. SAT 2005, 400-407. Web SearchBibTeXDownload |
| 17 | On quantum versions of record-breaking algorithms for SAT. Evgeny Dantsin, Vladik Kreinovich, Alexander Wolpert. SIGACT News (36): 103-108 (2005). Web SearchBibTeXDownload |
| 2004 |
|---|
| 16 | Derandomization of Schuler's Algorithm for SAT. Evgeny Dantsin, Alexander Wolpert. SAT 2004. Web SearchBibTeXDownload |
| 15 | Algorithms for SAT Based on Search in Hamming Balls. Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert. STACS 2004, 141-151. Web SearchBibTeXDownload |
| 2003 |
|---|
| 14 | Algorithms for SAT based on search in Hamming balls. Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert. Electronic Colloquium on Computational Complexity (ECCC) 2003. Web SearchBibTeXDownload |
| 13 | A Robust Dna Computation Model That Captures Pspace. Evgeny Dantsin, Alexander Wolpert. Int. J. Found. Comput. Sci. (14): 933 (2003). Web SearchBibTeXDownload |
| 2002 |
|---|
| 12 | Solving Constraint Satisfaction Problems with DNA Computing. Evgeny Dantsin, Alexander Wolpert. COCOON 2002, 171-180. Web SearchBibTeXDownload |
| 11 | A deterministic (2-2/(k+1))n algorithm for k-SAT based on local search. Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Ravi Kannan, Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan, Uwe Schöning. Theor. Comput. Sci. (289): 69-83 (2002). Cited by 143Web SearchBibTeXDownload |
| 2001 |
|---|
| 10 | Complexity and expressive power of logic programming. Evgeny Dantsin, Thomas Eiter, Georg Gottlob, Andrei Voronkov. ACM Comput. Surv. (33): 374-425 (2001). Web SearchBibTeXDownload |
| 9 | MAX SAT approximation beyond the limits of polynomial-time approximation. Evgeny Dantsin, Michael Gavrilovich, Edward A. Hirsch, Boris Konev. Ann. Pure Appl. Logic (113): 81-94 (2001). Web SearchBibTeXDownload |
| 8 | Algorithms for SAT and Upper Bounds on Their Complexity. Evgeny Dantsin, Edward A. Hirsch, Sergei Ivanov, Maxim Vsemirnov. Electronic Colloquium on Computational Complexity (ECCC) (8) (2001). Web SearchBibTeXDownload |
| 2000 |
|---|
| 7 | Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search. Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Uwe Schöning. ICALP 2000, 236-247. Web SearchBibTeXDownload |
| 6 | Expressive Power and Data Complexity of Query Languages for Trees and Lists. Evgeny Dantsin, Andrei Voronkov. PODS 2000, 157-165. Web SearchBibTeX |
| 1999 |
|---|
| 5 | A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees. Evgeny Dantsin, Andrei Voronkov. FoSSaCS 1999, 180-196. Web SearchBibTeXDownload |
| 1997 |
|---|
| 4 | Complexity and Expressive Power of Logic Programming. Evgeny Dantsin, Thomas Eiter, Georg Gottlob, Andrei Voronkov. IEEE Conference on Computational Complexity 1997, 82-101. Web SearchBibTeXDownload |
| 3 | Complexity of Query Answering in Logic Databases with Complex Values. Evgeny Dantsin, Andrei Voronkov. LFCS 1997, 56-66. Web SearchBibTeXDownload |
| 1991 |
|---|
| 2 | Probabilistic Logic Programs and their Semantics. Evgeny Dantsin. RCLP 1991, 152-164. Web SearchBibTeXDownload |
| 1988 |
|---|
| 1 | Algorihtms for Probabilistic Inference. Evgeny Dantsin. Conference on Computer Logic 1988, 67-75. Web SearchBibTeXDownload |
