This map shows the geographic impact of Mark Bun'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 Mark Bun with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Mark Bun more than expected).
This network shows the impact of papers produced by Mark Bun. 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 Mark Bun. The network helps show where Mark Bun may publish in the future.
Co-authorship network of co-authors of Mark Bun
This figure shows the co-authorship network connecting the top 25 collaborators of Mark Bun.
A scholar is included among the top collaborators of Mark Bun 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 Mark Bun. Mark Bun is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Bun, Mark & Justin Thaler. (2021). . Theory of Computing. 17(1). 1–46.5 indexed citations
5.
Bun, Mark, et al.. (2021). Sign-rank Can Increase under Intersection. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 13(4). 1–17.
6.
Bun, Mark, Robin Kothari, & Justin Thaler. (2020). . Theory of Computing. 16(1). 1–71.6 indexed citations
Wood, Alexandra, Micah Altman, Mark Bun, et al.. (2018). Differential Privacy: A Primer for a Non-Technical Audience. Digital Access to Scholarship at Harvard (DASH) (Harvard University). 21(1). 209.13 indexed citations
11.
Nissim, Kobbi, Alexandra Wood, Mark Bun, et al.. (2018). Bridging the Gap between Computer Science and Legal Approaches to Privacy. Digital Access to Scholarship at Harvard (DASH) (Harvard University). 31(2). 687.24 indexed citations
Bun, Mark, et al.. (2017). Differentially Private Submodular Maximization: Data Summarization in Disguise.. International Conference on Machine Learning. 70. 2478–2487.5 indexed citations
Bun, Mark & Justin Thaler. (2016). . Theory of Computing. 12(1). 1–34.1 indexed citations
18.
Bun, Mark & Justin Thaler. (2016). Approximate Degree and the Complexity of Depth Three Circuits.. Electronic colloquium on computational complexity. 23. 121.2 indexed citations
19.
Bun, Mark & Justin Thaler. (2016). Improved Bounds on the Sign-Rank of AC^0. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 55. 14.8 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.