| A framework for dynamic matching in weighted graphs A Bernstein, A Dudeja, Z Langley Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 30 | 2021 |
| Improved bounds for distributed load balancing S Assadi, A Bernstein, Z Langley 34rd International Symposium on Distributed Computing 179, 1:1–1:15, 2020 | 7 | 2020 |
| Minimum Planar Multi-sink Cuts with Connectivity Priors I Bezáková, Z Langley International Symposium on Mathematical Foundations of Computer Science, 94-105, 2014 | 3 | 2014 |
| Contiguous minimum single-source-multi-sink cuts in weighted planar graphs I Bezáková, Z Langley Computing and Combinatorics: 18th Annual International Conference, COCOON …, 2012 | 2 | 2012 |
| All-Norm Load Balancing in Graph Streams via the Multiplicative Weights Update Method S Assadi, A Bernstein, Z Langley arXiv preprint arXiv:2301.07007, 2023 | | 2023 |
Aaron BernsteinProfessor of Computer Science, Rutgers UniversityVerified email at rutgers.edu
