Concepedia

Aaron Bernstein

AB

Statistics

Publications

22

Citations

815

H-Index

18

Active since

2008

Affiliations

Massachusetts Institute of Technology(Current)

Rutgers, The State University of New Jersey

Columbia University

University of Copenhagen

Technische Universität Berlin

Aaron Bernstein is an author at Massachusetts Institute of Technology specializing in computing, computer science, and algorithms.

Publications per year

2008–2022

22

Publications

22

A nearly optimal oracle for avoiding failed vertices and edges

Aaron Bernstein, David R. Karger · 2009 · 101 citations · Full text

, , +17

Fully dynamic (2 + ε) approximate all-pairs shortest paths with fast query and close to linear update time

Aaron Bernstein · 2009 · 79 citations · Full text

, , +17

Deterministic decremental single source shortest paths: beyond the o(mn) bound

Aaron Bernstein, Shiri Chechik · 2016 · 60 citations

, , +8

Improved dynamic algorithms for maintaining approximate shortest paths under deletions

Aaron Bernstein, Liam Roditty · 2011 · 56 citations

, , +15

Maintaining Shortest Paths Under Deletions in Weighted Directed Graphs

Aaron Bernstein · SIAM Journal on Computing · 2016 · 50 citations

, , +16

1–5 of 22