( en | de | ru )

 

Disambiguation of "Radhakrishnan, Jaikumar"

Author of the publication

copydeleteadd this publication to your clipboard
Set Membership with Non-Adaptive Bit Probes.

, and . STACS, volume 66 of LIPIcs, page 38:1-38:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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

A note on scrambling permutations.. Random Struct. Algorithms, 22 (4): 435-439 (2003)Randomized versus Deterministic Decision Tree Size., , , , and . Electron. Colloquium Comput. Complex., (2022)Deterministic Restrictions in Circuit Complexity, and . Electron. Colloquium Comput. Complex., (1996)Better Lower Bounds for Monotone Threshold Formulas.. J. Comput. Syst. Sci., 54 (2): 221-226 (1997)One-Shot Marton Inner Bound for Classical-Quantum Broadcast Channel., , and . IEEE Trans. Inf. Theory, 62 (5): 2836-2848 (2016)On the Number of Negations Needed to Compute Parity Functions., and . IEICE Trans. Inf. Syst., 78-D (1): 90-91 (1995)A Sampling Technique of Proving Lower Bounds for Noisy Computations., and . CoRR, (2015)Expansion properties of (secure) wireless networks., and . SPAA, page 281-285. ACM, (2004)On the Hardness of Approximating Minimum Monopoly Problems., , and . FSTTCS, volume 2556 of Lecture Notes in Computer Science, page 277-288. Springer, (2002)More on a Problem of Zarankiewicz., and . ISAAC, volume 7676 of Lecture Notes in Computer Science, page 257-266. Springer, (2012)