From the 9 of 358 papers with an AI index.
266 citations
- Tsinghua UniversityCN88 papers
- University of Science and Technology of ChinaCN82 papers
- Istituto Nazionale di Fisica Nucleare, Laboratori Nazionali di FrascatiIT81 papers
- Beihang UniversityCN80 papers
- Nanjing Normal UniversityCN80 papers
- Peking UniversityCN80 papers
- Zhejiang UniversityCN80 papers
- National Centre for Nuclear ResearchPL79 papers
- South China Normal UniversityCN79 papers
- University of BristolGB79 papers
- University of TarapacáCL79 papers
- University of TurinIT79 papers
7 papers · 1 filter
Succinct and Fast Tiny Pointer Hash Tables
Xilin Tang, Yuqi Mai, William Kuszmaul +1
Hash tables sit on the critical path of many systems, yet modern designs still force a trade-off between fast operations and high memory overhead. We revisit this trade-off and pre…
Fast Concurrent Primitives Despite Contention
Michael A. Bender, Guy E. Blelloch, Martin Farach-Colton +4
We study the problem of constructing concurrent objects in a setting where processes run in parallel and interact through a shared memory that is subject to write contention. O…
An Randomized Lower Bound for Cutting a Cake into Proportionally Fair Pieces
Stephen Arndt, Kirk Pruhs, Trung Tran
We consider the classic cake cutting problem in the Robertson-Webb model, with the objective of proportional fairness. We show that any randomized algorithm must use …
Efficient Online Random Sampling via Randomness Recycling
Thomas L. Draper, Feras A. Saad
This article studies the fundamental problem of using i.i.d. coin tosses from an entropy source to efficiently generate random variables , where $(P_1, P_…
Deterministic Mincut in Almost-Linear Time
Jason Li
We present a deterministic (global) mincut algorithm for weighted, undirected graphs that runs in time, answering an open question of Karger from the 1990s. To obtain…
The Telephone -Multicast Problem
Daniel Hathcock, Guy Kortsarz, R. Ravi
We consider minimum time multicasting problems in directed and undirected graphs: given a root node and a subset of terminal nodes, multicasting seeks to find the minimum numbe…