3k citations
- Joint Institute for Nuclear ResearchRU432 papers
- Istituto Nazionale di Fisica Nucleare, Laboratori Nazionali di FrascatiIT430 papers
- Massachusetts Institute of TechnologyUS402 papers
- Peking UniversityCN366 papers
- The Ohio State UniversityUS362 papers
- University of California, Los AngelesUS359 papers
- Fermi National Accelerator LaboratoryUS353 papers
- University of California, DavisUS353 papers
- University of RochesterUS352 papers
- Johns Hopkins UniversityUS349 papers
- Purdue University West LafayetteUS341 papers
- Texas A&M UniversityUS341 papers
74 papers · 1 filter
Low-Step Multi-Commodity Flow Emulators
Bernhard Haeupler, D Ellis Hershkowitz, Jason Li +2
We introduce the concept of low-step multi-commodity flow emulators for any undirected, capacitated graph. At a high level, these emulators contain approximate multi-commodity flow…
Optimal Kernel Orchestration for Tensor Programs with Korch
Muyan Hu, Ashwin Venkatram, Shreyashri Biswas +7
Kernel orchestration is the task of mapping the computation defined in different operators of a deep neural network (DNN) to the execution of GPU kernels on modern hardware platfor…
Optimal Sketching Bounds for Sparse Linear Regression
Tung Mai, Alexander Munteanu, Cameron Musco +3
We study oblivious sketching for -sparse linear regression under various loss functions such as an norm, or from a broad class of hinge-like loss functions, which inclu…
On the Fixed-Parameter Tractability of Capacitated Clustering
Vincent Cohen-Addad, Jason Li
We study the complexity of the classic capacitated k-median and k-means problems parameterized by the number of centers, k. These problems are notoriously difficult since the best…
Approximate Gomory-Hu Tree Is Faster Than Max-Flows
Jason Li, Debmalya Panigrahi
The Gomory-Hu tree or cut tree (Gomory and Hu, 1961) is a classic data structure for reporting mincuts (and by duality, the values of maxflows) for all pairs of ver…
Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based L1-Oblivious Routing
Goran Zuzic, Gramoz Goranci, Mingquan Ye +2
We provide universally-optimal distributed graph algorithms for -approximate shortest path problems including shortest-path-tree and transshipment. The universal o…