Rajiv Ramaswami, Kumar N. Sivarajan
IEEE/ACM Transactions on Networking
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
Rajiv Ramaswami, Kumar N. Sivarajan
IEEE/ACM Transactions on Networking
Alfonso P. Cardenas, Larry F. Bowman, et al.
ACM Annual Conference 1975
Erich P. Stuntebeck, John S. Davis II, et al.
HotMobile 2008
Robert G. Farrell, Catalina M. Danis, et al.
RecSys 2012