Fetching the paper…
Reading the bibliography…
We give algorithms for geometric graph problems in the modern parallel models inspired by MapReduce.
Graph-theoretical methods for detecting and describing gestalt clusters
Charles T Zahn · 1971
Earlier work this paper cites.
An O ( log n ) O(\log n) parallel connectivity algorithm
Yossi Shiloach and Uzi Vishkin · 1982
Earlier work this paper cites.
Minimum spanning trees in k-dimensional space
Pravin M Vaidya · 1988
Earlier work this paper cites.
Optimal bounds for decision problems on the CRCW PRAM
Paul Beame and Johan Håstad · 1989
Earlier work this paper cites.
Geometry helps in matching
Pravin M Vaidya · 1989
Earlier work this paper cites.
A bridging model for parallel computation
Leslie G. Valiant · 1990
Earlier work this paper cites.
Faster algorithms for some geometric graph problems in higher dimensions
Paul B Callahan and S Rao Kosaraju · 1993
Earlier work this paper cites.
Dynamic euclidean minimum spanning trees and extrema of binary functions
David Eppstein · 1995
Earlier work this paper cites.
An optimal algorithm for approximate nearest neighbor searching
Sunil Arya, David M. Mount, Nathan S. Netanyahu, Ruth Silverman, and Angela Y. Wu · 1998
Earlier work this paper cites.
Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems
Sanjeev Arora · 1998
Earlier work this paper cites.
Communication-efficient parallel sorting
Michael T Goodrich · 1999
Earlier work this paper cites.
Sublinear time algorithms for metric space problems
Piotr Indyk · 1999
Earlier work this paper cites.
Approximation algorithms for bipartite and non-bipartite matching in the plane
Kasturi R Varadarajan and Pankaj K Agarwal · 1999
Earlier work this paper cites.
Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications
Pankaj K Agarwal, Alon Efrat, and Micha Sharir · 2000
Earlier work this paper cites.
High-dimensional Computational Geometry
Piotr Indyk · 2000
Earlier work this paper cites.
The earth mover’s distance as a metric for image retrieval
Yossi Rubner, Carlo Tomasi, and Leonidas J. Guibas · 2000
Earlier work this paper cites.
Fast color image retrieval via embeddings
Piotr Indyk and Nitin Thaper · 2003
Earlier work this paper cites.
On the streaming model augmented with a sorting primitive
Gagan Aggarwal, Mayur Datar, Sridhar Rajagopalan, and Matthias Ruhl · 2004
Cited alongside, same era.
A near-linear constant factor approximation for euclidean matching?
P. Agarwal and K. Varadarajan · 2004
Cited alongside, same era.
MapReduce: Simplified data processing on large clusters
Jeffrey Dean and Sanjay Ghemawat · 2004
Cited alongside, same era.
Algorithms for dynamic geometric problems over data streams
Piotr Indyk · 2004
Cited alongside, same era.
Bypassing the embedding: algorithms for low dimensional metrics
Kunal Talwar · 2004
Cited alongside, same era.
Geometric approximation via coresets - survey
P. K. Agarwal, S. Har-Peled, and K. R. Varadarajan · 2005
Cited alongside, same era.
On distributing symmetric streaming computations
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, and Zoya Svitkina · 2010
Later among the works it cites.
A model of computation for MapReduce
Howard J. Karloff, Siddharth Suri, and Sergei Vassilvitskii · 2010
Later among the works it cites.
Linear-work greedy parallel approximate set cover and variants
Guy E Blelloch, Richard Peng, and Kanat Tangwongsan · 2011
Later among the works it cites.
Fast clustering using MapReduce
Alina Ene, Sungjin Im, and Benjamin Moseley · 2011
Later among the works it cites.
A unified framework for approximating and clustering data
Dan Feldman and Michael Langberg · 2011
Later among the works it cites.
Sorting, searching, and simulation in the MapReduce framework
Michael T. Goodrich, Nodari Sitchinava, and Qin Zhang · 2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
The pyramid match kernel: Discriminative classification with sets of image features
Kristen Grauman and Trevor Darrell · 2005
Cited alongside, same era.
Searching dynamic point sets in spaces with bounded doubling dimension
Richard Cole and Lee-Ad Gottlieb · 2006
Cited alongside, same era.
Algorithm design
Jon Kleinberg and Eva Tardos · 2006
Cited alongside, same era.
Open problems in data streams and related topics
Andrew McGregor · 2006
Cited alongside, same era.
Dryad: distributed data-parallel programs from sequential building blocks
Michael Isard, Mihai Budiu, Yuan Yu, Andrew Birrell, and Dennis Fetterly · 2007
Cited alongside, same era.
A near linear time constant factor approximation for euclidean bichromatic matching (cost)
Piotr Indyk · 2007
Cited alongside, same era.
Open problems in data streams, property testing, and related topics
Piotr Indyk, Andrew McGregor, Ilan Newman, and Krzysztof Onak · 2011
Later among the works it cites.
Filtering: a method for solving graph problems in MapReduce
Silvio Lattanzi, Benjamin Moseley, Siddharth Suri, and Sergei Vassilvitskii · 2011
Later among the works it cites.
Densest subgraph in streaming and MapReduce
Bahman Bahmani, Ravi Kumar, and Sergei Vassilvitskii · 2012
Later among the works it cites.
Approximate nearest neighbor: Towards removing the curse of dimensionality
Sariel Har-Peled, Piotr Indyk, and Rajeev Motwani · 2012
Later among the works it cites.
Algorithms for the transportation problem in geometric settings
R. Sharathkumar and Pankaj K. Agarwal · 2012
Later among the works it cites.
A near-linear time -approximation algorithm for geometric bipartite matching
R. Sharathkumar and Pankaj K. Agarwal · 2012
Later among the works it cites.
Hadoop: the definitive guide
Tom White · 2012
Later among the works it cites.
Communication steps for parallel query processing
Paul Beame, Paraschos Koutris, and Dan Suciu · 2013
Closest in time.
Fast greedy algorithms in MapReduce and streaming
Ravi Kumar, Benjamin Moseley, Sergei Vassilvitskii, and Andrea Vattani · 2013
Closest in time.
Naiad: a timely dataflow system
Derek G Murray, Frank McSherry, Rebecca Isaacs, Michael Isard, Paul Barham, and Martin Abadi · 2013
Closest in time.