vix.ing · top · new · best · stats · spec

Bernstein, Aaron

  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. Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary
    2020/04/17 by Bernstein, Aaron, Brand, Jan van den, Gutenberg, Maximilian Probst +4 · 6 citations
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  3. Deterministic Decremental SSSP and Approximate Min-Cost Flow in\n Almost-Linear Time
    2021/01/18 by Aaron Bernstein, Bernstein, Aaron, Maximilian Probst Gutenberg +3 · 6 citations
    Computer Science · #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning and Algorithms #Privacy-Preserving Technologies in Data
  4. Online Bipartite Matching with Amortized O(log2 n) Replacements
    2017/07/19 by Aaron Bernstein, Jacob Holm, Bernstein, Aaron +3 · 3 citations
    Computer Science · #Optimization and Search Problems #Cryptography and Data Security #Caching and Content Delivery
  5. Deterministic Decremental Reachability, SCC, and Shortest Paths via\n Directed Expanders and Congestion Balancing
    2020/09/05 by Aaron Bernstein, Bernstein, Aaron, Maximilian Probst Gutenberg +3 · 5 citations
    Computer Science · #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #Distributed systems and fault tolerance #FOS: Computer and information sciences #Optimization and Search Problems
  6. Fully Dynamic Matching in Bipartite Graphs
    2015/06/23 by Aaron Bernstein, Bernstein, Aaron, Clifford Stein +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
  7. Maximum Flow by Augmenting Paths in n2+o(1) Time
    2024/06/05 by Aaron Bernstein, Joakim Blikstad, Bernstein, Aaron +5 · 1 voice · 5 citations
    Engineering · #Traffic Prediction and Management Techniques #Smart Parking Systems Research #Urban Transport Systems Analysis
  8. Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs
    2017/11/08 by Sepehr Assadi, MohammadHossein Bateni, Assadi, Sepehr +7 · 2 citations
    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)
  9. Towards a Unified Theory of Sparsification for Matching Problems
    2018/11/05 by Assadi, Sepehr, Bernstein, Aaron · 2 citations
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  10. Improved Bound for Matching in Random-Order Streams
    2020/05/01 by Bernstein, Aaron · 2 citations
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  11. Near-Optimal Decremental SSSP in Dense Weighted Digraphs
    2020/04/09 by Bernstein, Aaron, Gutenberg, Maximilian Probst, Wulff-Nilsen, Christian · 2 citations
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  12. Closing the Gap Between Directed Hopsets and Shortcut Sets
    2022/07/10 by Aaron Bernstein, Nicole Wein, Bernstein, Aaron +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
  13. 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
  14. Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time
    2018/11/08 by Bernstein, Aaron, Nanongkai, Danupon · 1 citation
    #C.2.4 #Data Structures and Algorithms (cs.DS) #Distributed #F.2.0 #FOS: Computer and information sciences #G.2.2 #Parallel #and Cluster Computing (cs.DC)
  15. Improved Bounds for Distributed Load Balancing
    2020/08/10 by Assadi, Sepehr, Bernstein, Aaron, Langley, Zachary · 1 citation
    #Data Structures and Algorithms (cs.DS) #Distributed #FOS: Computer and information sciences #Parallel #and Cluster Computing (cs.DC)
  16. General Bounds for Incremental Maximization
    2017/05/29 by Bernstein, Aaron, Disser, Yann, Groß, Martin · 1 citation
    #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Control (math.OC)
  17. 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
  18. Are there graphs whose shortest path structure requires large edge weights?
    2023/08/24 by Bernstein, Aaron, Bodwin, Greg, Wein, Nicole · 1 citation
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  19. Decremental Matching in General Graphs
    2022/07/03 by Sepehr Assadi, Assadi, Sepehr, Aaron Bernstein +3 · 1 citation
    Materials Science · Medicine · #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Nanocluster Synthesis and Applications #Pharmacological Effects and Toxicity Studies #Renal Transplantation Outcomes and Treatments
  20. Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights
    2023/03/01 by Ashvinkumar, Vikrant, Bernstein, Aaron, Cao, Nairen +5 · 1 citation
    #Data Structures and Algorithms (cs.DS) #Distributed #FOS: Computer and information sciences #Parallel #and Cluster Computing (cs.DC)
  21. Faster Approximation Algorithms for Restricted Shortest Paths in Directed Graphs
    2024/10/22 by Vikrant Ashvinkumar, Aaron Bernstein, Ashvinkumar, Vikrant +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