| Algorithms for SAT based on search in Hamming balls E Dantsin, EA Hirsch, A Wolpert Annual Symposium on Theoretical Aspects of Computer Science, 141-151, 2004 | 37 | 2004 |
| MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in Time E Dantsin, A Wolpert International Conference on Theory and Applications of Satisfiability …, 2006 | 35 | 2006 |
| Population variance under interval uncertainty: a new algorithm E Dantsin, V Kreinovich, A Wolpert, G Xiang Reliable Computing 12 (4), 273-280, 2006 | 29 | 2006 |
| An improved upper bound for SAT E Dantsin, A Wolpert Theory and Applications of Satisfiability Testing: 8th International …, 2005 | 26 | 2005 |
| Derandomization of Schuler’s algorithm for SAT E Dantsin, A Wolpert International Conference on Theory and Applications of Satisfiability …, 2004 | 26 | 2004 |
| On moderately exponential time for SAT E Dantsin, A Wolpert International Conference on Theory and Applications of Satisfiability …, 2010 | 21 | 2010 |
| Clause shortening combined with pruning yields a new upper bound for deterministic SAT algorithms E Dantsin, EA Hirsch, A Wolpert Italian Conference on Algorithms and Complexity, 60-68, 2006 | 20 | 2006 |
| On quantum versions of record-breaking algorithms for SAT E Dantsin, V Kreinovich, A Wolpert ACM SIGACT News 36 (4), 103-108, 2005 | 19 | 2005 |
| A robust DNA computation model that captures PSPACE E Dantsin, A Wolpert International Journal of Foundations of Computer Science 14 (05), 933-951, 2003 | 11 | 2003 |
| Detecting outliers under interval uncertainty: a new algorithm based on constraint satisfaction E Dantsin, A Wolpert, M Ceberio, G Xiang, V Kreinovich | 9 | 2006 |
| A faster clause-shortening algorithm for SAT with no restriction on clause length E Dantsin, A Wolpert Journal on Satisfiability, Boolean Modeling and Computation 1 (1), 49-60, 2006 | 8 | 2006 |
| Exponential complexity of satisfiability testing for linear-size boolean formulas E Dantsin, A Wolpert Algorithms and Complexity: 8th International Conference, CIAC 2013 …, 2013 | 4 | 2013 |
| Solving constraint satisfaction problems with DNA computing E Dantsin, A Wolpert International Computing and Combinatorics Conference, 171-180, 2002 | 3 | 2002 |
| An AlphaZero-Inspired Approach to Solving Search Problems E Dantsin, V Kreinovich, A Wolpert Decision Making Under Uncertainty and Constraints: A Why-Book, 129-138, 2023 | 1 | 2023 |
| Reconstruction of Boolean Formulas in Conjunctive Normal Form E Dantsin, A Wolpert International Computing and Combinatorics Conference, 592-601, 2018 | 1 | 2018 |
| An Isomorphism-Invariant Distance Function on Propositional Formulas in CNF E Dantsin, A Wolpert Journal on Satisfiability, Boolean Modeling and Computation 14 (1), 1-15, 2023 | | 2023 |
| Similarity Between Points in Metric Measure Spaces E Dantsin, A Wolpert International Conference on Similarity Search and Applications, 177-184, 2020 | | 2020 |
| Quantum versions of k-CSP algorithms: a first step towards quantum algorithms for interval-related constraint satisfaction problems E Dantsin, A Wolpert, V Kreinovich Proceedings of the 2006 ACM symposium on Applied computing, 1640-1644, 2006 | | 2006 |
| Quantum Versions of k-CSP Algorithms: a First Step Towards Quantum Algorithms for Interval-Related Constraint Satisfaction Problems M Ceberio, V Kreinovich, E Dantsin, A Wolpert | | 2006 |
| Performance evaluation of an efficient routing protocol designed for a simple access network AS Bagur, AB Wolpert Roosevelt University, 2001 | | 2001 |
