
Sparse Fourier Transform by traversing CooleyTukey FFT computation graphs
Computing the dominant Fourier coefficients of a vector is a common task...
read it

Noisy Boolean Hidden Matching with Applications
The Boolean Hidden Matching (BHM) problem, introduced in a seminal paper...
read it

Spectral Hypergraph Sparsifiers of Nearly Linear Size
Graph sparsification has been studied extensively over the past two deca...
read it

Space Lower Bounds for Approximating Maximum Matching in the Edge Arrival Model
The bipartite matching problem in the online and streaming settings has ...
read it

Spectral Clustering Oracles in Sublinear Time
Given a graph G that can be partitioned into k disjoint expanders with o...
read it

Kernel Density Estimation through Density Constrained Near Neighbor Search
In this paper we revisit the kernel density estimation problem: given a ...
read it

Towards Tight Bounds for Spectral Sparsification of Hypergraphs
Cut and spectral sparsification of graphs have numerous applications, in...
read it

Communication Efficient Coresets for Maximum Matching
In this paper we revisit the problem of constructing randomized composab...
read it

Graph Spanners by Sketching in Dynamic Streams and the Simultaneous Communication Model
Graph sketching is a powerful technique introduced by the seminal work o...
read it

Scaling up Kernel Ridge Regression via Locality Sensitive Hashing
Random binning features, introduced in the seminal paper of Rahimi and R...
read it

Practice of Streaming and Dynamic Graphs: Concepts, Models, Systems, and Parallelism
Graph processing has become an important part of various areas of comput...
read it

Oblivious Sketching of HighDegree Polynomial Kernels
Kernel methods are fundamental tools in machine learning that allow dete...
read it

Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples
Given a source of iid samples of edges of an input graph G with n vertic...
read it

Online Matching with General Arrivals
The online matching problem was introduced by Karp, Vazirani and Vaziran...
read it

Faster Spectral Sparsification in Dynamic Streams
Graph sketching has emerged as a powerful technique for processing massi...
read it

Dynamic Streaming Spectral Sparsification in Nearly Linear Time and Space
In this paper we consider the problem of computing spectral approximatio...
read it

Dimensionindependent Sparse Fourier Transform
The Discrete Fourier Transform (DFT) is a fundamental computational prim...
read it

A Universal Sampling Method for Reconstructing Signals with Simple Fourier Transforms
Reconstructing continuous signals from a small number of discrete sample...
read it

An Optimal Space Lower Bound for Approximating MAXCUT
We consider the problem of estimating the value of MAXCUT in a graph in...
read it

A Simple SublinearTime Algorithm for Counting Arbitrary Subgraphs via Edge Sampling
In the subgraph counting problem, we are given a input graph G(V, E) and...
read it

The Sketching Complexity of Graph and Hypergraph Counting
Subgraph counting is a fundamental primitive in graph processing, with a...
read it

Testing Graph Clusterability: Algorithms and Lower Bounds
We consider the problem of testing graph cluster structure: given access...
read it

Random Fourier Features for Kernel Ridge Regression: Approximation Bounds and Statistical Guarantees
Random Fourier features is one of the most popular techniques for scalin...
read it
Michael Kapralov
is this you? claim profile