Fetching the paper…
Reading the bibliography…
We consider algorithmic problems in the setting in which the input data has been partitioned arbitrarily on many servers.
The space complexity of approximating the frequency moments
Noga Alon, Yossi Matias, and Mario Szegedy · 1999
Earlier work this paper cites.
An algorithmic theory of learning: Robust concepts and random projection
Rosa I. Arriaga and Santosh Vempala · 1999
Earlier work this paper cites.
Database-friendly random projections: Johnson-lindenstrauss with binary coins
Dimitris Achlioptas · 2003
Earlier work this paper cites.
Near-optimal lower bounds on the multi-party communication complexity of set disjointness
Amit Chakrabarti, Subhash Khot, and Xiaodong Sun · 2003
Earlier work this paper cites.
An information statistics approach to data stream and communication complexity
Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, and D. Sivakumar · 2004
Earlier work this paper cites.
Spectral techniques applied to sparse random graphs
Uriel Feige and Eran Ofek · 2005
Earlier work this paper cites.
A fast random sampling algorithm for sparsifying matrices
Sanjeev Arora, Elad Hazan, and Satyen Kale · 2006
Earlier work this paper cites.
An algorithmic theory of learning: Robust concepts and random projection
Rosa I. Arriaga and Santosh Vempala · 2006
Earlier work this paper cites.
The fast johnson–lindenstrauss transform and approximate nearest neighbors
Nir Ailon and Bernard Chazelle · 2009
Earlier work this paper cites.
Numerical linear algebra in the streaming model
Kenneth L. Clarkson and David P. Woodruff · 2009
Cited alongside, same era.
Asymptotically optimal lower bounds on the nih-multi-party information complexity of the and-function and disjointness
Andre Gronemeier · 2009
Cited alongside, same era.
Hellinger strikes back: A note on the multi-party information complexity of and
T. S. Jayram · 2009
Cited alongside, same era.
Almost optimal explicit johnson-lindenstrauss families
Daniel M. Kane, Raghu Meka, and Jelani Nelson · 2011
Cited alongside, same era.
Osnap: Faster numerical linear algebra algorithms via sparser subspace embeddings
Jelani Nelson and Huy L. Nguyen · 2012
Cited alongside, same era.
Lower bounds for number-in-hand multiparty communication complexity, made easy
Low rank approximation and regression in input sparsity time
Kenneth L. Clarkson and David P. Woodruff · 2013
Closest in time.
Turning big data into tiny data: Constant-size coresets for k
Dan Feldman, Melanie Schmidt, and Christian Sohler · 2013
Closest in time.
Relative errors for deterministic low-rank matrix approximations
Mina Ghashami and Jeff M. Phillips · 2013
Closest in time.
Distributed pca and k k -means clustering
Yingyu Liang, Maria-Florina Balcan, and Vandana Kanchanapally · 2013
Closest in time.
Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression
Xiangrui Meng and Michael W. Mahoney · 2013
Closest in time.
Subspace embeddings for the polynomial kernel, 2014
Haim Avron, Huy L. Nguyen, and David P. Woodruff · 2014
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Jeff M. Phillips, Elad Verbin, and Qin Zhang · 2012
Cited alongside, same era.
Tight bounds for distributed functional monitoring
David P. Woodruff and Qin Zhang · 2012
Cited alongside, same era.
Tight bounds for set disjointness in the message passing model
Mark Braverman, Faith Ellen, Rotem Oshman, Toniann Pitassi, and Vinod Vaikuntanathan · 2013
Cited alongside, same era.
Closest in time.
Fast and communication efficient algorithms for distributed pca
Maria-Florina Balcan, Vandana Kanchanapally, Yingyu Liang, and David P. Woodruff · 2014
Closest in time.
Optimal cur matrix factorizations
Christos Boutsidis and David P. Woodruff · 2014
Closest in time.