research
∙
06/30/2023
Breaking the Metric Voting Distortion Barrier
We consider the following well studied problem of metric distortion in s...
share
research
∙
10/18/2022
Faster Matrix Multiplication via Asymmetric Hashing
Fast matrix multiplication is one of the most fundamental problems in al...
research
∙
04/14/2022
(Fractional) Online Stochastic Matching via Fine-Grained Offline Statistics
Motivated by display advertising on the internet, the online stochastic ...
research
∙
11/20/2021
Oblivious Online Contention Resolution Schemes
Contention resolution schemes (CRSs) are powerful tools for obtaining "e...
research
∙
11/02/2021
Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions
We consider low-space algorithms for the classic Element Distinctness pr...
research
∙
08/24/2020
Fast and Simple Modular Subset Sum
We revisit the Subset Sum problem over the finite cyclic group ℤ_m for s...
research
∙
04/24/2019
Faster Algorithms for All Pairs Non-decreasing Paths Problem
In this paper, we present an improved algorithm for the All Pairs Non-de...
research
∙
08/31/2018
Single-Source Bottleneck Path Algorithm Faster than Sorting for Sparse Graphs
In a directed graph G=(V,E) with a capacity on every edge, a bottleneck ...
research
∙
07/30/2018
