Storage, computation and communication: A fundamental tradeoff in distributed computing, Proc. IEEE Inf. Thoery Workshop (ITW), 2018. ,
MapReduce: Simplified data processing on large clusters, Sixth USENIX OSDI, 2004. ,
Dryad: distributed data-parallel programs from sequential building blocks, Proc. the 2nd ACM SIGOPS/EuroSys'07, 2007. ,
A fundamental tradeoff between computation and communication in distributed computing, IEEE Trans. Inf. Theory, vol.64, issue.1, pp.109-128, 2018. ,
Communication vs distributed computation: An alternative trade-off curve, Proc. IEEE Inf. Theory Workshop (ITW), pp.279-283, 2017. ,
Speeding up distributed machine learning using codes, IEEE Trans. Inf. Theory, vol.64, issue.3, pp.1514-1529, 2018. ,
A unified coding framework for distributed computing with straggling servers, Proc. IEEE Globecom Works (GC Wkshps), 2016. ,
Coded computation over heterogeneous clusters, Proc. IEEE Int. Symp. Inf. Theory, pp.2408-2412, 2017. ,
Polynomial codes: An optimal design for high-dimensional coded matrix multiplication, Proc. The 31st Annual Conf. Neural Inf. Processing System (NIPS), 2017. ,
Straggler mitigation in distributed matrix multiplication: Fundamental limits and optimal coding, Proc. IEEE Int. Symp. Inf. Theory, pp.2022-2026, 2018. ,
High-dimensional coded matrix multiplication, Proc. IEEE Int. Symp. Inf. Theory, pp.2418-2422, 2017. ,
Hierarchical coding for distributed computing ,
Codes for distributed finite alphabet matrix-vector multiplication, Proc. IEEE Int. Symp. Inf. Theory, pp.1625-1629, 2018. ,
Exploitation of stragglers in coded computation, Proc. IEEE Int. Symp. Inf. Theory, 1988. ,
Straggler-proofing massive-scale distributed matrix multiplication with d-dimensional product codes, Proc. IEEE Int. Symp. Inf. Theory, 1993. ,
Hierarchical coded computation, Proc. IEEE Int. Symp. Inf. Theory, pp.1620-1624, 2018. ,
How to optimally allocate resources for coded distributed computing, Proc. IEEE Int. Conf. Commun. (ICC, pp.21-25, 2017. ,
A scalable framework for wireless distributed computing, IEEE/ACM Trans. Netw, vol.25, issue.5, pp.2643-2653, 2017. ,
Edge-facilitated wireless distributed computing, Proc. IEEE Glob. Commun. Conf. (Globlcom), 2016. ,
Wireless Map-Reduce distributed computing, Proc. IEEE Int. Symp. Inf. Theory, pp.1286-1290, 2018. ,
Coded distributed computing with node cooperation substantially increases speedup factors, Proc. IEEE Int. Symp. Inf. Theory, pp.1291-1295, 2018. ,
On the worst-case communication overhead for distributed data shuffling, Proc. 54th Allerton Conf. Commun, pp.961-968, 2016. ,
Information theoretic limits of data shuffling for distributed learning, Proc. IEEE Glob. Commun. Conf. (Globlcom), 2016. ,
On the fundamental limits of coded data shuffling, Proc. IEEE Int. Symp. Inf. Theory, pp.716-720, 2018. ,
The benefit of being flexible in distributed computation, Proc. IEEE Inf. Theory Workshop (ITW), pp.289-293, 2017. ,
Distributed computing trade-offs with random connectivity, Proc. IEEE Int. Symp. Inf. Theory, pp.1281-1285, 2018. ,
Gradient coding: Avoiding stragglers in synchronous gradient descent ,
Gradient coding from cyclic MDS codes and expander graphs ,
Gradient coding using the stochastic block model, Proc. IEEE Int. Symp. Inf. Theory, 1998. ,
Improving distributed gradient descent using Reed-Solomon codes, Proc. IEEE Int. Symp. Inf. Theory, pp.2027-2031, 2018. ,
Fundamental limits of caching, IEEE Trans. Inf. Theory, vol.60, issue.5, pp.2856-2867, 2014. ,
On the placement delivery array design for centralized coded caching scheme, IEEE Trans. Inf. Theory, vol.63, issue.9, pp.5821-5833, 2017. ,
Centralized coded caching schemes: A hypergraph theoretical approach, IEEE Trans. Inf. Theory, vol.64, issue.8, pp.5755-5766, 2018. ,
Placement delivery array design through strong edge coloring of bipartite graphs, IEEE Commun. Lett, vol.22, issue.2, pp.236-239, 2018. ,
Leveraging coding techniques for speeding up distributed computing ,
A new combinatorial design of coded distributed computing, Proc. IEEE Int. Symp. Inf. Theory, pp.726-730, 2018. ,