pith. sign in

Jaikumar Radhakrishnan

Identifiers

  • name variant Jaikumar Radhakrishnan 0.60 · backfill

Papers (27)

  1. Parametric Shortest Paths in Planar Graphs cs.CC · 2018 · author #2
  2. Minimizing Branching Vertices in Distance-preserving Subgraphs cs.DS · 2018 · author #2
  3. Bounds on the Zero-Error List-Decoding Capacity of the $q/(q-1)$ Channel cs.IT · 2018 · author #2
  4. Distance-preserving Subgraphs of Interval Graphs cs.DS · 2017 · author #2
  5. One-Shot Private Classical Capacity of Quantum Wiretap Channel: Based on one-shot quantum covering lemma quant-ph · 2017 · author #1
  6. Set membership with non-adaptive bit probes cs.DS · 2016 · author #2
  7. The zero-error randomized query complexity of the pointer function cs.CC · 2016 · author #1
  8. Hypergraph Two-Coloring in the Streaming Model cs.DS · 2015 · author #1
  9. Coordination Complexity: Small Information Coordinating Large Populations cs.DS · 2015 · author #3
  10. Set Membership with a Few Bit Probes cs.DS · 2015 · author #2
  11. A Sampling Technique of Proving Lower Bounds for Noisy Computations cs.CC · 2015 · author #2
  12. How Hard is Computing Parity with Noisy Communications? cs.DC · 2015 · author #4
  13. One-shot Marton inner bound for classical-quantum broadcast channel cs.IT · 2014 · author #1
  14. On Zarankiewicz Problem and Depth-Two Superconcentrators cs.DM · 2012 · author #2
  15. On Strong Graph Partitions and Universal Steiner Trees cs.DS · 2011 · author #3
  16. Streaming algorithms for language recognition problems cs.DS · 2011 · author #3
  17. An entropy based proof of the Moore bound for irregular graphs cs.DM · 2010 · author #2
  18. Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity cs.DC · 2008 · author #3
  19. A theorem about relative entropy of quantum states with an application to privacy in quantum communication quant-ph · 2007 · author #2
  20. On divergence, relative entropy and the substate property quant-ph · 2005 · author #2
  21. Quantum search for multiple items using parallel queries quant-ph · 2004 · author #2
  22. Is partial quantum search of a database any easier? quant-ph · 2004 · author #2
  23. A direct sum theorem in communication complexity via message compression cs.CC · 2003 · author #2
  24. A lower bound for bounded round quantum communication complexity of set disjointness quant-ph · 2003 · author #2
  25. Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem cs.DM · 2001 · author #1
  26. The Quantum Complexity of Set Membership quant-ph · 2000 · author #1
  27. Analytical Studies of Strategies for Utilization of Cache Memory in Computers cond-mat.stat-mech · 2000 · author #2

Mentions

  • 1504.02035 #2 · backfill · confidence 0.70 Jaikumar Radhakrishnan
  • 1503.00321 #2 · backfill · confidence 0.70 Jaikumar Radhakrishnan
  • 1502.02290 #4 · backfill · confidence 0.70 Jaikumar Radhakrishnan
  • 1410.3248 #1 · backfill · confidence 0.70 Jaikumar Radhakrishnan
  • 1201.1377 #2 · backfill · confidence 0.70 Jaikumar Radhakrishnan
  • 1111.4766 #3 · backfill · confidence 0.70 Jaikumar Radhakrishnan
  • 1104.0848 #3 · backfill · confidence 0.70 Jaikumar Radhakrishnan
  • 1011.1058 #2 · backfill · confidence 0.70 Jaikumar Radhakrishnan
  • 0807.1267 #3 · backfill · confidence 0.70 Jaikumar Radhakrishnan
  • 0705.2437 #2 · backfill · confidence 0.70 Jaikumar Radhakrishnan

Frequent Coauthors