Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics
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
Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics
David S. Kung
DAC 1998
Ziyang Liu, Sivaramakrishnan Natarajan, et al.
VLDB
Rafae Bhatti, Elisa Bertino, et al.
Communications of the ACM