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
30 papers · 1 filter
Traffic-Oblivious Multi-Commodity Flow Network Design
Markus Chimani, Max Ilsen
We consider the Minimum Multi-Commodity Flow Subgraph (MMCFS) problem: given a directed graph with edge capacities and a retention ratio , find an edg…
Parallel Batch-Dynamic d-Trees
Rahul Yesantharao, Yiqiu Wang, Laxman Dhulipala +1
d-trees are widely used in parallel databases to support efficient neighborhood/similarity queries. Supporting parallel updates to d-trees is therefore an important operation…
An Illuminating Algorithm for the Light Bulb Problem
Josh Alman
The Light Bulb Problem is one of the most basic problems in data analysis. One is given as input vectors in , which are all independently and uniformly random, exce…
Parallelism in Randomized Incremental Algorithms
Guy E. Blelloch, Yan Gu, Julian Shun +1
In this paper we show that many sequential randomized incremental algorithms are in fact parallel. We consider algorithms for several problems including Delaunay triangulation, lin…
Fast Characterization of Segmental Duplications in Genome Assemblies
Ibrahim Numanagić, Alim S. Gökkaya, Lillian Zhang +3
Segmental duplications (SDs), or low-copy repeats (LCR), are segments of DNA greater than 1 Kbp with high sequence identity that are copied to other regions of the genome. SDs are…
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
Laxman Dhulipala, Guy E. Blelloch, Julian Shun
There has been significant recent interest in parallel graph processing due to the need to quickly analyze the large graphs available today. Many graph codes have been designed for…