Fetching the paper…
Reading the bibliography…
In this paper, we revisit the communication vs.
A. C.-C. Yao, “Some complexity questions related to distributive computing (preliminary report),” in Proceedings of the eleventh annual ACM symposium on Theory of computing , 1979, pp. 209–213
1979
Earlier work this paper cites.
K. Becker and U. Wille, “Communication complexity of group key distribution,” in Proceedings of the 5th ACM conference on Computer and communications security , 1998, pp. 1–6
1998
Earlier work this paper cites.
A. Orlitsky and J. Roche, “Coding for computing,” IEEE Trans. on Information Theory , vol. 47, no. 3, pp. 903–917, 2001
2001
Earlier work this paper cites.
E. Kushilevitz and N. Nisan, “Communication complexity,” 2006
2006
Earlier work this paper cites.
J. Dean and S. Ghemawat, “Mapreduce: simplified data processing on large clusters,” Communications of the ACM , vol. 51, no. 1, pp. 107–113, 2008
2008
Cited alongside, same era.
M. A. Maddah-Ali and U. Niesen, “Fundamental limits of caching,” IEEE Trans. on Information Theory , vol. 60, no. 5, pp. 2856–2867, 2014
2014
Cited alongside, same era.
J. Hachem, N. Karamchandani, and S. Diggavi, “Content caching and delivery over heterogeneous wireless networks,” in IEEE Conference on Computer Communications (INFOCOM) , 2015, pp. 756–764
2015
Cited alongside, same era.
S. Li, M. A. Maddah-Ali, and A. S. Avestimehr, “Fundamental tradeoff between computation and communication in distributed computing,” in IEEE International Symposium on Information Theory (ISIT) , 2016, pp. 1814–1818
2016
Cited alongside, same era.
N. Karamchandani, U. Niesen, M. A. Maddah-Ali, and S. N. Diggavi, “Hierarchical coded caching,” IEEE Trans. on Information Theory , vol. 62, no. 6, pp. 3212–3229, 2016
2016
Later among the works it cites.
S. Li, M. A. Maddah-Ali, and A. S. Avestimehr, “Coded distributed computing: Straggling servers and multistage dataflows,” in 54th Annual Allerton Conference on Communication, Control, and Computing . IEEE, 2016, pp. 164–171
2016
Later among the works it cites.
2017
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…