We present a simple semi-streaming algorithm for (1-ϵ)-approximation
of ...
We continue the study of the communication complexity of gap cycle count...
Estimating quantiles, like the median or percentiles, is a fundamental t...
In the weighted load balancing problem, the input is an n-vertex biparti...
In recent years, there has been a growing interest in solving various gr...
We present a streaming algorithm for the vertex connectivity problem in
...
Graph sketching is a powerful paradigm for analyzing graph structure via...
We consider the problem of finding a maximal independent set (MIS) in th...
The h-index is a metric used to measure the impact of a user in a
public...
The monotone minimal perfect hash function (MMPHF) problem is the follow...
We present a new approach for finding matchings in dense graphs by build...
We consider the problem of maintaining an approximate maximum integral
m...
Multi-item optimal mechanisms are known to be extremely complex, often
o...
Every graph with maximum degree Δ can be colored with (Δ+1)
colors using...
We present an algorithm for the maximum matching problem in dynamic
(ins...
Recent breakthroughs in graph streaming have led to the design of single...
We prove a lower bound on the space complexity of two-pass semi-streamin...
In the (fully) dynamic set cover problem, we have a collection of m sets...
We study space-pass tradeoffs in graph streaming algorithms for paramete...
We study the maximum matching problem in the random-order semi-streaming...
We provide the first separation in the approximation guarantee achievabl...
We present a computationally-efficient truthful mechanism for combinator...
Consider the following gap cycle counting problem in the streaming model...
We prove that any two-pass graph streaming algorithm for the s-t
reachab...
In the load balancing problem, the input is an n-vertex bipartite graph ...
We study the problem of finding a spanning forest in an undirected,
n-ve...
A recent palette sparsification theorem of Assadi, Chen, and Khanna [SOD...
Maximal independent set (MIS), maximal matching (MM), and
(Δ+1)-coloring...
A longstanding open problem in Algorithmic Mechanism Design is to design...
Maximum weight matching is one of the most fundamental combinatorial
opt...
We present new lower bounds that show that a polynomial number of passes...
We study linear programming and general LP-type problems in several big ...
In the subgraph counting problem, we are given a input graph G(V, E) and...
We study a twist on the classic secretary problem, which we term the
sec...
In this paper, we present a construction of a `matching sparsifier', tha...
In the submodular cover problem, we are given a non-negative monotone
su...
Any graph with maximum degree Δ admits a proper vertex coloring with
Δ +...
The first fully dynamic algorithm for maintaining a maximal independent ...
A fundamental question that shrouds the emergence of massively parallel
...
A maximal independent set (MIS) can be maintained in an evolving m-edge
...
We study the maximum k-set coverage problem in the following distributed...
Randomized composable coresets were introduced recently as an effective
...