Sonia Cafieri, Jon Lee, et al.
Journal of Global Optimization
Recently the paradigm of skew-tolerant parallel asynchronous communication was introduced, along with constructions for codes that can tolerate or detect skew. Some of these constructions were improved in [8]. In this paper these constructions are improved upon further, and we prove that the new constructions are, in a certain sense, optimal. © 1993 IEEE
Sonia Cafieri, Jon Lee, et al.
Journal of Global Optimization
Preeti Malakar, Thomas George, et al.
SC 2012
Fan Jing Meng, Ying Huang, et al.
ICEBE 2007
Israel Cidon, Leonidas Georgiadis, et al.
IEEE/ACM Transactions on Networking