Projects per year
Fingerprint
Dive into the research topics where Aaron Bernstein is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 1 Similar Profiles
Collaborations and top research areas from the last five years
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
Projects
- 1 Finished
-
CAREER: Sublinear Graph Algorithms: New Insights for Foundational Problems
Bernstein, A. (PI)
1/15/20 → 1/31/25
Project: Research project
-
Faster Approximation Algorithms for Restricted Shortest Paths in Directed Graphs
Ashvinkumar, V., Bernstein, A. & Karczmarz, A., 2025, Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2025. Association for Computing Machinery, p. 5263-5277 15 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 8).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
-
Low Sensitivity Hopsets
Ashvinkumar, V., Bernstein, A., Deng, C., Gao, J. & Wein, N., Feb 11 2025, 16th Innovations in Theoretical Computer Science Conference, ITCS 2025. Meka, R. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 13. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 325).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
-
Matching Composition and Efficient Weight Reduction in Dynamic Matching
Bernstein, A., Chen, J., Dudeja, A., Langley, Z., Sidford, A. & Tu, T. W., 2025, Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2025. Association for Computing Machinery, p. 2991-3028 38 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 5).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
1 Scopus citations -
Negative-Weight Single-Source Shortest Paths in Near-Linear Time
Bernstein, A., Nanongkai, D. & Wulff-Nilsen, C., Feb 1 2025, In: Communications of the ACM. 68, 2, p. 87-94 8 p.Research output: Contribution to journal › Article › peer-review
Open Access -
Streaming and Communication Complexity of Load-Balancing via Matching Contractors
Assadi, S., Bernstein, A., Langley, Z., Lau, L. C. & Wang, R., 2025, Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2025. Association for Computing Machinery, p. 3423-3449 27 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 5).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution