Evgeny Dantsin
Evgeny Dantsin
Professor of Computer Science, Roosevelt University
Verified email at roosevelt.edu - Homepage
Title
Cited by
Cited by
Year
Complexity and expressive power of logic programming
E Dantsin, T Eiter, G Gottlob, A Voronkov
ACM Computing Surveys (CSUR) 33 (3), 374-425, 2001
9012001
A deterministic (2− 2/(k+ 1)) n algorithm for k-SAT based on local search
E Dantsin, A Goerdt, EA Hirsch, R Kannan, J Kleinberg, C Papadimitriou, ...
Theoretical Computer Science 289 (1), 69-83, 2002
2472002
Worst-Case Upper Bounds.
E Dantsin, EA Hirsch
Handbook of Satisfiability 185 (403-424), 9, 2009
652009
Deterministic algorithms for k-SAT based on covering codes and local search
E Dantsin, A Goerdt, EA Hirsch, U Schöning
International Colloquium on Automata, Languages, and Programming, 236-247, 2000
462000
Algorithms for SAT and upper bounds on their complexity
E Dantsin, E Hirsch, S Ivanov, M Vsemirnov
42*2001
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
322006
Population variance under interval uncertainty: a new algorithm
E Dantsin, V Kreinovich, A Wolpert, G Xiang
Reliable Computing 12 (4), 273-280, 2006
302006
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
292004
MAX SAT approximation beyond the limits of polynomial-time approximation
E Dantsin, M Gavrilovich, EA Hirsch, B Konev
Annals of Pure and Applied Logic 113 (1-3), 81-94, 2001
282001
Complexity of query answering in logic databases with complex values
E Dantsin, A Voronkov
International Symposium on Logical Foundations of Computer Science, 56-66, 1997
261997
Derandomization of Schuler’s algorithm for SAT
E Dantsin, A Wolpert
International Conference on Theory and Applications of Satisfiability …, 2004
242004
An improved upper bound for SAT
E Dantsin, A Wolpert
International Conference on Theory and Applications of Satisfiability …, 2005
232005
Approximation algorithms for Max SAT: A better performance ratio at the cost of a longer running time
E Dantsin, M Gavrilovich, EA Hirsch, B Konev
Submitted for publication, 1998
211998
Two propositional proof systems based on the splitting method
E Dantsin
Zapiski Nauchnykh Seminarov LOMI 105, 24-44, 1981
201981
Expressive power and data complexity of nonrecursive query languages for lists and trees
E Dantsin, A Voronkov
Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on …, 2000
172000
A nondeterministic polynomial-time unification algorithm for bags, sets and trees
E Dantsin, A Voronkov
International Conference on Foundations of Software Science and Computation …, 1999
171999
On moderately exponential time for SAT
E Dantsin, A Wolpert
International Conference on Theory and Applications of Satisfiability …, 2010
162010
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
162006
Theory and Applications of Satisfiability Testing
F Bacchus, T Walsh
Springer Berlin/Heidelberg., 2005
122005
A robust DNA computation model that captures PSPACE
E Dantsin, A Wolpert
International Journal of Foundations of Computer Science 14 (05), 933-951, 2003
102003
The system can't perform the operation now. Try again later.
Articles 1–20