We prove the first polynomial separation between randomized and determin...
A dictionary data structure maintains a set of at most n keys from the
u...
In this work, we prove a Ω̃(^3/2 n ) unconditional lower
bound on the ma...
Network administrators want to detect TCP-level packet reordering to dia...
Naively storing a counter up to value n would require Ω(log n) bits
of m...
Graph sketching is a powerful paradigm for analyzing graph structure via...
In this paper, we prove a strong XOR lemma for bounded-round two-player
...
For a directed graph G with n vertices and a start vertex u_
start, we w...
Storing a counter incremented N times would naively consume O(log N)
bit...
Consider the following gap cycle counting problem in the streaming model...
In this paper, we study the distributed sketching complexity of connecti...
The membership problem asks to maintain a set S⊆[u], supporting
insertio...
Given an integer array A[1..n], the Range Minimum Query problem (RMQ) as...
In this paper, we present a new algorithm for maintaining linear sketche...
Given a set S of n (distinct) keys from key space [U], each associated
w...
Motivated by storage applications, we study the following data structure...
Given an n-bit array A, the succinct rank data structure problem asks to...
We show optimal lower bounds for spanning forest computation in two diff...
A Distance Labeling scheme is a data structure that can answer shortest...