3 papers
cs.DS2025
Generalized Flow in Nearly-linear Time on Moderately Dense Graphs
Shunhua Jiang, Michael Kapralov, Lawrence Li +1
In this paper we consider generalized flow problems where there is an -edge -node directed graph and each edge has a loss factor governing whe…
cs.DS2025
A Framework for Building Data Structures from Communication Protocols
Alexandr Andoni, Shunhua Jiang, Omri Weinstein
We present a general framework for designing efficient data structures for high-dimensional pattern-matching problems () through communication mode…
cs.DS2024
Hardness Amplification for Dynamic Binary Search Trees
Shunhua Jiang, Victor Lecomte, Omri Weinstein +1
We prove direct-sum theorems for Wilber's two lower bounds [Wilber, FOCS'86] on the cost of access sequences in the binary search tree (BST) model. These bounds are central to the…