Evgeny Dantsin

1.5k total citations
21 papers, 641 citations indexed

About

Evgeny Dantsin is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Evgeny Dantsin has authored 21 papers receiving a total of 641 indexed citations (citations by other indexed papers that have themselves been cited), including 15 papers in Computational Theory and Mathematics, 14 papers in Artificial Intelligence and 5 papers in Computer Networks and Communications. Recurrent topics in Evgeny Dantsin's work include Logic, Reasoning, and Knowledge (7 papers), Complexity and Algorithms in Graphs (6 papers) and Algorithms and Data Compression (5 papers). Evgeny Dantsin is often cited by papers focused on Logic, Reasoning, and Knowledge (7 papers), Complexity and Algorithms in Graphs (6 papers) and Algorithms and Data Compression (5 papers). Evgeny Dantsin collaborates with scholars based in United States, United Kingdom and Russia. Evgeny Dantsin's co-authors include Андрей Воронков, Thomas Eiter, Georg Gottlob, Edward Hirsch, Prabhakar Raghavan, Uwe Schöning, Jon Kleinberg, Christos H. Papadimitriou, Ravi Kannan and Andreas Goerdt and has published in prestigious journals such as ACM Computing Surveys, Theoretical Computer Science and Lecture notes in computer science.

In The Last Decade

Evgeny Dantsin

20 papers receiving 576 citations

Peers

Evgeny Dantsin
Gerald Pfeifer Austria
Marco Cadoli Italy
William F. Dowling United States
Luı́s Caires Portugal
Hans Tompits Austria
Ullrich Hustadt United Kingdom
Mukesh Dalal India
Terrance Swift United States
Rodney Topor Australia
Robert Schrag United States
Gerald Pfeifer Austria
Evgeny Dantsin
Citations per year, relative to Evgeny Dantsin Evgeny Dantsin (= 1×) peers Gerald Pfeifer

Countries citing papers authored by Evgeny Dantsin

Since Specialization
Citations

This map shows the geographic impact of Evgeny Dantsin's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Evgeny Dantsin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Evgeny Dantsin more than expected).

Fields of papers citing papers by Evgeny Dantsin

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Evgeny Dantsin. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Evgeny Dantsin. The network helps show where Evgeny Dantsin may publish in the future.

Co-authorship network of co-authors of Evgeny Dantsin

This figure shows the co-authorship network connecting the top 25 collaborators of Evgeny Dantsin. A scholar is included among the top collaborators of Evgeny Dantsin based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Evgeny Dantsin. Evgeny Dantsin is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Dantsin, Evgeny, et al.. (2006). Detecting Outliers under Interval Uncertainty: A New Algorithm Based on Constraint Satisfaction. scholarworks - UTEP (The University of Texas at El Paso). 4 indexed citations
2.
Dantsin, Evgeny, et al.. (2006). Population Variance under Interval Uncertainty: A New Algorithm. Reliable Computing. 12(4). 273–280. 10 indexed citations
3.
Dantsin, Evgeny, et al.. (2005). An Improved Upper Bound for SAT. Electronic colloquium on computational complexity. 3 indexed citations
4.
Dantsin, Evgeny, et al.. (2005). Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms. Electronic colloquium on computational complexity. 1 indexed citations
5.
Dantsin, Evgeny, et al.. (2005). A Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause Length. 1(1). 49–60. 4 indexed citations
6.
Dantsin, Evgeny, et al.. (2005). On quantum versions of record-breaking algorithms for SAT. ACM SIGACT News. 36(4). 103–108. 2 indexed citations
7.
Dantsin, Evgeny, et al.. (2004). Derandomization of Schuler's Algorithm for SAT. Electronic colloquium on computational complexity. 1 indexed citations
8.
Dantsin, Evgeny, et al.. (2003). A ROBUST DNA COMPUTATION MODEL THAT CAPTURES PSPACE. International Journal of Foundations of Computer Science. 14(5). 933–951. 3 indexed citations
9.
Dantsin, Evgeny, Andreas Goerdt, Edward Hirsch, et al.. (2002). A deterministic (2−2/(k+1))n algorithm for k-SAT based on local search. Theoretical Computer Science. 289(1). 69–83. 78 indexed citations
10.
Dantsin, Evgeny, Thomas Eiter, Georg Gottlob, & Андрей Воронков. (2002). Complexity and expressive power of logic programming. 82–101. 74 indexed citations
11.
Dantsin, Evgeny, et al.. (2001). Algorithms for SAT and Upper Bounds on Their Complexity. Electronic colloquium on computational complexity. 8. 11 indexed citations
12.
Dantsin, Evgeny, et al.. (2001). MAX SAT approximation beyond the limits of polynomial-time approximation. Annals of Pure and Applied Logic. 113(1-3). 81–94. 16 indexed citations
13.
Dantsin, Evgeny, Thomas Eiter, Georg Gottlob, & Андрей Воронков. (2001). Complexity and expressive power of logic programming. ACM Computing Surveys. 33(3). 374–425. 385 indexed citations
14.
Dantsin, Evgeny & Андрей Воронков. (2000). Expressive Power and Data Complexity of Query Languages for Trees and Lists. Research Explorer (The University of Manchester). 8 indexed citations
15.
Dantsin, Evgeny & Андрей Воронков. (2000). Expressive power and data complexity of nonrecursive query languages for lists and trees (extended abstract). 157–165. 8 indexed citations
16.
Dantsin, Evgeny, et al.. (1998). APPROXIMATION ALGORITHMS FOR MAX SAT: A BETTER PERFORMANCE RATIO AT THE COST OF A LONGER RUNNING TIME. 276(5318). 1482–4. 7 indexed citations
17.
Dantsin, Evgeny. (1997). Randomized proofs in arithmetic. Journal of Mathematical Sciences. 87(1). 3209–3220.
18.
Dantsin, Evgeny. (1992). Probabilistic logic programs and their semantics. Lecture notes in computer science. 152–164. 6 indexed citations
19.
Dantsin, Evgeny. (1983). Two systems for proving tautologies, based on the split method. Journal of Mathematical Sciences. 22(3). 1293–1305. 13 indexed citations
20.
Dantsin, Evgeny. (1980). On an approximative version of the notion of constructive analytic function. Journal of Mathematical Sciences. 14(5). 1457–1463. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Gerald Pfeifer Breakdown of academic impact, for papers by Marco Cadoli Breakdown of academic impact, for papers by William F. Dowling Breakdown of academic impact, for papers by Luı́s Caires Breakdown of academic impact, for papers by Hans Tompits Breakdown of academic impact, for papers by Ullrich Hustadt Breakdown of academic impact, for papers by Mukesh Dalal Breakdown of academic impact, for papers by Terrance Swift Breakdown of academic impact, for papers by Rodney Topor Breakdown of academic impact, for papers by Robert Schrag
Rankless by CCL
2026