
NearOptimal TwoPass Streaming Algorithm for Sampling Random Walks over Directed Graphs
For a directed graph G with n vertices and a start vertex u_ start, we w...
read it

On Distributed Differential Privacy and Counting Distinct Elements
We study the setup where each of n users holds an element from a discret...
read it

Beyond Natural Proofs: Hardness Magnification and Locality
Hardness magnification reduces major complexity separations (such as EXP...
read it

Broadcast Congested Clique: Planted Cliques and Pseudorandom Generators
We develop techniques to prove lower bounds for the BCAST(log n) Broadca...
read it

An Equivalence Class for Orthogonal Vectors
The Orthogonal Vectors problem (OV) asks: given n vectors in {0,1}^O( n)...
read it

Classical Algorithms from Quantum and ArthurMerlin Communication Protocols
The polynomial method from circuit complexity has been applied to severa...
read it

Toward SuperPolynomial Size Lower Bounds for DepthTwo Threshold Circuits
Proving superpolynomial size lower bounds for TC^0, the class of consta...
read it

Finegrained Complexity Meets IP = PSPACE
In this paper we study the finegrained complexity of finding exact and ...
read it

Nearly Optimal Separation Between Partially And Fully Retroactive Data Structures
Since the introduction of retroactive data structures at SODA 2004, a ma...
read it

On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner Product
In this paper we study the (Bichromatic) Maximum Inner Product Problem (...
read it

Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration
We study the combinatorial pure exploration problem BestSet in stochast...
read it

Nearly Instance Optimal Sample Complexity Bounds for Topk Arm Selection
In the BestkArm problem, we are given n stochastic bandit arms, each a...
read it

Towards Instance Optimal Bounds for Best Arm Identification
In the classical best arm identification (Best1Arm) problem, we are gi...
read it
Lijie Chen
is this you? claim profile