Q. Yan, S. Yang, and M. Wigger, Storage, computation and communication: A fundamental tradeoff in distributed computing, Proc. IEEE Inf. Thoery Workshop (ITW), 2018.

J. Dean and S. Ghemawat, MapReduce: Simplified data processing on large clusters, Sixth USENIX OSDI, 2004.

M. Isard, M. Budiu, Y. Yu, A. Birrell, and D. Fetterly, Dryad: distributed data-parallel programs from sequential building blocks, Proc. the 2nd ACM SIGOPS/EuroSys'07, 2007.

S. Li, M. A. Maddah-ali, Q. Yu, and A. S. Avestimehr, A fundamental tradeoff between computation and communication in distributed computing, IEEE Trans. Inf. Theory, vol.64, issue.1, pp.109-128, 2018.

Y. H. Ezzeldin, M. Karmoose, and C. Fragouli, Communication vs distributed computation: An alternative trade-off curve, Proc. IEEE Inf. Theory Workshop (ITW), pp.279-283, 2017.

K. Lee, M. Lam, R. Pedarsani, D. Papailiopoulos, and K. Ramchandran, Speeding up distributed machine learning using codes, IEEE Trans. Inf. Theory, vol.64, issue.3, pp.1514-1529, 2018.

S. Li, M. A. Maddah-ali, and A. S. Avestimehr, A unified coding framework for distributed computing with straggling servers, Proc. IEEE Globecom Works (GC Wkshps), 2016.

A. Reisizadeh, S. Prakash, R. Pedarsani, and S. Avestimehr, Coded computation over heterogeneous clusters, Proc. IEEE Int. Symp. Inf. Theory, pp.2408-2412, 2017.

Q. Yu, M. Maddah-ali, and S. Avestimehr, Polynomial codes: An optimal design for high-dimensional coded matrix multiplication, Proc. The 31st Annual Conf. Neural Inf. Processing System (NIPS), 2017.

Q. Yu, M. Maddah-ali, and S. Avestimehr, Straggler mitigation in distributed matrix multiplication: Fundamental limits and optimal coding, Proc. IEEE Int. Symp. Inf. Theory, pp.2022-2026, 2018.

K. Lee, C. Suh, and K. Ramchandran, High-dimensional coded matrix multiplication, Proc. IEEE Int. Symp. Inf. Theory, pp.2418-2422, 2017.

H. Park, K. Lee, J. Sohn, C. Suh, and J. Moon, Hierarchical coding for distributed computing

F. Haddadpour and V. R. Cadambe, Codes for distributed finite alphabet matrix-vector multiplication, Proc. IEEE Int. Symp. Inf. Theory, pp.1625-1629, 2018.

S. Kiani, N. Ferdinand, and S. C. Draper, Exploitation of stragglers in coded computation, Proc. IEEE Int. Symp. Inf. Theory, 1988.

T. Baharav, K. Lee, O. Ocal, and K. Ramchandran, Straggler-proofing massive-scale distributed matrix multiplication with d-dimensional product codes, Proc. IEEE Int. Symp. Inf. Theory, 1993.

N. Ferdinand and S. C. Draper, Hierarchical coded computation, Proc. IEEE Int. Symp. Inf. Theory, pp.1620-1624, 2018.

Q. Yu, S. Li, M. A. Maddah-ali, and A. S. Avestimehr, How to optimally allocate resources for coded distributed computing, Proc. IEEE Int. Conf. Commun. (ICC, pp.21-25, 2017.

S. Li, Q. Yu, M. A. Maddah-ali, and A. S. Avestimehr, A scalable framework for wireless distributed computing, IEEE/ACM Trans. Netw, vol.25, issue.5, pp.2643-2653, 2017.

S. Li, Q. Yu, M. A. Maddah-ali, and A. S. Avestimehr, Edge-facilitated wireless distributed computing, Proc. IEEE Glob. Commun. Conf. (Globlcom), 2016.

F. Li, J. Chen, and Z. Wang, Wireless Map-Reduce distributed computing, Proc. IEEE Int. Symp. Inf. Theory, pp.1286-1290, 2018.

E. Parrinello, E. Lampiris, and P. Elia, Coded distributed computing with node cooperation substantially increases speedup factors, Proc. IEEE Int. Symp. Inf. Theory, pp.1291-1295, 2018.

M. A. Attia and R. Tandon, On the worst-case communication overhead for distributed data shuffling, Proc. 54th Allerton Conf. Commun, pp.961-968, 2016.

M. A. Attia and R. Tandon, Information theoretic limits of data shuffling for distributed learning, Proc. IEEE Glob. Commun. Conf. (Globlcom), 2016.

A. Elmahdy and S. Mohajer, On the fundamental limits of coded data shuffling, Proc. IEEE Int. Symp. Inf. Theory, pp.716-720, 2018.

L. Song, S. R. Srinivasavaradhan, and C. Fragouli, The benefit of being flexible in distributed computation, Proc. IEEE Inf. Theory Workshop (ITW), pp.289-293, 2017.

S. R. Srinivasavaradhan, L. Song, and C. Fragouli, Distributed computing trade-offs with random connectivity, Proc. IEEE Int. Symp. Inf. Theory, pp.1281-1285, 2018.

R. Tandon, Q. Lei, A. G. Dimakis, and N. Karampatziakis, Gradient coding: Avoiding stragglers in synchronous gradient descent

N. Raviv, I. Tamo, R. Tandon, and A. G. Dimakis, Gradient coding from cyclic MDS codes and expander graphs

Z. Charles and D. Papailiopoulos, Gradient coding using the stochastic block model, Proc. IEEE Int. Symp. Inf. Theory, 1998.

W. Halbawi, N. Azizan, F. Salehi, and B. Hassil, Improving distributed gradient descent using Reed-Solomon codes, Proc. IEEE Int. Symp. Inf. Theory, pp.2027-2031, 2018.

M. A. Maddah-ali and U. Niesen, Fundamental limits of caching, IEEE Trans. Inf. Theory, vol.60, issue.5, pp.2856-2867, 2014.

Q. Yan, M. Cheng, X. Tang, and Q. Chen, On the placement delivery array design for centralized coded caching scheme, IEEE Trans. Inf. Theory, vol.63, issue.9, pp.5821-5833, 2017.

C. Shangguan, Y. Zhang, and G. Ge, Centralized coded caching schemes: A hypergraph theoretical approach, IEEE Trans. Inf. Theory, vol.64, issue.8, pp.5755-5766, 2018.

Q. Yan, X. Tang, Q. Chen, and M. Cheng, Placement delivery array design through strong edge coloring of bipartite graphs, IEEE Commun. Lett, vol.22, issue.2, pp.236-239, 2018.

K. Konstantinidis and A. Ramamoorthy, Leveraging coding techniques for speeding up distributed computing

N. Woolsey, R. R. Chen, and M. Ji, A new combinatorial design of coded distributed computing, Proc. IEEE Int. Symp. Inf. Theory, pp.726-730, 2018.