Algorithms for Probabilistic Inference. - Evgeny Dantsin (Conference on Computer Logic, 1988)

Probabilistic Logic Programs and their Semantics. - Evgeny Dantsin (RCLP, 1991)

Complexity and Expressive Power of Logic Programming. - Evgeny Dantsin; Thomas Eiter; Georg Gottlob; Andrei Voronkov (CCC, 1997)

Complexity of Query Answering in Logic Databases with Complex Values. - Evgeny Dantsin; Andrei Voronkov (LFCS, 1997)

A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees. - Evgeny Dantsin; Andrei Voronkov (FoSSaCS, 1999)

Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search. - Evgeny Dantsin; Andreas Goerdt; Edward A. Hirsch; Uwe Schöning (ICALP, 2000)

Expressive Power and Data Complexity of Query Languages for Trees and Lists. - Evgeny Dantsin; Andrei Voronkov (PODS, 2000)

MAX SAT approximation beyond the limits of polynomial-time approximation. - Evgeny Dantsin; Michael Gavrilovich; Edward A. Hirsch; Boris Konev (Ann. Pure Appl. Log., 2001)

Algorithms for SAT and Upper Bounds on Their Complexity - Evgeny Dantsin; Edward A. Hirsch; Sergei Ivanov 001; Maxim Vsemirnov (Electron. Colloquium Comput. Complex., 2001)

Solving Constraint Satisfaction Problems with DNA Computing. - Evgeny Dantsin; Alexander Wolpert (COCOON, 2002)

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., 2002)

A Robust Dna Computation Model That Captures Pspace. - Evgeny Dantsin; Alexander Wolpert (Int. J. Found. Comput. Sci., 2003)

Derandomization of Schuler's Algorithm for SAT. - Evgeny Dantsin; Alexander Wolpert (SAT, 2004)

Algorithms for SAT Based on Search in Hamming Balls. - Evgeny Dantsin; Edward A. Hirsch; Alexander Wolpert (STACS, 2004)

An Improved Upper Bound for SAT. - Evgeny Dantsin; Alexander Wolpert (SAT, 2005)

On quantum versions of record-breaking algorithms for SAT. - Evgeny Dantsin; Vladik Kreinovich; Alexander Wolpert (SIGACT News, 2005)

Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms. - Evgeny Dantsin; Edward A. Hirsch; Alexander Wolpert (CIAC, 2006)

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)

MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in O(s2) Time. - Evgeny Dantsin; Alexander Wolpert (SAT, 2006)

A Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause Length. - Evgeny Dantsin; Alexander Wolpert (J. Satisf. Boolean Model. Comput., 2006)

Population Variance under Interval Uncertainty: A New Algorithm. - Evgeny Dantsin; Vladik Kreinovich; Alexander Wolpert; Gang Xiang (Reliab. Comput., 2006)

Worst-Case Upper Bounds. - Evgeny Dantsin; Edward A. Hirsch (Handbook of Satisfiability, 2009)

On Moderately Exponential Time for SAT. - Evgeny Dantsin; Alexander Wolpert (SAT, 2010)

Satisfiability Certificates Verifiable in Subexponential Time. - Evgeny Dantsin; Edward A. Hirsch (SAT, 2011)

Exponential Complexity of Satisfiability Testing for Linear-Size Boolean Formulas. - Evgeny Dantsin; Alexander Wolpert (CIAC, 2013)

Reconstruction of Boolean Formulas in Conjunctive Normal Form. - Evgeny Dantsin; Alexander Wolpert (COCOON, 2018)

Similarity Between Points in Metric Measure Spaces. - Evgeny Dantsin; Alexander Wolpert (SISAP, 2020)

Worst-Case Upper Bounds. - Evgeny Dantsin; Edward A. Hirsch (Handbook of Satisfiability, 2021)

An AlphaZero-Inspired Approach to Solving Search Problems. - Evgeny Dantsin; Vladik Kreinovich; Alexander Wolpert (CoRR, 2022)

An AlphaZero-Inspired Approach to Solving Search Problems. - Evgeny Dantsin; Vladik Kreinovich; Alexander Wolpert (Decision Making Under Uncertainty and Constraints, 2023)

An Isomorphism-Invariant Distance Function on Propositional Formulas in CNF. - Evgeny Dantsin; Alexander Wolpert (J. Satisf. Boolean Model. Comput., 2023)

Extensional Properties of Recurrent Neural Networks. - Evgeny Dantsin; Alexander Wolpert (CoRR, 2024)

Quantification of Similarities: Embeddings Into Euclidean Spaces and Taxonomies. - Evgeny Dantsin; Alexander Wolpert (SISAP, 2025)