Allan Borodin
- Computer Networks and Communications top 0.2%
- Computational Theory and Mathematics top 0.1%
- Artificial Intelligence top 0.5%
- Management Science and Operations Research top 0.5%
- Electrical and Electronic Engineering top 10%
- Co-authors
- Ran El‐YanivJohn E. HopcroftIan MunroStephen CookNathan LinialPrabhakar RaghavanMichael SaksShalev Ben-David
- Topics
- Optimization and Search Problems (32 papers)Complexity and Algorithms in Graphs (23 papers)semigroups and automata theory (17 papers)
- Cited by
- Computational Theory and MathematicsComputer Networks and CommunicationsManagement Science and Operations Research
- Partner nations
- CanadaUnited StatesIsrael
In The Last Decade
Allan Borodin
104 papers receiving 4.7k citations
Hit Papers
Peers
Comparison fields: 5 of 109
- Computer Networks and Communications 2.9k
- Computational Theory and Mathematics 2.0k
- Artificial Intelligence 1.4k
- Management Science and Operations Research 833
- Electrical and Electronic Engineering 584
Countries citing papers authored by Allan Borodin
This map shows the geographic impact of Allan Borodin'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 Allan Borodin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Allan Borodin more than expected).
Fields of papers citing papers by Allan Borodin
This network shows the impact of papers produced by Allan Borodin. 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 Allan Borodin. The network helps show where Allan Borodin may publish in the future.
Co-authorship network of co-authors of Allan Borodin
This figure shows the co-authorship network connecting the top 25 collaborators of Allan Borodin. A scholar is included among the top collaborators of Allan Borodin 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 Allan Borodin. Allan Borodin is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 1 | |
| 3 | 11 | |
| 4 | 6 | |
| 5 | 10 | |
| 6 | 9 | |
| 7 | 10 | |
| 8 | 12 | |
| 9 | 9 | |
| 10 | Proceedings of the twenty-seventh annual ACM symposium on Theory of computing | 37 |
| 11 | Can competitive analysis be made competitive | 1 |
| 12 | On the Decidability of Sparse Univariate Polynomial Interpolation (Preliminary Version) | 2 |
| 13 | 12 | |
| 14 | 26 | |
| 15 | 85 | |
| 16 | 48 | |
| 17 | Resource Allocation with Immunity to Limited Process Failure (Preliminary Report) | 10 |
| 18 | THE COMPUTATIONAL COMPLEXITY OF ALGEBRAIC AND NUMERIC PROBLEMS. | 268 |
| 19 | 40 | |
| 20 | Complexity Classes of Recursive Functions and the Existence of Complexity Gaps | 26 |
About Allan Borodin
Allan Borodin is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Computer Networks and Communications, having authored 105 papers that have together received 5.2k indexed citations. Recurring topics across this work include Optimization and Search Problems (32 papers), Complexity and Algorithms in Graphs (23 papers) and semigroups and automata theory (17 papers). The work is most often cited by research in Computational Theory and Mathematics (2.0k citations), Computer Networks and Communications (2.9k citations) and Management Science and Operations Research (833 citations). Allan Borodin has collaborated with scholars based in Canada, United States and Israel. Frequent co-authors include Ran El‐Yaniv, John E. Hopcroft, Ian Munro, Stephen Cook, Nathan Linial, Prabhakar Raghavan, Michael Saks, Shalev Ben-David, Panayiotis Tsaparas and Jeffrey S. Rosenthal. Their work appears in journals such as Communications of the ACM, Journal of the ACM and Machine Learning.
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.