Evgeny Dantsin

40 papers A* 2A 7B 3C 2Misc 4Journal 16Unranked 3
YearRankTypeTitle / Venue / Authors
2025 B conf
Quantification of Similarities: Embeddings Into Euclidean Spaces and Taxonomies.
SISAP
Evgeny Dantsin, Alexander Wolpert
2024 J jnl
Extensional Properties of Recurrent Neural Networks.
CoRR
Evgeny Dantsin, Alexander Wolpert
2023 — ch.
An AlphaZero-Inspired Approach to Solving Search Problems.
Decision Making Under Uncertainty and Constraints
Evgeny Dantsin, Vladik Kreinovich, Alexander Wolpert
2023 J jnl
An Isomorphism-Invariant Distance Function on Propositional Formulas in CNF.
J. Satisf. Boolean Model. Comput.
Evgeny Dantsin, Alexander Wolpert
2022 J jnl
An AlphaZero-Inspired Approach to Solving Search Problems.
CoRR
Evgeny Dantsin, Vladik Kreinovich, Alexander Wolpert
2021 — ch.
Worst-Case Upper Bounds.
Handbook of Satisfiability
Evgeny Dantsin, Edward A. Hirsch
2020 B conf
Similarity Between Points in Metric Measure Spaces.
SISAP
Evgeny Dantsin, Alexander Wolpert
2020 J jnl
Similarity Between Points in Metric Measure Spaces.
CoRR
Evgeny Dantsin, Alexander Wolpert
2018 Misc conf
Reconstruction of Boolean Formulas in Conjunctive Normal Form.
COCOON
Evgeny Dantsin, Alexander Wolpert
2013 C conf
Exponential Complexity of Satisfiability Testing for Linear-Size Boolean Formulas.
CIAC
Evgeny Dantsin, Alexander Wolpert
2011 A conf
Satisfiability Certificates Verifiable in Subexponential Time.
SAT
Evgeny Dantsin, Edward A. Hirsch
2010 A conf
On Moderately Exponential Time for SAT.
SAT
Evgeny Dantsin, Alexander Wolpert
2009 — ch.
Worst-Case Upper Bounds.
Handbook of Satisfiability
Evgeny Dantsin, Edward A. Hirsch
2006 J jnl
A Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause Length.
J. Satisf. Boolean Model. Comput.
Evgeny Dantsin, Alexander Wolpert
2006 C conf
Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms.
CIAC
Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert
2006 A conf
MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in O(s
SAT
Evgeny Dantsin, Alexander Wolpert
2006 J jnl
Population Variance under Interval Uncertainty: A New Algorithm.
Reliab. Comput.
Evgeny Dantsin, Vladik Kreinovich, Alexander Wolpert, Gang Xiang
2006 Misc conf
Quantum versions of k-CSP algorithms: a first step towards quantum algorithms for interval-related constraint satisfaction problems.
SAC
Evgeny Dantsin, Alexander Wolpert, Vladik Kreinovich
2005 J jnl
An Improved Upper Bound for SAT
Electron. Colloquium Comput. Complex.
Evgeny Dantsin, Alexander Wolpert
2005 A conf
An Improved Upper Bound for SAT.
SAT
Evgeny Dantsin, Alexander Wolpert
2005 J jnl
Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms
Electron. Colloquium Comput. Complex.
Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert
2005 J jnl
On quantum versions of record-breaking algorithms for SAT.
SIGACT News
Evgeny Dantsin, Vladik Kreinovich, Alexander Wolpert
2004 A conf
Algorithms for SAT Based on Search in Hamming Balls.
STACS
Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert
2004 J jnl
Derandomization of Schuler's Algorithm for SAT
Electron. Colloquium Comput. Complex.
Evgeny Dantsin, Alexander Wolpert
2004 A conf
Derandomization of Schuler's Algorithm for SAT.
SAT
Evgeny Dantsin, Alexander Wolpert
2004 — conf
Derandomization of Schuler's Algorithm for SAT.
SAT (Selected Papers
Evgeny Dantsin, Alexander Wolpert
2003 J jnl
A Robust Dna Computation Model That Captures Pspace.
Int. J. Found. Comput. Sci.
Evgeny Dantsin, Alexander Wolpert
2003 J jnl
Algorithms for SAT based on search in Hamming balls
Electron. Colloquium Comput. Complex.
Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert
2002 J jnl
A deterministic (2-2/(k+1))
Theor. Comput. Sci.
Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Ravi Kannan, Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan, Uwe Schöning
2002 Misc conf
Solving Constraint Satisfaction Problems with DNA Computing.
COCOON
Evgeny Dantsin, Alexander Wolpert
2001 J jnl
Algorithms for SAT and Upper Bounds on Their Complexity
Electron. Colloquium Comput. Complex.
Evgeny Dantsin, Edward A. Hirsch, Sergei Ivanov, Maxim Vsemirnov
2001 J jnl
Complexity and expressive power of logic programming.
ACM Comput. Surv.
Evgeny Dantsin, Thomas Eiter, Georg Gottlob, Andrei Voronkov
2001 J jnl
MAX SAT approximation beyond the limits of polynomial-time approximation.
Ann. Pure Appl. Log.
Evgeny Dantsin, Michael Gavrilovich, Edward A. Hirsch, Boris Konev
2000 A* conf
Deterministic Algorithms for
ICALP
Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Uwe Schöning
2000 A* conf
Expressive Power and Data Complexity of Query Languages for Trees and Lists.
PODS
Evgeny Dantsin, Andrei Voronkov
1999 B conf
A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees.
FoSSaCS
Evgeny Dantsin, Andrei Voronkov
1997 A conf
Complexity and Expressive Power of Logic Programming.
CCC
Evgeny Dantsin, Thomas Eiter, Georg Gottlob, Andrei Voronkov
1997 Misc conf
Complexity of Query Answering in Logic Databases with Complex Values.
LFCS
Evgeny Dantsin, Andrei Voronkov
1991 — conf
Probabilistic Logic Programs and their Semantics.
RCLP
Evgeny Dantsin
1988 — conf
Algorithms for Probabilistic Inference.
Conference on Computer Logic
Evgeny Dantsin