| 2025 | SISAP | Quantification of Similarities: Embeddings Into Euclidean Spaces and Taxonomies. | Evgeny Dantsin, Alexander Wolpert |
| 2020 | SISAP | Similarity Between Points in Metric Measure Spaces. | Evgeny Dantsin, Alexander Wolpert |
| 2018 | COCOON | Reconstruction of Boolean Formulas in Conjunctive Normal Form. | Evgeny Dantsin, Alexander Wolpert |
| 2013 | CIAC | Exponential Complexity of Satisfiability Testing for Linear-Size Boolean Formulas. | Evgeny Dantsin, Alexander Wolpert |
| 2011 | SAT | Satisfiability Certificates Verifiable in Subexponential Time. | Evgeny Dantsin, Edward A. Hirsch |
| 2010 | SAT | On Moderately Exponential Time for SAT. | Evgeny Dantsin, Alexander Wolpert |
| 2006 | CIAC | Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms. | Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert |
| 2006 | SAC | Quantum versions of k-CSP algorithms: a first step towards quantum algorithms for interval-related constraint satisfaction problems. | Evgeny Dantsin, Alexander Wolpert, Vladik Kreinovich |
| 2006 | SAT | MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in O(s | Evgeny Dantsin, Alexander Wolpert |
| 2005 | SAT | An Improved Upper Bound for SAT. | Evgeny Dantsin, Alexander Wolpert |
| 2004 | STACS | Algorithms for SAT Based on Search in Hamming Balls. | Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert |
| 2004 | SAT | Derandomization of Schuler's Algorithm for SAT. | Evgeny Dantsin, Alexander Wolpert |
| 2004 | SAT | Derandomization of Schuler's Algorithm for SAT. | Evgeny Dantsin, Alexander Wolpert |
| 2002 | COCOON | Solving Constraint Satisfaction Problems with DNA Computing. | Evgeny Dantsin, Alexander Wolpert |
| 2000 | ICALP | Deterministic Algorithms for | Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Uwe Schning |
| 2000 | PODS | Expressive Power and Data Complexity of Query Languages for Trees and Lists. | Evgeny Dantsin, Andrei Voronkov |
| 1999 | FOSSACS | A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees. | Evgeny Dantsin, Andrei Voronkov |
| 1997 | LFCS | Complexity of Query Answering in Logic Databases with Complex Values. | Evgeny Dantsin, Andrei Voronkov |
| 1991 | LPAR | Probabilistic Logic Programs and their Semantics. | Evgeny Dantsin |