Travelled to:1 × Japan
1 × The Netherlands
1 × USA
2 × Canada
Collaborated with:H.Klauck A.Nayak J.Radhakrishnan P.Sen Z.Ji S.Upadhyay J.Watrous M.Wahler E.Ferranti R.Steiger K.Nagy L.Fontes I.Kerenidis S.Laplante M.Laurière J.Roland
Talks about:communic (3) complex (3) theorem (2) direct (2) subdistribut (1) compress (1) abstract (1) softwar (1) product (1) discrep (1)
Person: Rahul Jain
DBLP: Jain:Rahul
Contributed to:
2015
2012
201020082003Wrote 5 papers:
- ICALP-v1-2015-FontesJKLLR #communication #complexity
- Relative Discrepancy Does not Separate Information and Communication Complexity (LF, RJ, IK, SL, ML, JR), pp. 506–516.
- ICST-2012-WahlerFSJN #automation #embedded #named #testing
- CAST: Automating Software Tests for Embedded Systems (MW, EF, RS, RJ, KN), pp. 457–466.
- STOC-2010-JainJUW
- QIP = PSPACE (RJ, ZJ, SU, JW), pp. 573–582.
- STOC-2008-JainKN #bound #communication #complexity #theorem
- Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract (RJ, HK, AN), pp. 599–608.
- ICALP-2003-JainRS #communication #complexity #theorem
- A Direct Sum Theorem in Communication Complexity via Message Compression (RJ, JR, PS), pp. 300–315.