Conference paper
A privacy-protecting coupon system
Liqun Chen, Matthias Enzmann, et al.
FC 2005
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
Liqun Chen, Matthias Enzmann, et al.
FC 2005
Zohar Feldman, Avishai Mandelbaum
WSC 2010
Leo Liberti, James Ostrowski
Journal of Global Optimization
Thomas R. Puzak, A. Hartstein, et al.
CF 2007