Aaron Bernstein

1.1k total citations
32 papers, 321 citations indexed

About

Aaron Bernstein is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Aaron Bernstein has authored 32 papers receiving a total of 321 indexed citations (citations by other indexed papers that have themselves been cited), including 26 papers in Computational Theory and Mathematics, 21 papers in Computer Networks and Communications and 11 papers in Artificial Intelligence. Recurrent topics in Aaron Bernstein's work include Complexity and Algorithms in Graphs (25 papers), Optimization and Search Problems (15 papers) and Advanced Graph Theory Research (13 papers). Aaron Bernstein is often cited by papers focused on Complexity and Algorithms in Graphs (25 papers), Optimization and Search Problems (15 papers) and Advanced Graph Theory Research (13 papers). Aaron Bernstein collaborates with scholars based in United States, Denmark and Israel. Aaron Bernstein's co-authors include David R. Karger, Liam Roditty, Shiri Chechik, Clifford Stein, Christian Wulff‐Nilsen, Danupon Nanongkai, Sepehr Assadi, Maximilian Probst Gutenberg, Monika Henzinger and Jacob Holm and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and Theory of Computing Systems.

In The Last Decade

Aaron Bernstein

30 papers receiving 310 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Aaron Bernstein United States	12	256	230	95	39	18	32	321
K. Subramani United States	8	143 0.6×	95 0.4×	99 1.0×	24 0.6×	12 0.7×	65	217
Sanjeev Saluja India	7	73 0.3×	55 0.2×	66 0.7×	60 1.5×	18 1.0×	11	171
Sundar Vishwanathan India	10	186 0.7×	156 0.7×	38 0.4×	6 0.2×	7 0.4×	30	282
Peiyi Tang United States	10	59 0.2×	257 1.1×	71 0.7×	30 0.8×	8 0.4×	43	358
Jonathan M. D. Hill United Kingdom	7	37 0.1×	330 1.4×	70 0.7×	14 0.4×	27 1.5×	16	391
Ross Tate United States	10	113 0.4×	56 0.2×	226 2.4×	24 0.6×	12 0.7×	27	305
Jordi Levy Spain	13	234 0.9×	156 0.7×	283 3.0×	8 0.2×	5 0.3×	43	387
Piotr Dembiński Poland	7	166 0.6×	93 0.4×	140 1.5×	12 0.3×	6 0.3×	20	305
Lal George United States	7	68 0.3×	157 0.7×	125 1.3×	10 0.3×	5 0.3×	11	340
Ching‐Chi Lin Taiwan	8	33 0.1×	217 0.9×	24 0.3×	7 0.2×	18 1.0×	27	277

Countries citing papers authored by Aaron Bernstein

Since Specialization

Citations

This map shows the geographic impact of Aaron Bernstein'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 Aaron Bernstein with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Aaron Bernstein more than expected).

Fields of papers citing papers by Aaron Bernstein

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Aaron Bernstein. 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 Aaron Bernstein. The network helps show where Aaron Bernstein may publish in the future.

Co-authorship network of co-authors of Aaron Bernstein

This figure shows the co-authorship network connecting the top 25 collaborators of Aaron Bernstein. A scholar is included among the top collaborators of Aaron Bernstein 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 Aaron Bernstein. Aaron Bernstein is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Bernstein, Aaron. (2023). Improved Bounds for Matching in Random-Order Streams. Theory of Computing Systems. 68(4). 758–772. 1 indexed citations

Bernstein, Aaron, Jan van den Brand, Maximilian Probst Gutenberg, et al.. (2022). Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

Burnaev, Evgeny, et al.. (2022). Fundamental Research and Developments in the Field of Applied Artificial Intelligence. Doklady Mathematics. 106(S1). S14–S22. 2 indexed citations

Bernstein, Aaron, Maximilian Probst Gutenberg, & Christian Wulff‐Nilsen. (2021). Decremental Strongly Connected Components and Single-Source Reachability in Near-Linear Time. SIAM Journal on Computing. 52(2). STOC19–128. 1 indexed citations

Bernstein, Aaron, et al.. (2021). A framework for dynamic matching in weighted graphs. 668–681. 10 indexed citations

Bernstein, Aaron & Danupon Nanongkai. (2021). Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time. SIAM Journal on Computing. 52(2). STOC19–112.

Bernstein, Aaron, et al.. (2021). Incremental SCC Maintenance in Sparse Graphs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 3 indexed citations

Bernstein, Aaron, et al.. (2021). A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching. ACM Transactions on Algorithms. 17(4). 1–51. 3 indexed citations

Assadi, Sepehr, et al.. (2020). Improved Bounds for Distributed Load Balancing. arXiv (Cornell University). 1 indexed citations

10.

Bernstein, Aaron. (2020). Improved Bounds for Matching in Random-Order Streams. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 4 indexed citations

11.

Bernstein, Aaron, et al.. (2019). A deamortization approach for dynamic spanner and dynamic maximal matching. arXiv (Cornell University). 1899–1918. 3 indexed citations

12.

Bernstein, Aaron, et al.. (2019). Online Bipartite Matching with Amortized O (log ² n ) Replacements. Journal of the ACM. 66(5). 1–23. 4 indexed citations

13.

Assadi, Sepehr & Aaron Bernstein. (2019). Towards a Unified Theory of Sparsification for Matching Problems. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 20. 5 indexed citations

14.

Bernstein, Aaron & Shiri Chechik. (2017). Deterministic partially dynamic single source shortest paths for sparse graphs. Symposium on Discrete Algorithms. 453–469. 10 indexed citations

15.

Bernstein, Aaron. (2017). Deterministic Partially Dynamic Single Source Shortest Paths in Weighted Graphs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 2 indexed citations

16.

Bernstein, Aaron. (2013). Maintaining shortest paths under deletions in weighted directed graphs. View. 725–734. 20 indexed citations

17.

Bernstein, Aaron. (2012). Near Linear Time (1 + ∊)-Approximation for Restricted Shortest Paths in Undirected Graphs. 189–201. 3 indexed citations

18.

Bernstein, Aaron & Liam Roditty. (2011). Improved dynamic algorithms for maintaining approximate shortest paths under deletions. Symposium on Discrete Algorithms. 1355–1365. 18 indexed citations

19.

Bernstein, Aaron. (2010). A nearly optimal algorithm for approximating replacement paths and k shortest simple paths in general graphs. Symposium on Discrete Algorithms. 742–755. 22 indexed citations

20.

Bernstein, Aaron & David R. Karger. (2008). Improved distance sensitivity oracles via random sampling. Symposium on Discrete Algorithms. 34–43. 18 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