( en | de | ru )

 

Disambiguation of "Radhakrishnan, Jaikumar"

Author of the publication

copydeleteadd this publication to your clipboard
A Sampling Technique of Proving Lower Bounds for Noisy Computations.

, and . CoRR, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Radhakrishnan Srinivasan

Anand Radhakrishnan

Narayanan Radhakrishnan

Kayalvizhi Radhakrishnan

Rathnakumar Radhakrishnan

 

Other publications of authors with the same name

Online Set Packing., , , , , and . SIAM J. Comput., 41 (4): 728-746 (2012)Complete partitions of graphs., , and . SODA, page 860-869. SIAM, (2005)A Sampling Technique of Proving Lower Bounds for Noisy Computations., and . CoRR, (2015)More on a Problem of Zarankiewicz., and . ISAAC, volume 7676 of Lecture Notes in Computer Science, page 257-266. Springer, (2012)Improved Approximations of Independent Sets in Bounded-Degree Graphs., and . SWAT, volume 824 of Lecture Notes in Computer Science, page 195-206. Springer, (1994)On the Hardness of Approximating Minimum Monopoly Problems., , and . FSTTCS, volume 2556 of Lecture Notes in Computer Science, page 277-288. Springer, (2002)Sensor Networks that Are Provably Resilient., , , , and . SecureComm, page 1-10. IEEE, (2006)Deterministic Restrictions in Circuit Complexity., and . STOC, page 30-36. ACM, (1996)Expansion properties of (secure) wireless networks., and . SPAA, page 281-285. ACM, (2004)One-Shot Marton Inner Bound for Classical-Quantum Broadcast Channel., , and . IEEE Trans. Inf. Theory, 62 (5): 2836-2848 (2016)