


Остановите войну!
for scientists:
Jaikumar Radhakrishnan
Person information

Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
- [j35]Siddharth Bhandari
, Jaikumar Radhakrishnan:
Bounds on the Zero-Error List-Decoding Capacity of the q/(q - 1) Channel. IEEE Trans. Inf. Theory 68(1): 238-247 (2022) - 2021
- [c64]Jaikumar Radhakrishnan, Aravind Srinivasan:
Property B: Two-Coloring Non-Uniform Hypergraphs. FSTTCS 2021: 31:1-31:8 - [c63]Kshitij Gajjar, Girish Varma, Prerona Chatterjee, Jaikumar Radhakrishnan:
Generalized parametric path problems. UAI 2021: 536-546 - [i31]Prerona Chatterjee
, Kshitij Gajjar, Jaikumar Radhakrishnan, Girish Varma:
Generalized Parametric Path Problems. CoRR abs/2102.12886 (2021) - [i30]Shyam Dhamapurkar, Shubham Vivek Pawar, Jaikumar Radhakrishnan:
Set membership with two classical and quantum bit probes. CoRR abs/2112.14954 (2021) - 2020
- [j34]Marco Dalai
, Venkatesan Guruswami
, Jaikumar Radhakrishnan:
An Improved Bound on the Zero-Error List-Decoding Capacity of the 4/3 Channel. IEEE Trans. Inf. Theory 66(2): 749-756 (2020) - [c62]Palash Dey, Jaikumar Radhakrishnan, Santhoshini Velusamy:
Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes. MFCS 2020: 28:1-28:12
2010 – 2019
- 2019
- [c61]Kshitij Gajjar
, Jaikumar Radhakrishnan:
Minimizing Branching Vertices in Distance-Preserving Subgraphs. CSR 2019: 131-142 - [c60]Kshitij Gajjar
, Jaikumar Radhakrishnan:
Parametric Shortest Paths in Planar Graphs. FOCS 2019: 876-895 - 2018
- [j33]Sagnik Mukhopadhyay, Jaikumar Radhakrishnan, Swagato Sanyal:
Separation Between Deterministic and Randomized Query Complexity. SIAM J. Comput. 47(4): 1644-1666 (2018) - [c59]Siddharth Bhandari, Jaikumar Radhakrishnan:
Bounds on the Zero-Error List-Decoding Capacity of the q/(q-1) Channel. ISIT 2018: 906-910 - [i29]Siddharth Bhandari, Jaikumar Radhakrishnan:
Bounds on the Zero-Error List-Decoding Capacity of the q/(q-1) Channel. CoRR abs/1802.08396 (2018) - [i28]Kshitij Gajjar, Jaikumar Radhakrishnan:
Minimizing Branching Vertices in Distance-preserving Subgraphs. CoRR abs/1810.11656 (2018) - [i27]Kshitij Gajjar, Jaikumar Radhakrishnan:
Parametric Shortest Paths in Planar Graphs. CoRR abs/1811.05115 (2018) - [i26]Kshitij Gajjar, Jaikumar Radhakrishnan:
Parametric Shortest Paths in Planar Graphs. Electron. Colloquium Comput. Complex. 25: 211 (2018) - 2017
- [c58]Kshitij Gajjar
, Jaikumar Radhakrishnan:
Distance-Preserving Subgraphs of Interval Graphs. ESA 2017: 39:1-39:13 - [c57]Marco Dalai, Venkatesan Guruswami, Jaikumar Radhakrishnan:
An improved bound on the zero-error list-decoding capacity of the 4/3 channel. ISIT 2017: 1658-1662 - [c56]Mohit Garg, Jaikumar Radhakrishnan:
Set Membership with Non-Adaptive Bit Probes. STACS 2017: 38:1-38:13 - [i25]Kshitij Gajjar
, Jaikumar Radhakrishnan:
Distance-preserving Subgraphs of Interval Graphs. CoRR abs/1708.03081 (2017) - 2016
- [j32]Jaikumar Radhakrishnan, Pranab Sen, Naqueeb Ahmad Warsi:
One-Shot Marton Inner Bound for Classical-Quantum Broadcast Channel. IEEE Trans. Inf. Theory 62(5): 2836-2848 (2016) - [c55]Venkatesan Guruswami, Jaikumar Radhakrishnan:
Tight Bounds for Communication-Assisted Agreement Distillation. Computational Complexity Conference 2016: 6:1-6:17 - [c54]Jaikumar Radhakrishnan, Swagato Sanyal:
The Zero-Error Randomized Query Complexity of the Pointer Function. FSTTCS 2016: 16:1-16:13 - [c53]Prahladh Harsha
, Rahul Jain
, Jaikumar Radhakrishnan:
Partition Bound Is Quadratically Tight for Product Distributions. ICALP 2016: 135:1-135:13 - [c52]Rachel Cummings, Katrina Ligett
, Jaikumar Radhakrishnan, Aaron Roth, Zhiwei Steven Wu:
Coordination Complexity: Small Information Coordinating Large Populations. ITCS 2016: 281-290 - [i24]Jaikumar Radhakrishnan, Swagato Sanyal:
The zero-error randomized query complexity of the pointer function. CoRR abs/1607.01684 (2016) - [i23]Mohit Garg, Jaikumar Radhakrishnan:
Set membership with non-adaptive bit probes. CoRR abs/1612.09388 (2016) - [i22]Venkatesan Guruswami, Jaikumar Radhakrishnan:
Tight bounds for communication assisted agreement distillation. Electron. Colloquium Comput. Complex. 23: 33 (2016) - [i21]Jaikumar Radhakrishnan, Swagato Sanyal:
The zero-error randomized query complexity of the pointer function. Electron. Colloquium Comput. Complex. 23: 103 (2016) - 2015
- [c51]Mohit Garg, Jaikumar Radhakrishnan:
Set membership with a few bit probes. SODA 2015: 776-784 - [i20]Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Jaikumar Radhakrishnan:
How Hard is Computing Parity with Noisy Communications? CoRR abs/1502.02290 (2015) - [i19]Chinmoy Dutta, Jaikumar Radhakrishnan:
A Sampling Technique of Proving Lower Bounds for Noisy Computations. CoRR abs/1503.00321 (2015) - [i18]Mohit Garg, Jaikumar Radhakrishnan:
Set Membership with a Few Bit Probes. CoRR abs/1504.02035 (2015) - [i17]Rachel Cummings, Katrina Ligett, Jaikumar Radhakrishnan, Aaron Roth, Zhiwei Steven Wu:
Coordination Complexity: Small Information Coordinating Large Populations. CoRR abs/1508.03735 (2015) - [i16]Prahladh Harsha, Rahul Jain, Jaikumar Radhakrishnan:
Relaxed partition bound is quadratically tight for product distributions. CoRR abs/1512.01968 (2015) - [i15]Jaikumar Radhakrishnan, Saswata Shannigrahi, Rakesh Venkat:
Hypergraph Two-Coloring in the Streaming Model. CoRR abs/1512.04188 (2015) - [i14]Prahladh Harsha, Rahul Jain, Jaikumar Radhakrishnan:
Relaxed partition bound is quadratically tight for product distributions. Electron. Colloquium Comput. Complex. 22: 199 (2015) - 2014
- [c50]Arkadev Chattopadhyay, Jaikumar Radhakrishnan, Atri Rudra:
Topology Matters in Communication. FOCS 2014: 631-640 - [i13]Jaikumar Radhakrishnan, Pranab Sen, Naqueeb Warsi:
One-shot Marton inner bound for classical-quantum broadcast channel. CoRR abs/1410.3248 (2014) - [i12]Arkadev Chattopadhyay, Jaikumar Radhakrishnan, Atri Rudra:
Topology matters in communication. Electron. Colloquium Comput. Complex. 21: 74 (2014) - 2013
- [j31]Ajesh Babu, Nutan Limaye, Jaikumar Radhakrishnan, Girish Varma:
Streaming algorithms for language recognition problems. Theor. Comput. Sci. 494: 13-23 (2013) - 2012
- [j30]Yuval Emek, Magnús M. Halldórsson
, Yishay Mansour, Boaz Patt-Shamir, Jaikumar Radhakrishnan, Dror Rawitz:
Online Set Packing. SIAM J. Comput. 41(4): 728-746 (2012) - [j29]Alessandro Panconesi, Jaikumar Radhakrishnan:
Expansion properties of (secure) wireless networks. ACM Trans. Algorithms 8(3): 21:1-21:9 (2012) - [c49]Costas Busch, Chinmoy Dutta, Jaikumar Radhakrishnan, Rajmohan Rajaraman, Srinivasagopalan Srivathsan:
Split and Join: Strong Partitions and Universal Steiner Trees for Graphs. FOCS 2012: 81-90 - [c48]Chinmoy Dutta, Jaikumar Radhakrishnan:
More on a Problem of Zarankiewicz. ISAAC 2012: 257-266 - [e2]Deepak D'Souza, Telikepalli Kavitha, Jaikumar Radhakrishnan:
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012, December 15-17, 2012, Hyderabad, India. LIPIcs 18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2012, ISBN 978-3-939897-47-7 [contents] - [i11]Chinmoy Dutta, Jaikumar Radhakrishnan:
More on a Problem of Zarankiewicz. CoRR abs/1201.1377 (2012) - 2011
- [c47]Jaikumar Radhakrishnan, Saswata Shannigrahi:
Streaming Algorithms for 2-Coloring Uniform Hypergraphs. WADS 2011: 667-678 - [i10]Ajesh Babu, Nutan Limaye, Jaikumar Radhakrishnan, Girish Varma:
Streaming algorithms for language recognition problems. CoRR abs/1104.0848 (2011) - [i9]Costas Busch, Chinmoy Dutta, Jaikumar Radhakrishnan, Rajmohan Rajaraman, Srinivasagopalan Srivathsan:
Split and Join: Strong Partitions and Universal Steiner Trees for Graphs. CoRR abs/1111.4766 (2011) - 2010
- [j28]Eli Ben-Sasson, Swastik Kopparty, Jaikumar Radhakrishnan:
Subspace polynomials and limits to list decoding of Reed-Solomon codes. IEEE Trans. Inf. Theory 56(1): 113-120 (2010) - [j27]Prahladh Harsha
, Rahul Jain
, David A. McAllester, Jaikumar Radhakrishnan:
The communication complexity of correlation. IEEE Trans. Inf. Theory 56(1): 438-449 (2010) - [c46]Jaikumar Radhakrishnan, Smit Shah, Saswata Shannigrahi:
Data Structures for Storing Small Sets in the Bitprobe Model. ESA (2) 2010: 159-170 - [c45]Yuval Emek, Magnús M. Halldórsson
, Yishay Mansour, Boaz Patt-Shamir, Jaikumar Radhakrishnan, Dror Rawitz:
Online set packing and competitive scheduling of multi-part tasks. PODC 2010: 440-449 - [i8]Ajesh Babu, Jaikumar Radhakrishnan:
An entropy based proof of the Moore bound for irregular graphs. CoRR abs/1011.1058 (2010)
2000 – 2009
- 2009
- [j26]Jaikumar Radhakrishnan, Martin Rötteler, Pranab Sen:
Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup Problem. Algorithmica 55(3): 490-516 (2009) - [j25]Rahul Jain
, Jaikumar Radhakrishnan, Pranab Sen:
A property of quantum relative entropy with an application to privacy in quantum communication. J. ACM 56(6): 33:1-33:32 (2009) - [c44]Parikshit Gopalan, Jaikumar Radhakrishnan:
Finding duplicates in a data stream. SODA 2009: 402-411 - 2008
- [j24]Roberto Di Pietro
, Luigi V. Mancini
, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan:
Redoubtable Sensor Networks. ACM Trans. Inf. Syst. Secur. 11(3): 13:1-13:22 (2008) - [c43]Chinmoy Dutta, Jaikumar Radhakrishnan:
Lower Bounds for Noisy Wireless Networks using Sampling Algorithms. FOCS 2008: 394-402 - [c42]Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan:
Unassailable sensor networks. SecureComm 2008: 26 - [c41]Prahladh Harsha, Thomas P. Hayes, Hariharan Narayanan, Harald Räcke, Jaikumar Radhakrishnan:
Minimizing average latency in oblivious routing. SODA 2008: 200-207 - [c40]Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Jaikumar Radhakrishnan:
A tight lower bound for parity in noisy communication networks. SODA 2008: 1056-1065 - [i7]Rahul Jain, Pranab Sen, Jaikumar Radhakrishnan:
Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity. CoRR abs/0807.1267 (2008) - 2007
- [j23]Magnús M. Halldórsson
, Guy Kortsarz, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian:
Complete partitions of graphs. Comb. 27(5): 519-550 (2007) - [c39]Prahladh Harsha
, Rahul Jain
, David A. McAllester, Jaikumar Radhakrishnan:
The Communication Complexity of Correlation. Computational Complexity Conference 2007: 10-23 - 2006
- [c38]Eli Ben-Sasson, Swastik Kopparty, Jaikumar Radhakrishnan:
Subspace Polynomials and List Decoding of Reed-Solomon Codes. FOCS 2006: 207-216 - [c37]Sourav Chakraborty, Jaikumar Radhakrishnan, Nandakumar Raghunathan, Prashant Sasatte:
Zero Error List-Decoding Capacity of the q/(q-1) Channel. FSTTCS 2006: 129-138 - [c36]Jaikumar Radhakrishnan:
Gap Amplification in PCPs Using Lazy Random Walks. ICALP (1) 2006: 96-107 - [c35]Roberto Di Pietro
, Luigi V. Mancini
, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan:
Sensor Networks that Are Provably Resilient. SecureComm 2006: 1-10 - [c34]Chinmoy Dutta, Jaikumar Radhakrishnan:
Tradeoffs in Depth-Two Superconcentrators. STACS 2006: 372-383 - [i6]Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan:
The communication complexity of correlation. Electron. Colloquium Comput. Complex. 13(151) (2006) - 2005
- [j22]Devdatt P. Dubhashi, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan, Aravind Srinivasan:
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. J. Comput. Syst. Sci. 71(4): 467-479 (2005) - [j21]Nathan Linial, Jaikumar Radhakrishnan:
Essential covers of the cube by hyperplanes. J. Comb. Theory, Ser. A 109(2): 331-338 (2005) - [j20]Amit Deshpande, Rahul Jain
, Telikepalli Kavitha, Satyanarayana V. Lokam, Jaikumar Radhakrishnan:
Lower bounds for adaptive locally decodable codes. Random Struct. Algorithms 27(3): 358-378 (2005) - [j19]Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener:
On converting CNF to DNF. Theor. Comput. Sci. 347(1-2): 325-335 (2005) - [c33]Sourav Chakraborty, Jaikumar Radhakrishnan, Nandakumar Raghunathan:
Bounds for Error Reduction with Few Quantum Queries. APPROX-RANDOM 2005: 245-256 - [c32]Rahul Jain
, Jaikumar Radhakrishnan, Pranab Sen:
Prior Entanglement, Message Compression and Privacy in Quantum Communication. Computational Complexity Conference 2005: 285-296 - [c31]Jaikumar Radhakrishnan, Martin Rötteler
, Pranab Sen:
On the Power of Random Bases in Fourier Sampling: Hidden Subgroup Problem in the Heisenberg Group. ICALP 2005: 1399-1411 - [c30]Guy Kortsarz, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian:
Complete partitions of graphs. SODA 2005: 860-869 - [c29]Lov K. Grover, Jaikumar Radhakrishnan:
Is partial quantum search of a database any easier? SPAA 2005: 186-194 - 2004
- [c28]Roberto Di Pietro, Luigi V. Mancini, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan:
Connectivity properties of secure wireless sensor networks. SASN 2004: 53-58 - [c27]Alessandro Panconesi, Jaikumar Radhakrishnan:
Expansion properties of (secure) wireless networks. SPAA 2004: 281-285 - 2003
- [j18]Jaikumar Radhakrishnan:
A note on scrambling permutations. Random Struct. Algorithms 22(4): 435-439 (2003) - [c26]Rahul Jain
, Jaikumar Radhakrishnan, Pranab Sen:
A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness. FOCS 2003: 220-229 - [c25]Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen:
A Direct Sum Theorem in Communication Complexity via Message Compression. ICALP 2003: 300-315 - [c24]Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener:
On Converting CNF to DNF. MFCS 2003: 612-621 - [c23]Devdatt P. Dubhashi, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan, Aravind Srinivasan:
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. SODA 2003: 717-724 - [e1]Paritosh K. Pandya, Jaikumar Radhakrishnan:
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 23rd Conference, Mumbai, India, December 15-17, 2003, Proceedings. Lecture Notes in Computer Science 2914, Springer 2003, ISBN 3-540-20680-9 [contents] - [i5]Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen:
A direct sum theorem in communication complexity via message compression. CoRR cs.CC/0304020 (2003) - [i4]Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener:
On Converting CNF to DNF. Electron. Colloquium Comput. Complex. 10(017) (2003) - 2002
- [j17]Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh:
The Quantum Complexity of Set Membership. Algorithmica 34(4): 462-479 (2002) - [j16]Harry Buhrman, Peter Bro Miltersen, Jaikumar Radhakrishnan, Srinivasan Venkatesh:
Are Bitvectors Optimal? SIAM J. Comput. 31(6): 1723-1744 (2002) - [c22]Amit Deshpande, Rahul Jain
, Telikepalli Kavitha, Jaikumar Radhakrishnan, Satyanarayana V. Lokam:
Better Lower Bounds for Locally Decodable Codes. Computational Complexity Conference 2002: 184-193 - [c21]Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen:
Privacy and Interaction in Quantum Communication Complexity and a Theorem about the Relative Entropy of Quantum States. FOCS 2002: 429-438 - [c20]Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen:
The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version. FSTTCS 2002: 218-229 - [c19]S. Mishra, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian:
On the Hardness of Approximating Minimum Monopoly Problems. FSTTCS 2002: 277-288 - 2001
- [j15]Jaikumar Radhakrishnan, Venkatesh Raman:
A tradeoff between search and update in dictionaries. Inf. Process. Lett. 80(5): 243-247 (2001) - [j14]Stephen Ponzio, Jaikumar Radhakrishnan, Srinivasan Venkatesh:
The Communication Complexity of Pointer Chasing. J. Comput. Syst. Sci. 62(2): 323-355 (2001) - [c18]Jaikumar Radhakrishnan, Venkatesh Raman, S. Srinivasa Rao
:
Explicit Deterministic Constructions for Membership in the Bitprobe Model. ESA 2001: 290-299 - [i3]Jaikumar Radhakrishnan, Pranab Sen, Sundar Vishwanathan:
Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem. CoRR cs.DM/0110031 (2001) - 2000
- [j13]Jaikumar Radhakrishnan, Aravind Srinivasan:
Improved bounds and algorithms for hypergraph 2-coloring. Random Struct. Algorithms 16(1): 4-32 (2000) - [j12]Jaikumar Radhakrishnan, Amnon Ta-Shma
:
Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators. SIAM J. Discret. Math. 13(1): 2-24 (2000) - [c17]Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh:
The Quantum Complexity of Set Membership. FOCS 2000: 554-562 - [c16]Jaikumar Radhakrishnan, Pranab Sen, Sundar Vishwanathan:
Depth-3 Arithmetic Circuits for Sn2(X) and Extensions of the Graham-Pollack Theorem. FSTTCS 2000: 176-187 - [c15]Harry Buhrman, Peter Bro Miltersen, Jaikumar Radhakrishnan, Srinivasan Venkatesh:
Are bitvectors optimal? STOC 2000: 449-458 - [i2]Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh:
The Quantum Complexity of Set Membership. CoRR quant-ph/0007021 (2000)
1990 – 1999
- 1999
- [c14]Stephen Ponzio, Jaikumar Radhakrishnan, Srinivasan Venkatesh:
The Communication Complexity of Pointer Chasing Applications of Entropy and Sampling (Abstract). Computational Complexity Conference 1999: 7 - [c13]Stephen Ponzio, Jaikumar Radhakrishnan, Srinivasan Venkatesh:
The Communication Complexity of Pointer Chasing: Applications of Entropy and Sampling. STOC 1999: 602-611 - 1998
- [c12]Madhavan Mukund, K. Narayan Kumar, Jaikumar Radhakrishnan, Milind A. Sohoni:
Towards a Characterisation of Finite-State Message-Passing Systems. ASIAN 1998: 282-299 - [c11]Jaikumar Radhakrishnan, Aravind Srinivasan:
Improved Bounds and Algorithms for Hypergraph Two-Coloring. FOCS 1998: 684-693 - [c10]Madhavan Mukund, K. Narayan Kumar, Jaikumar Radhakrishnan, Milind A. Sohoni:
Robust Asynchronous Protocols Are Finite-State. ICALP 1998: 188-199 - 1997
- [j11]Magnús M. Halldórsson
, Jaikumar Radhakrishnan:
Greed is Good: Approximating Independent Sets in Sparse and Bounded-Degree Graphs. Algorithmica 18(1): 145-163 (1997) - [j10]Shiva Chaudhuri, Jaikumar Radhakrishnan:
The Complexity of Parallel Prefix Problems on Small Domains. Inf. Comput. 138(1): 1-22 (1997) - [j9]Jaikumar Radhakrishnan:
Better Lower Bounds for Monotone Threshold Formulas. J. Comput. Syst. Sci. 54(2): 221-226 (1997) - [j8]Jaikumar Radhakrishnan:
An Entropy Proof of Bregman's Theorem. J. Comb. Theory, Ser. A 77(1): 161-164 (1997) - [c9]Jaikumar Radhakrishnan, Amnon Ta-Shma
:
Tight Bounds for Depth-two Superconcentrators. FOCS 1997: 585-594 - 1996
- [j7]Jaikumar Radhakrishnan:
Pi-Sigma-Pi Threshold Formulas. Math. Syst. Theory 29(4): 357-374 (1996) - [j6]Gerth Stølting Brodal, Shiva Chaudhuri, Jaikumar Radhakrishnan:
The Randomized Complexity of Maintaining the Minimum. Nord. J. Comput. 3(4): 337-351 (1996) - [c8]Shiva Chaudhuri, Jaikumar Radhakrishnan:
Deterministic Restrictions in Circuit Complexity. STOC 1996: 30-36 - [c7]Gerth Stølting Brodal, Shiva Chaudhuri, Jaikumar Radhakrishnan:
The Randomized Complexity of Maintaining the Minimum. SWAT 1996: 4-15 - [i1]Shiva Chaudhuri, Jaikumar Radhakrishnan:
Deterministic Restrictions in Circuit Complexity. Electron. Colloquium Comput. Complex. 3(4) (1996) - 1995
- [j5]Tetsuro Nishino, Jaikumar Radhakrishnan:
On the Number of Negations Needed to Compute Parity Functions. IEICE Trans. Inf. Syst. 78-D(1): 90-91 (1995) - 1994
- [j4]Jaikumar Radhakrishnan:
Sigma Pi Sigma Threshold Formulas. Comb. 14(3): 345-374 (1994) - [j3]Jaikumar Radhakrishnan, K. V. Subrahmanyam:
Directed Monotone Contact Networks for Threshold Functions. Inf. Process. Lett. 50(4): 199-203 (1994) - [j2]Magnús M. Halldórsson, Jaikumar Radhakrishnan:
Improved Approximations of Independent Sets in Bounded-Degree Graphs via Subgraph Removal. Nord. J. Comput. 1(4): 475-492 (1994) - [c6]