2 citations · 2 across the 1 of their papers we have counts for
2 papers
cs.DS2021★ 2 cited
Algorithms and Hardness for Multidimensional Range Updates and Queries
Joshua Lau, Angus Ritossa
Traditional orthogonal range problems allow queries over a static set of points, each with some value. Dynamic variants allow points to be added or removed, one at a time. To suppo…
cs.DS2018
Minimizing and Computing the Inverse Geodesic Length on Trees
Serge Gaspers, Joshua Lau
For any fixed measure that maps graphs to real numbers, the MinH problem is defined as follows: given a graph , an integer , and a target , is there a set of v…