2.2k citations
- Massachusetts Institute of TechnologyUS303 papers
- Harvard UniversityUS23 papers
- MIT Lincoln LaboratoryUS17 papers
- IIT@MITUS16 papers
- Stanford UniversityUS16 papers
- Intel (United States)US13 papers
- Microsoft (United States)US12 papers
- University of California, BerkeleyUS12 papers
- University of WashingtonUS12 papers
- Carnegie Mellon UniversityUS11 papers
- Google (United States)US11 papers
- Massachusetts General HospitalUS11 papers
4 papers · 2 filters
Flow-Based Algorithms for Local Graph Clustering
Lorenzo Orecchia, Zeyuan Allen Zhu
Given a subset S of vertices of an undirected graph G, the cut-improvement problem asks us to find a subset S that is similar to A but has smaller conductance. A very elegant algor…
Distributed Minimum Cut Approximation
Mohsen Ghaffari, Fabian Kuhn
We study the problem of computing approximate minimum edge cuts by distributed algorithms. We use a standard synchronous message passing model where in each round, bits…
Separating Hierarchical and General Hub Labelings
Andrew V. Goldberg, Ilya Razenshteyn, Ruslan Savchenko
In the context of distance oracles, a labeling algorithm computes vertex labels during preprocessing. An query computes the corresponding distance from the labels of and…
On Model-Based RIP-1 Matrices
Piotr Indyk, Ilya Razenshteyn
The Restricted Isometry Property (RIP) is a fundamental property of a matrix enabling sparse recovery. Informally, an m x n matrix satisfies RIP of order k in the l_p norm if ||Ax|…