Evgeny Dantsin
- Artificial Intelligence top 2%
- Computer Networks and Communications top 5%
- Computational Theory and Mathematics top 2%
- Information Systems top 10%
- Signal Processing top 10%
- Co-authors
- Андрей ВоронковThomas EiterGeorg GottlobEdward HirschPrabhakar RaghavanUwe SchöningJon KleinbergChristos H. Papadimitriou
- Topics
- Logic, Reasoning, and Knowledge (7 papers)Complexity and Algorithms in Graphs (6 papers)Algorithms and Data Compression (5 papers)
- Cited by
- Artificial IntelligenceComputational Theory and MathematicsComputer Networks and Communications
- Partner nations
- United StatesUnited KingdomRussia
In The Last Decade
Evgeny Dantsin
20 papers receiving 576 citations
Peers
Comparison fields: 5 of 35
- Artificial Intelligence 505
- Computer Networks and Communications 249
- Computational Theory and Mathematics 219
- Information Systems 57
- Signal Processing 49
Countries citing papers authored by Evgeny Dantsin
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
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
| # | Work | Indexed citations |
|---|---|---|
| 1 | Detecting Outliers under Interval Uncertainty: A New Algorithm Based on Constraint Satisfaction | 4 |
| 2 | 10 | |
| 3 | An Improved Upper Bound for SAT | 3 |
| 4 | Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms | 1 |
| 5 | 4 | |
| 6 | 2 | |
| 7 | Derandomization of Schuler's Algorithm for SAT | 1 |
| 8 | 3 | |
| 9 | 78 | |
| 10 | 74 | |
| 11 | Algorithms for SAT and Upper Bounds on Their Complexity | 11 |
| 12 | 16 | |
| 13 | 385 | |
| 14 | Expressive Power and Data Complexity of Query Languages for Trees and Lists | 8 |
| 15 | 8 | |
| 16 | APPROXIMATION ALGORITHMS FOR MAX SAT: A BETTER PERFORMANCE RATIO AT THE COST OF A LONGER RUNNING TIME | 7 |
| 17 | 0 | |
| 18 | 6 | |
| 19 | 13 | |
| 20 | 1 |
About Evgeny Dantsin
Evgeny Dantsin is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Graphics and Computer-Aided Design, having authored 21 papers that have together received 641 indexed citations. Recurring topics across this work include Logic, Reasoning, and Knowledge (7 papers), Complexity and Algorithms in Graphs (6 papers) and Algorithms and Data Compression (5 papers). The work is most often cited by research in Artificial Intelligence (505 citations), Computational Theory and Mathematics (219 citations) and Computer Networks and Communications (249 citations). Evgeny Dantsin has collaborated with scholars based in United States, United Kingdom and Russia. Frequent co-authors include Андрей Воронков, Thomas Eiter, Georg Gottlob, Edward Hirsch, Prabhakar Raghavan, Uwe Schöning, Jon Kleinberg, Christos H. Papadimitriou, Ravi Kannan and Andreas Goerdt. Their work appears in journals such as ACM Computing Surveys, Theoretical Computer Science and Lecture notes in computer science.
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.