( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
How Hard is Computing Parity with Noisy Communications?

, , , и . 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.

Radhakrishnan Srinivasan

Narayanan Radhakrishnan

Anand Radhakrishnan

Kayalvizhi Radhakrishnan

Rathnakumar Radhakrishnan

 

Другие публикации лиц с тем же именем

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