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

Algorithms for SAT based on search in Hamming balls - Evgeny Dantsin; Edward A. Hirsch; Alexander Wolpert (Electron. Colloquium Comput. Complex., 2003)

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 (Electron. Colloquium Comput. Complex., 2004)

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

Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms - Evgeny Dantsin; Edward A. Hirsch; Alexander Wolpert (Electron. Colloquium Comput. Complex., 2005)

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

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)

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

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

Lifetact: utilizing smartwatches as tactile heartbeat displays in video games. - Erik Pescara; Alexander Wolpert; Matthias Budde; Andrea Schankin; Michael Beigl (MUM, 2017)

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

Anchor-free Small-scale Multispectral Pedestrian Detection. - Alexander Wolpert; Michael Teutsch; M. Saquib Sarfraz; Rainer Stiefelhagen (BMVC, 2020)

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

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)

OSSA: Unsupervised One-Shot Style Adaptation. - Robin Gerster; Holger Caesar; Matthias Rapp; Alexander Wolpert; Michael Teutsch (ECCV Workshops (18), 2024)

Utilizing Grounded SAM for self-supervised frugal camouflaged human detection. - Matthias Pijarowski; Alexander Wolpert; Martin Heckmann; Michael Teutsch (CoRR, 2024)

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

Unlocking the Past: The Potential of Large Language Models to Revolutionize Transcription of Natural History Collections. - Riley Herbst; Daniel Stille; Gilbert F. Gwilliam; Matt Von Konrat; Thomas Campbell; Wyatt Gaswick; Felix Grewe; Kimberly Hansen; Francisco Iacobelli; Karen Jellema; Maria Lucia Kawasaki; Danny Kreider; et al. (Data Intell., 2025)