82 citations · 187 across the 27 of their papers we have counts for
5 papers · 1 filter
Simulating Random Walks in Random Streams
John Kallaugher, Michael Kapralov, Eric Price
The random order graph streaming model has received significant attention recently, with problems such as matching size estimation, component counting, and the evaluation of bounde…
Yang-Mills-Scalar-Matter Fields in the Two-Point Space
Gustavo Amilcar Saldaña Moncada
The purpose of this work is to present a Non--Commutative Geometrical version of the Yang--Mills Theory and the Yang--Mills Scalar Matter Theory by constructing a concrete example…
Noisy Boolean Hidden Matching with Applications
Michael Kapralov, Amulya Musipatla, Jakab Tardos +2
The Boolean Hidden Matching (BHM) problem, introduced in a seminal paper of Gavinsky et. al. [STOC'07], has played an important role in the streaming lower bounds for graph problem…
Spectral Hypergraph Sparsifiers of Nearly Linear Size
Michael Kapralov, Robert Krauthgamer, Jakab Tardos +1
Graph sparsification has been studied extensively over the past two decades, culminating in spectral sparsifiers of optimal size (up to constant factors). Spectral hypergraph spars…
Space Lower Bounds for Approximating Maximum Matching in the Edge Arrival Model
Michael Kapralov
The bipartite matching problem in the online and streaming settings has received a lot of attention recently. The classical vertex arrival setting, for which the celebrated Karp, V…