Aaron Bernstein

1. Negative-Weight Single-Source Shortest Paths in Near-linear Time
   2022/03/07 by Aaron Bernstein, Danupon Nanongkai, Bernstein, Aaron +4 · 2 voices · 17 citations
   Computer Science · #Complexity and Algorithms in Graphs #Computational Geometry and Mesh Generation #Algorithms and Data Compression
2. Online Bipartite Matching with Amortized O(log² n) Replacements
   2017/07/19 by Aaron Bernstein, Bernstein, Aaron, Jacob Holm +3 · 3 citations
   Computer Science · #Optimization and Search Problems #Cryptography and Data Security #Caching and Content Delivery
3. Fully Dynamic Matching in Bipartite Graphs
   2015/06/23 by Aaron Bernstein, Clifford Stein, Bernstein, Aaron +1 · 3 citations
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Optimization and Search Problems
4. Maximum Flow by Augmenting Paths in n^2+o(1) Time
   2024/06/05 by Aaron Bernstein, Bernstein, Aaron, Joakim Blikstad +5 · 1 voice · 5 citations
   Engineering · #Traffic Prediction and Management Techniques #Smart Parking Systems Research #Urban Transport Systems Analysis
5. Closing the Gap Between Directed Hopsets and Shortcut Sets
   2022/07/10 by Aaron Bernstein, Bernstein, Aaron, Nicole Wein +1 · 2 citations
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Management and Algorithms #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
6. Deterministic Partially Dynamic Single Source Shortest Paths in Weighted Graphs
   2017/05/29 by Aaron Bernstein, Bernstein, Aaron · 1 citation
   Computer Science · #Complexity and Algorithms in Graphs #Cryptography and Data Security #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Privacy-Preserving Technologies in Data
7. Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs
   2017/11/08 by Sepehr Assadi, MohammadHossein Bateni, Assadi, Sepehr +7 · 1 citation
   Computer Science · #Caching and Content Delivery #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #Distributed #FOS: Computer and information sciences #Parallel #Stochastic Gradient Optimization Techniques #and Cluster Computing (cs.DC)
8. Decremental Strongly-Connected Components and Single-Source Reachability in Near-Linear Time
   2019/01/11 by Aaron Bernstein, Bernstein, Aaron, Probst, Maximilian +2 · 1 citation
   Biochemistry, Genetics and Molecular Biology · Computer Science · Materials Science · #Advanced biosensing and bioanalysis techniques #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Nanocluster Synthesis and Applications
9. Faster Approximation Algorithms for Restricted Shortest Paths in Directed Graphs
   2024/10/22 by Vikrant Ashvinkumar, Ashvinkumar, Vikrant, Aaron Bernstein +3 · 1 citation
   Computer Science · #Complexity and Algorithms in Graphs #Data Management and Algorithms #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Graph Theory and Algorithms