Travelled to:1 × Canada
1 × Denmark
1 × Italy
1 × Portugal
1 × The Netherlands
3 × USA
Collaborated with:P.Sen S.Venkatesh ∅ S.Chaudhuri M.M.Halldórsson M.Rötteler R.Jain S.Ponzio H.Buhrman P.B.Miltersen M.Mukund K.N.Kumar M.A.Sohoni
Talks about:complex (3) communic (2) random (2) sampl (2) determinist (1) heisenberg (1) bitvector (1) asynchron (1) subgroup (1) restrict (1)
Person: Jaikumar Radhakrishnan
DBLP: Radhakrishnan:Jaikumar
Contributed to:
200620052003
20001999199819961994Wrote 8 papers:
- ICALP-v1-2006-Radhakrishnan #lazy evaluation #random #using
- Gap Amplification in PCPs Using Lazy Random Walks (JR), pp. 96–107.
- ICALP-2005-RadhakrishnanRS #fourier #on the #power of #problem #random
- On the Power of Random Bases in Fourier Sampling: Hidden Subgroup Problem in the Heisenberg Group (JR, MR, PS), pp. 1399–1411.
- ICALP-2003-JainRS #communication #complexity #theorem
- A Direct Sum Theorem in Communication Complexity via Message Compression (RJ, JR, PS), pp. 300–315.
- STOC-2000-BuhrmanMRV #question
- Are bitvectors optimal? (HB, PBM, JR, SV), pp. 449–458.
- STOC-1999-PonzioRV #communication #complexity #pointer
- The Communication Complexity of Pointer Chasing: Applications of Entropy and Sampling (SP, JR, SV), pp. 602–611.
- ICALP-1998-MukundKRS #finite #protocol #robust
- Robust Asynchronous Protocols Are Finite-State (MM, KNK, JR, MAS), pp. 188–199.
- STOC-1996-ChaudhuriR #complexity #strict
- Deterministic Restrictions in Circuit Complexity (SC, JR), pp. 30–36.
- STOC-1994-HalldorssonR #approximate #bound #graph #independence #set
- Greed is good: approximating independent sets in sparse and bounded-degree graphs (MMH, JR), pp. 439–448.