Travelled to:1 × France
1 × Switzerland
1 × The Netherlands
2 × Canada
2 × United Kingdom
3 × USA
Collaborated with:A.Wolpert A.Voronkov E.A.Hirsch V.Kreinovich A.Goerdt U.Schöning
Talks about:algorithm (6) sat (6) time (4) derandom (2) schuler (2) quantum (2) tree (2) nondeterminist (1) subexponenti (1) determinist (1)
Person: Evgeny Dantsin
DBLP: Dantsin:Evgeny
Contributed to:
20112010
20062006200520042005
2000
2000
1999Wrote 10 papers:
- SAT-2011-DantsinH #satisfiability
- Satisfiability Certificates Verifiable in Subexponential Time (ED, EAH), pp. 19–32.
- SAT-2010-DantsinW #exponential #on the #satisfiability
- On Moderately Exponential Time for SAT (ED, AW), pp. 313–325.
- SAC-2006-DantsinWK #algorithm #constraints #problem #quantum #towards
- Quantum versions of k-CSP algorithms: a first step towards quantum algorithms for interval-related constraint satisfaction problems (ED, AW, VK), pp. 1640–1644.
- SAT-2006-DantsinW #constant #performance #satisfiability
- MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in O(s2) Time (ED, AW), pp. 266–276.
- SAT-2005-DantsinW #bound #satisfiability
- An Improved Upper Bound for SAT (ED, AW), pp. 400–407.
- SAT-2004-DantsinW #algorithm #satisfiability
- Derandomization of Schuler’s Algorithm for SAT (ED, AW), pp. 69–75.
- SAT-J-2004-DantsinW05 #algorithm #satisfiability
- Derandomization of Schuler’s Algorithm for SAT (ED, AW), pp. 80–88.
- ICALP-2000-DantsinGHS #algorithm #satisfiability
- Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search (ED, AG, EAH, US), pp. 236–247.
- PODS-2000-DantsinV #complexity #query
- Expressive Power and Data Complexity of Query Languages for Trees and Lists (ED, AV), pp. 157–165.
- FoSSaCS-1999-DantsinV #algorithm #nondeterminism #polynomial #set #unification
- A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees (ED, AV), pp. 180–196.