Ohad Shamir, Sivan Sabato, et al.
Theoretical Computer Science
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
Ohad Shamir, Sivan Sabato, et al.
Theoretical Computer Science
Thomas R. Puzak, A. Hartstein, et al.
CF 2007
David A. Selby
IBM J. Res. Dev
Robert G. Farrell, Catalina M. Danis, et al.
RecSys 2012