Jaikumar Radhakrishnan
#42,681
Most Influential Person Now
Indian mathematician
Jaikumar Radhakrishnan's AcademicInfluence.com Rankings
Jaikumar Radhakrishnanmathematics Degrees
Mathematics
#2703
World Rank
#4119
Historical Rank
Number Theory
#389
World Rank
#486
Historical Rank
Algebra
#665
World Rank
#876
Historical Rank
Measure Theory
#3753
World Rank
#4425
Historical Rank
Download Badge
Mathematics
Why Is Jaikumar Radhakrishnan Influential?
(Suggest an Edit or Addition)According to Wikipedia, Jaikumar Radhakrishnan is an Indian computer scientist specialising in combinatorics and communication complexity. He has served as dean of the School of Technology and Computer Science at the Tata Institute of Fundamental Research, Mumbai, India, where he is currently a senior professor.
Jaikumar Radhakrishnan's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Greed is good: Approximating independent sets in sparse and bounded-degree graphs (1993) (327)
- Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators (2000) (251)
- Improved bounds and algorithms for hypergraph two-coloring (1998) (177)
- The Communication Complexity of Correlation (2007) (174)
- Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons (2003) (166)
- Are bitvectors optimal? (2000) (124)
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science (2004) (110)
- Redoubtable Sensor Networks (2008) (107)
- A Direct Sum Theorem in Communication Complexity via Message Compression (2003) (103)
- Connectivity properties of secure wireless sensor networks (2004) (86)
- Entropy and Counting ∗ (2001) (82)
- Privacy and interaction in quantum communication complexity and a theorem about the relative entropy of quantum states (2002) (73)
- A lower bound for the bounded round quantum communication complexity of set disjointness (2003) (71)
- Prior entanglement, message compression and privacy in quantum communication (2005) (66)
- Tight bounds for depth-two superconcentrators (1997) (64)
- An Entropy Proof of Bregman's Theorem (1997) (61)
- Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup Problem (2005) (57)
- Deterministic restrictions in circuit complexity (1996) (56)
- Is partial quantum search of a database any easier? (2004) (51)
- Better lower bounds for locally decodable codes (2002) (49)
- On converting CNF to DNF (2003) (44)
- Improved Approximations of Independent Sets in Bounded-Degree Graphs via Subgraph Removal (1994) (43)
- A property of quantum relative entropy with an application to privacy in quantum communication (2009) (42)
- Sensor Networks that Are Provably Resilient (2006) (36)
- Subspace Polynomials and Limits to List Decoding of Reed–Solomon Codes (2010) (35)
- The Communication Complexity of Pointer Chasing (2001) (35)
- Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity (2008) (34)
- Explicit Deterministic Constructions for Membership in the Bitprobe Model (2001) (32)
- A tight lower bound for parity in noisy communication networks (2008) (32)
- On Dinur’s proof of the PCP theorem (2006) (30)
- One-Shot Marton Inner Bound for Classical-Quantum Broadcast Channel (2014) (29)
- Topology Matters in Communication (2014) (29)
- The Randomized Complexity of Maintaining the Minimum (1996) (27)
- Minimizing average latency in oblivious routing (2008) (24)
- On the Power of Random Bases in Fourier Sampling: Hidden Subgroup Problem in the Heisenberg Group (2005) (24)
- Finding duplicates in a data stream (2009) (23)
- Data Structures for Storing Small Sets in the Bitprobe Model (2010) (23)
- Open Problems in Data Streams, Property Testing, and Related Topics (2011) (21)
- Better bounds for threshold formulas (1991) (20)
- Online set packing and competitive scheduling of multi-part tasks (2010) (20)
- Streaming algorithms for language recognition problems (2011) (20)
- Improved Bounds for Covering Complete Uniform Hypergraphs (1992) (20)
- Set membership with a few bit probes (2015) (20)
- Bounds for Error Reduction with Few Quantum Queries (2005) (19)
- Online Set Packing (2012) (19)
- Unassailable sensor networks (2008) (17)
- A new information-theoretic property about quantum states with an application to privacy in quantum communication ∗ (2009) (17)
- The communication complexity of pointer chasing. Applications of entropy and sampling (1999) (17)
- The Quantum Complexity of Set Membership (2000) (16)
- Subspace Polynomials and List Decoding of Reed-Solomon Codes (2006) (16)
- On the Hardness of Approximating Minimum Monopoly Problems (2002) (15)
- Complete partitions of graphs (2005) (15)
- A note on scrambling permutations (2003) (14)
- Tight Bounds for Communication-Assisted Agreement Distillation (2016) (14)
- An entropy based proof of the Moore bound for irregular graphs (2010) (13)
- Better Lower Bounds for Monotone Threshold Formulas (1997) (13)
- An improved bound on the zero-error list-decoding capacity of the 4/3 channel (2017) (13)
- A theorem about relative entropy of quantum states with an application to privacy in quantum communication (2007) (13)
- One-Shot Private Classical Capacity of Quantum Wiretap Channel: Based on one-shot quantum covering lemma (2017) (13)
- Quantum search for multiple items using parallel queries (2004) (12)
- Depth-3 Arithmetic Circuits for Sn2(X) and Extensions of the Graham-Pollack Theorem (2000) (12)
- Essential covers of the cube by hyperplanes (2005) (12)
- Distance-Preserving Subgraphs of Interval Graphs (2017) (11)
- The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version (2002) (11)
- Split and Join: Strong Partitions and Universal Steiner Trees for Graphs (2011) (10)
- Directed vs. undirected monotone contact networks for threshold functions (1993) (9)
- Streaming Algorithms for 2-Coloring Uniform Hypergraphs (2011) (9)
- Directed Monotone Contact Networks for Threshold Functions (1994) (8)
- Expansion properties of (secure) wireless networks (2004) (8)
- Set membership with non-adaptive bit probes (2016) (8)
- Lower Bounds for Noisy Wireless Networks using Sampling Algorithms (2008) (7)
- ΣΠΣ Threshold Formulas (1994) (7)
- Robust Asynchronous Protocols Are Finite-State (1998) (7)
- The complexity of parallel prefix problems on small domains (1992) (7)
- Gap Amplification in PCPs Using Lazy Random Walks (2006) (6)
- ∑II∑ threshold formulas (1994) (6)
- A tradeoff between search and update in dictionaries (2001) (6)
- Coordination Complexity: Small Information Coordinating Large Populations (2015) (5)
- Lower bounds for adaptive locally decodable codes (2005) (5)
- Bounds on the Zero-Error List-Decoding Capacity of the q/(q-1) Channel (2006) (5)
- Towards a Characterisation of Finite-State Message-Passing Systems (1998) (4)
- On divergence, relative entropy and the substate property (2005) (4)
- Hypergraph Two-Coloring in the Streaming Model (2015) (3)
- More on a Problem of Zarankiewicz (2012) (3)
- Tradeoffs in Depth-Two Superconcentrators (2006) (3)
- An Improved Bound on the Zero-Error List-Decoding Capacity of the 4/3 Channel (2020) (3)
- Transient stability analysis of grid with DFIG wind power plant (2014) (2)
- Analytical Studies of Strategies for Utilization of Cache Memory in Computers (2000) (2)
- Approximating the chromatic sum of a graph (1993) (2)
- Coupled Dynamical Phase Transitions in Driven Disk Packings. (2022) (2)
- The zero-error randomized query complexity of the pointer function (2016) (2)
- Minimizing Branching Vertices in Distance-preserving Subgraphs (2018) (1)
- Parametric Shortest Paths in Planar Graphs (2018) (1)
- Conversations: from Alan Turing to NP-Completeness (2014) (1)
- Separation Between Deterministic and Randomized Query Complexity (2018) (1)
- How Hard is Computing Parity with Noisy Communications? (2015) (1)
- Relaxed partition bound is quadratically tight for product distributions (2015) (1)
- Property B: Two-Coloring Non-Uniform Hypergraphs (2021) (1)
- Expansion properties of (secure) wireless networks (2012) (1)
- Pi-sigma-pi threshold formulas (1996) (1)
- The relative size of greedy independent sets in sparse and bounded-degree graphs (1994) (1)
- Bounds on the Zero-Error List-Decoding Capacity of the q/(q – 1) Channel (2022) (0)
- Sigma Pi Sigma Threshold Formulas (1994) (0)
- On the Number of Negations Needed to Compute Parity Functions (1995) (0)
- Generalized Parametric Path Problems (2021) (0)
- A Sampling Technique of Proving Lower Bounds for Noisy Computations (2015) (0)
- Linear Time, Almost Linear Time and Almost Always Linear Time: Snippets from the Work of Robert Endre Tarjan (2011) (0)
- On Some Communication Complexity Problems Related to THreshold Functions (1993) (0)
- Predecessor Search in Cell Probe Model-part 1 (2012) (0)
- A discrepancy result on Multiparty Set Disjointness (2012) (0)
- Fields Medals and Nevanlinna Prize: 2002 (2002) (0)
- A superlinear lower bound for undirected monotone contact (2005) (0)
- Frontmatter, Table of Contents, Preface, Conference Organization (2012) (0)
- Applications to VLSI design and time-space tradeoffs (2011) (0)
- Randomized versus Deterministic Decision Tree Size (2022) (0)
- Interactive Proof Systems (2011) (0)
- Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes (2020) (0)
- On Zarankiewicz Problem and Depth-Two Superconcentrators (2012) (0)
- Coloring and Maximal Independent Set (MIS). (0)
- On monotone undirected contact networks computing T^n_ (1993) (0)
- Set membership with two classical and quantum bit probes (2021) (0)
- Random Regular Graph : Generation and Cover Time (2011) (0)
- On Strong Graph Partitions and Universal Steiner Trees (2011) (0)
- Tight bounds for dept h-two superconcentrators (1997) (0)
This paper list is powered by the following services:
Other Resources About Jaikumar Radhakrishnan
What Schools Are Affiliated With Jaikumar Radhakrishnan?
Jaikumar Radhakrishnan is affiliated with the following schools:
