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