- An O(n log n) randomized algorithm for the repeated median lineestimator1998 | Faculty of Mathematics and Physics
- A note on Parallel Randomized Algorithm for Searching Problems1995 | Publication without faculty affiliation
- Approximation Algorithms and Lower Bounds for Graph Burning2023 | Faculty of Mathematics and Physics
- Approximating Edit Distance Within Constant Factor in Truly Sub-Quadratic Time2018 | Faculty of Mathematics and Physics
- Approximating Edit Distance Within Constant Factor in Truly Sub-quadratic Time2020 | Faculty of Mathematics and Physics
- Derandomization in computational geometry2000 | Faculty of Mathematics and Physics
- Pseudodeterministic Constructions in Subexponential Time2017 | Faculty of Mathematics and Physics
- Violator spaces: structure and algorithms +22006 | Faculty of Mathematics and Physics
- Constant factor approximations to edit distance on far input pairs in nearly linear time2020 | Faculty of Mathematics and Physics
- On range searching with semialgebraic sets II +12012 | Faculty of Mathematics and Physics
- Simple, deterministic, fast (but weak) approximations to edit distance and Dyck edit distance2023 | Faculty of Mathematics and Physics
- Online Knapsack Revisited2016 | Faculty of Mathematics and Physics
- Induced odd cycle packing number, independent sets, and chromatic number2023 | Faculty of Mathematics and Physics
- Relative error streaming quantiles2021 | Faculty of Mathematics and Physics
- Deterministic Constrained Multilinear Detection2023 | Faculty of Mathematics and Physics
- Online packet scheduling with bounded delay and lookahead2019 | Faculty of Mathematics and Physics
- HARDNESS OF CONTINUOUS LOCAL SEARCH: QUERY COMPLEXITY AND CRYPTOGRAPHIC LOWER BOUNDS2020 | Faculty of Mathematics and Physics