Get started
Author

Alexander Wolpert

Observed names: A. B. Wolpert, ALEXANDER WOLPERT, Er Wolpert, Wolpert, Alexander
ORCID: 0000-0002-1921-9403
Observed ORCID: 0000-0002-1921-9403
OpenAlex ID: A5089677759
Algorithms for SAT Based on Search in Hamming Balls
2004 · Evgeny Dantsin, Edward A. Hirsch, et al. · Lecture notes in computer science · 33
MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in $\mathcal{O}(2^n)$ Time
2006 · Evgeny Dantsin, Alexander Wolpert · Lecture notes in computer science · 29
Population Variance under Interval Uncertainty: A New Algorithm
2006 · Evgeny Dantsin, Vladik Kreinovich, et al. · Reliable Computing · 25
An Improved Upper Bound for SAT
2005 · Evgeny Dantsin, Alexander Wolpert · Lecture notes in computer science · 21
Derandomization of Schuler’s Algorithm for SAT
2005 · Evgeny Dantsin, Alexander Wolpert · Lecture notes in computer science · 20
On Moderately Exponential Time for SAT
2010 · Evgeny Dantsin, Alexander Wolpert · Lecture notes in computer science · 18
Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms
2006 · Evgeny Dantsin, Edward A. Hirsch, et al. · Lecture notes in computer science · 14
On quantum versions of record-breaking algorithms for SAT
2005 · Evgeny Dantsin, Vladik Kreinovich, et al. · ACM SIGACT News · 14
Detecting Outliers under Interval Uncertainty: A New Algorithm Based on Constraint Satisfaction
2006 · Evgeny Dantsin, Alexander Wolpert, et al. · scholarworks - UTEP (The University of Texas at El Paso) · 9
PDF
Unlocking the Past: The Potential of Large Language Models to Revolutionize Transcription of Natural History Collections
2025 · Riley Herbst, Daniel Stille, et al. · Data Intelligence · 6
PDF
A Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause Length
2005 · Evgeny Dantsin, Alexander Wolpert · Journal on Satisfiability Boolean Modeling and Computation · 6
PDF
A Robust Dna Computation Model That Captures Pspace
2003 · EVGENY DANTSIN, ALEXANDER WOLPERT · International Journal of Foundations of Computer Science · 6
An Improved Upper Bound for SAT
2005 · Evgeny Dantsin, Alexander Wolpert · 4
Exponential Complexity of Satisfiability Testing for Linear-Size Boolean Formulas
2013 · Evgeny Dantsin, Alexander Wolpert · Lecture notes in computer science · 3
An AlphaZero-Inspired Approach to Solving Search Problems
2023 · Evgeny Dantsin, Vladik Kreinovich, et al. · Studies in systems, decision and control · 2
PDF
Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms
2005 · Evgeny Dantsin, Edward Hirsch, et al. · 2
Derandomization of Schuler's Algorithm for SAT
2004 · Evgeny Dantsin, Alexander Wolpert · 2
Solving Constraint Satisfaction Problems with DNA Computing
2002 · Evgeny Dantsin, Alexander Wolpert · Lecture notes in computer science · 2
Similarity Between Points in Metric Measure Spaces
2020 · Dantsin, Evgeny, Wolpert, Alexander · arXiv (Cornell University) · 1
PDF
Similarity Between Points in Metric Measure Spaces
2020 · Evgeny Dantsin, Alexander Wolpert · Lecture notes in computer science · 1
Reconstruction of Boolean Formulas in Conjunctive Normal Form
2018 · Evgeny Dantsin, Alexander Wolpert · Lecture notes in computer science · 1
MAX-SAT for formulas with constant clause density can be solved faster than in O(2 n ) time
· Evgeny Dantsin, Er Wolpert · 1
Rethinking fine-grained classification with image retrieval
2026 · Alexander Wolpert, Heiko Karus, et al.
Comparative Study of Out-of-the-Box Technology for Automatic Target Detection and Recognition
2026 · Liezenga, Alma M., Nijskens, Lotte, et al. · arXiv (Cornell University)
PDF
Polynomial-Time Bounds for Shape-Based Novelty Detection
2026 · Evgeny Dantsin, Alexander Wolpert
Works count: 33
Citation count: 220
H-index: 9
I10-index: 8
Year
Topic
Type