research
∙
12/06/2022
Higher Lower Bounds for Sparse Oblivious Subspace Embeddings
An oblivious subspace embedding (OSE), characterized by parameters m,n,d...
share
research
∙
12/21/2021
Lower Bounds for Sparse Oblivious Subspace Embeddings
An oblivious subspace embedding (OSE), characterized by parameters m,n,d...
research
∙
11/03/2021
Nearly Tight Lower Bounds for Succinct Range Minimum Query
Given an array of distinct integers A[1… n], the Range Minimum Query (RM...
research
∙
10/31/2021
On the Optimal Time/Space Tradeoff for Hash Tables
For nearly six decades, the central open question in the study of hash t...
research
∙
04/26/2020
Succinct Filters for Sets of Unknown Sizes
The membership problem asks to maintain a set S⊆[u], supporting insertio...
research
∙
04/13/2020