default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEvgeny Dantsin
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i8]Evgeny Dantsin, Alexander Wolpert:
Extensional Properties of Recurrent Neural Networks. CoRR abs/2410.22730 (2024)- 2023
- [j8]Evgeny Dantsin, Alexander Wolpert:
An Isomorphism-Invariant Distance Function on Propositional Formulas in CNF. J. Satisf. Boolean Model. Comput. 14(1): 1-15 (2023) - [p3]Evgeny Dantsin, Vladik Kreinovich, Alexander Wolpert:
An AlphaZero-Inspired Approach to Solving Search Problems. Decision Making Under Uncertainty and Constraints 2023: 129-138 - 2022
- [i7]Evgeny Dantsin, Vladik Kreinovich, Alexander Wolpert:
An AlphaZero-Inspired Approach to Solving Search Problems. CoRR abs/2207.00919 (2022) - 2021
- [p2]Evgeny Dantsin
, Edward A. Hirsch:
Worst-Case Upper Bounds. Handbook of Satisfiability 2021: 669-692 - 2020
- [c20]Evgeny Dantsin, Alexander Wolpert:
Similarity Between Points in Metric Measure Spaces. SISAP 2020: 177-184 - [i6]Evgeny Dantsin, Alexander Wolpert:
Similarity Between Points in Metric Measure Spaces. CoRR abs/2011.00616 (2020)
2010 – 2019
- 2018
- [c19]Evgeny Dantsin, Alexander Wolpert:
Reconstruction of Boolean Formulas in Conjunctive Normal Form. COCOON 2018: 592-601 - 2013
- [c18]Evgeny Dantsin, Alexander Wolpert:
Exponential Complexity of Satisfiability Testing for Linear-Size Boolean Formulas. CIAC 2013: 110-121 - 2011
- [c17]Evgeny Dantsin, Edward A. Hirsch:
Satisfiability Certificates Verifiable in Subexponential Time. SAT 2011: 19-32 - 2010
- [c16]Evgeny Dantsin, Alexander Wolpert:
On Moderately Exponential Time for SAT. SAT 2010: 313-325
2000 – 2009
- 2009
- [p1]Evgeny Dantsin, Edward A. Hirsch:
Worst-Case Upper Bounds. Handbook of Satisfiability 2009: 403-424 - 2006
- [j7]Evgeny Dantsin, Alexander Wolpert:
A Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause Length. J. Satisf. Boolean Model. Comput. 1(1): 49-60 (2006) - [j6]Evgeny Dantsin, Vladik Kreinovich, Alexander Wolpert, Gang Xiang:
Population Variance under Interval Uncertainty: A New Algorithm. Reliab. Comput. 12(4): 273-280 (2006) - [c15]Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert:
Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms. CIAC 2006: 60-68 - [c14]Evgeny Dantsin, Alexander Wolpert, Vladik Kreinovich:
Quantum versions of k-CSP algorithms: a first step towards quantum algorithms for interval-related constraint satisfaction problems. SAC 2006: 1640-1644 - [c13]Evgeny Dantsin, Alexander Wolpert:
MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in O(s2) Time. SAT 2006: 266-276 - 2005
- [j5]Evgeny Dantsin, Vladik Kreinovich, Alexander Wolpert:
On quantum versions of record-breaking algorithms for SAT. SIGACT News 36(4): 103-108 (2005) - [c12]Evgeny Dantsin, Alexander Wolpert:
An Improved Upper Bound for SAT. SAT 2005: 400-407 - [i5]Evgeny Dantsin, Alexander Wolpert:
An Improved Upper Bound for SAT. Electron. Colloquium Comput. Complex. TR05 (2005) - [i4]Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert:
Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [c11]Evgeny Dantsin, Alexander Wolpert:
Derandomization of Schuler's Algorithm for SAT. SAT 2004 - [c10]Evgeny Dantsin, Alexander Wolpert:
Derandomization of Schuler's Algorithm for SAT. SAT (Selected Papers 2004: 80-88 - [c9]Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert:
Algorithms for SAT Based on Search in Hamming Balls. STACS 2004: 141-151 - [i3]Evgeny Dantsin, Alexander Wolpert:
Derandomization of Schuler's Algorithm for SAT. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j4]Evgeny Dantsin, Alexander Wolpert:
A Robust Dna Computation Model That Captures Pspace. Int. J. Found. Comput. Sci. 14(5): 933- (2003) - [i2]Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert:
Algorithms for SAT based on search in Hamming balls. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [j3]Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Ravi Kannan, Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan, Uwe Schöning:
A deterministic (2-2/(k+1))n algorithm for k-SAT based on local search. Theor. Comput. Sci. 289(1): 69-83 (2002) - [c8]Evgeny Dantsin, Alexander Wolpert:
Solving Constraint Satisfaction Problems with DNA Computing. COCOON 2002: 171-180 - 2001
- [j2]Evgeny Dantsin, Michael Gavrilovich, Edward A. Hirsch, Boris Konev:
MAX SAT approximation beyond the limits of polynomial-time approximation. Ann. Pure Appl. Log. 113(1-3): 81-94 (2001) - [j1]Evgeny Dantsin, Thomas Eiter, Georg Gottlob, Andrei Voronkov:
Complexity and expressive power of logic programming. ACM Comput. Surv. 33(3): 374-425 (2001) - [i1]Evgeny Dantsin, Edward A. Hirsch, Sergei Ivanov, Maxim Vsemirnov:
Algorithms for SAT and Upper Bounds on Their Complexity. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [c7]Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Uwe Schöning:
Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search. ICALP 2000: 236-247 - [c6]Evgeny Dantsin, Andrei Voronkov:
Expressive Power and Data Complexity of Query Languages for Trees and Lists. PODS 2000: 157-165
1990 – 1999
- 1999
- [c5]Evgeny Dantsin, Andrei Voronkov:
A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees. FoSSaCS 1999: 180-196 - 1997
- [c4]Evgeny Dantsin, Thomas Eiter, Georg Gottlob, Andrei Voronkov:
Complexity and Expressive Power of Logic Programming. CCC 1997: 82-101 - [c3]Evgeny Dantsin, Andrei Voronkov:
Complexity of Query Answering in Logic Databases with Complex Values. LFCS 1997: 56-66 - 1991
- [c2]Evgeny Dantsin:
Probabilistic Logic Programs and their Semantics. RCLP 1991: 152-164
1980 – 1989
- 1988
- [c1]Evgeny Dantsin:
Algorithms for Probabilistic Inference. Conference on Computer Logic 1988: 67-75
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-01 00:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
