A Direct Sum Theorem in Communication Complexity via Message Compression - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen. A Direct Sum Theorem in Communication Complexity via Message Compression. In Jos C. M. Baeten, Jan Karel Lenstra, Joachim Parrow, Gerhard J. Woeginger, editors, Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings. Volume 2719 of Lecture Notes in Computer Science, pages 300-315, Springer, 2003. [doi]

This author has not been identified. Look up 'Rahul Jain' in GoogleThis author has not been identified. Look up 'Jaikumar Radhakrishnan' in GoogleThis author has not been identified. Look up 'Pranab Sen' in Google

runs on WebDSL