Aaron Bernstein
Aaron Bernstein
Professor of Computer Science, Rutgers University
Verified email at rutgers.edu - Homepage
Title
Cited by
Cited by
Year
A nearly optimal oracle for avoiding failed vertices and edges
A Bernstein, D Karger
Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009
952009
Faster fully dynamic matchings with small approximation ratios
A Bernstein, C Stein
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
922016
Coresets meet EDCS: algorithms for matching and vertex cover on massive graphs
S Assadi, MH Bateni, A Bernstein, V Mirrokni, C Stein
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
792019
Maintaining shortest paths under deletions in weighted directed graphs
A Bernstein
SIAM Journal on Computing 45 (2), 548-574, 2016
722016
Fully dynamic (2+ ε) approximate all-pairs shortest paths with fast query and close to linear update time
A Bernstein
2009 50th Annual IEEE Symposium on Foundations of Computer Science, 693-702, 2009
702009
Fully dynamic matching in bipartite graphs
A Bernstein, C Stein
International Colloquium on Automata, Languages, and Programming, 167-179, 2015
692015
Improved dynamic algorithms for maintaining approximate shortest paths under deletions
A Bernstein, L Roditty
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011
632011
A nearly optimal algorithm for approximating replacement paths and k shortest simple paths in general graphs
A Bernstein
Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010
532010
Deterministic decremental single source shortest paths: beyond the o (mn) bound
A Bernstein, S Chechik
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
482016
A generative theory of similarity
C Kemp, A Bernstein, JB Tenenbaum
Proceedings of the 27th annual conference of the cognitive science society …, 2005
442005
Improved distance sensitivity oracles via random sampling
A Bernstein, D Karger
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete …, 2008
402008
A deamortization approach for dynamic spanner and dynamic maximal matching
A Bernstein, S Forster, M Henzinger
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
382019
Online Bipartite Matching with Amortized O(log 2 n) Replacements
A Bernstein, J Holm, E Rotenberg
Journal of the ACM (JACM) 66 (5), 1-23, 2019
372019
Deterministic partially dynamic single source shortest paths for sparse graphs
A Bernstein, S Chechik
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
302017
Towards a unified theory of sparsification for matching problems
S Assadi, A Bernstein
arXiv preprint arXiv:1811.02009, 2018
282018
Distributed exact weighted all-pairs shortest paths in near-linear time
A Bernstein, D Nanongkai
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
242019
Fully-dynamic graph sparsifiers against an adaptive adversary
A Bernstein, J Brand, MP Gutenberg, D Nanongkai, T Saranurak, ...
arXiv preprint arXiv:2004.08432, 2020
222020
Deterministic partially dynamic single source shortest paths in weighted graphs
A Bernstein
arXiv preprint arXiv:1705.10097, 2017
212017
Decremental strongly-connected components and single-source reachability in near-linear time
A Bernstein, M Probst, C Wulff-Nilsen
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
192019
Near Linear Time (1+∊)-Approximation for Restricted Shortest Paths in Undirected Graphs
A Bernstein
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete …, 2012
172012
The system can't perform the operation now. Try again later.
Articles 1–20