Rahul Jain Hartmut Klauck Ashwin Nayak Direct Product Theorems for Communication Complexity via Subdistribution Bounds. 2007 14 Electronic Colloquium on Computational Complexity (ECCC) http://eccc.hpi-web.de/eccc-reports/2007/TR07-064/index.html 064 db/journals/eccc/eccc14.html#JainKN07