Fetching the paper…
Reading the bibliography…
The area of sublinear algorithms have recently received a lot of attention.
Inner Product Oracle can Estimate and Sample
Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, and Manaswi Paraashar · 1906
Earlier work this paper cites.
Data streams: Algorithms and applications
S. Muthukrishnan · 2005
Earlier work this paper cites.
Talya Eden, Saleet Mossel, and Ronitt Rubinfeld · 2008
Earlier work this paper cites.
Approximating average parameters of graphs
Oded Goldreich and Dana Ron · 2008
Earlier work this paper cites.
Counting Stars and Other Small Subgraphs in Sublinear Time
Mira Gonen, Dana Ron, and Yuval Shavitt · 2011
Earlier work this paper cites.
Graph stream algorithms: A survey
Andrew McGregor · 2014
Cited alongside, same era.
Maryam Aliakbarpour, Amartya Shankha Biswas, Themistoklis Gouleakis, John Peebles, Ronitt Rubinfeld, and Anak Yodpinyanee · 2016
Cited alongside, same era.
Markov Chains and Mixing Times
D.A. Levin, Y. Peres, and E.L. Wilmer · 2017
Cited alongside, same era.
A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling
Sepehr Assadi, Michael Kapralov, and Sanjeev Khanna · 2018
Cited alongside, same era.
On the complexity of sampling vertices uniformly from a graph
Flavio Chierichetti and Shahrzad Haddadan · 2018
Cited alongside, same era.
On Sampling Edges Almost Uniformly
Talya Eden and Will Rosenbaum · 2018
Later among the works it cites.
The arboricity captures the complexity of sampling edges
Talya Eden, Dana Ron, and Will Rosenbaum · 2019
Later among the works it cites.
The Arboricity Captures the Complexity of Sampling Edges
Talya Eden, Dana Ron, and Will Rosenbaum · 2019
Later among the works it cites.
Sublinear-Time Algorithms for Approximating Graph Parameters
Dana Ron · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…