Oliver Bodemer
IBM J. Res. Dev
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
Oliver Bodemer
IBM J. Res. Dev
Leo Liberti, James Ostrowski
Journal of Global Optimization
Sonia Cafieri, Jon Lee, et al.
Journal of Global Optimization
William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010