Andrej Bogdanov
About
In The Last Decade
Andrej Bogdanov
34 papers receiving 421 citations
Peers
Comparison fields: 5 of 44
- Computational Theory and Mathematics 255
- Artificial Intelligence 238
- Computer Networks and Communications 199
- Electrical and Electronic Engineering 123
- Discrete Mathematics and Combinatorics 23
Countries citing papers authored by Andrej Bogdanov
This map shows the geographic impact of Andrej Bogdanov'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 Andrej Bogdanov with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Andrej Bogdanov more than expected).
Fields of papers citing papers by Andrej Bogdanov
This network shows the impact of papers produced by Andrej Bogdanov. 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 Andrej Bogdanov. The network helps show where Andrej Bogdanov may publish in the future.
Co-authorship network of co-authors of Andrej Bogdanov
This figure shows the co-authorship network connecting the top 25 collaborators of Andrej Bogdanov. A scholar is included among the top collaborators of Andrej Bogdanov 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 Andrej Bogdanov. Andrej Bogdanov is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | On quantum versus classical query complexity. | 1 |
| 2 | 2 | |
| 3 | 15 | |
| 4 | 1 | |
| 5 | Bounded Indistinguishability and the Complexity of Recovering Secrets. | 1 |
| 6 | 4 | |
| 7 | 12 | |
| 8 | 2 | |
| 9 | On the depth complexity of homomorphic encryption schemes. | 1 |
| 10 | 17 | |
| 11 | A Dichotomy for Local Small-Bias Generators. | 1 |
| 12 | Hard Instances for Satisfiability and Quasi-one-way Functions | 2 |
| 13 | Pseudorandomness for Width 2 Branching Programs. | 4 |
| 14 | Average-Case Complexity — Addendum | 2 |
| 15 | 26 | |
| 16 | 57 | |
| 17 | 19 | |
| 18 | 7 | |
| 19 | 5 | |
| 20 | 117 |
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.