Conference paper
A privacy-protecting coupon system
Liqun Chen, Matthias Enzmann, et al.
FC 2005
Natural graphical representations for Boolean functions, so-called free Boolean graphs, arise in the study of Ianov schemes. Fortune, Hopcroft and Schmidt have asked if an algorithm can decide covalence of these free Boolean graphs in poly- time. We show that random polynomial time will suffice.
Liqun Chen, Matthias Enzmann, et al.
FC 2005
Arun Viswanathan, Nancy Feldman, et al.
IEEE Communications Magazine
Rajeev Gupta, Shourya Roy, et al.
ICAC 2006
Alessandro Morari, Roberto Gioiosa, et al.
IPDPS 2011