Követés
Jaikumar Radhakrishnan
Cím
Hivatkozott rá
Hivatkozott rá
Év
Greed is good: Approximating independent sets in sparse and bounded-degree graphs
M Halldórsson, J Radhakrishnan
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing …, 1994
4171994
Bounds for dispersers, extractors, and depth-two superconcentrators
J Radhakrishnan, A Ta-Shma
SIAM Journal on Discrete Mathematics 13 (1), 2-24, 2000
3502000
Improved bounds and algorithms for hypergraph 2‐coloring
J Radhakrishnan, A Srinivasan
Random Structures & Algorithms 16 (1), 4-32, 2000
2272000
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
D Dubhashi, A Mei, A Panconesi, J Radhakrishnan, A Srinivasan
Journal of Computer and System Sciences 71 (4), 467-479, 2005
2002005
The communication complexity of correlation
P Harsha, R Jain, D McAllester, J Radhakrishnan
Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07), 10-23, 2007
1952007
Are bitvectors optimal?
H Buhrman, PB Miltersen, J Radhakrishnan, S Venkatesh
Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000
1502000
A direct sum theorem in communication complexity via message compression
R Jain, J Radhakrishnan, P Sen
Automata, Languages and Programming: 30th International Colloquium, ICALP …, 2003
1152003
Redoubtable sensor networks
R Di Pietro, LV Mancini, A Mei, A Panconesi, J Radhakrishnan
ACM Transactions on Information and System Security (TISSEC) 11 (3), 1-22, 2008
1122008
Entropy and counting
J Radhakrishnan
Computational mathematics, modelling and algorithms 146, 2003
1042003
Privacy and interaction in quantum communication complexity and a theorem about the relative entropy of quantum states
R Jain, J Radhakrishnan, P Sen
The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002 …, 2002
872002
A lower bound for the bounded round quantum communication complexity of set disjointness
R Jain, J Radhakrishnan, P Sen
44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003
852003
Connectivity properties of secure wireless sensor networks
R Di Pietro, LV Mancini, A Mei, A Panconesi, J Radhakrishnan
Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor …, 2004
832004
Deterministic restrictions in circuit complexity
S Chaudhuri, J Radhakrishnan
Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing …, 1996
791996
Prior entanglement, message compression and privacy in quantum communication
R Jain, J Radhakrishnan, P Sen
20th Annual IEEE Conference on Computational Complexity (CCC'05), 285-296, 2005
752005
An entropy proof of Bregman's theorem
J Radhakrishnan
Journal of combinatorial theory, Series A 77 (1), 161-164, 1997
701997
On converting CNF to DNF
PB Miltersen, J Radhakrishnan, I Wegener
Theoretical computer science 347 (1-2), 325-335, 2005
672005
A property of quantum relative entropy with an application to privacy in quantum communication
R Jain, J Radhakrishnan, P Sen
Journal of the ACM (JACM) 56 (6), 1-32, 2009
572009
Is partial quantum search of a database any easier?
LK Grover, J Radhakrishnan
Proceedings of the seventeenth annual ACM symposium on Parallelism in …, 2005
552005
Subspace polynomials and limits to list decoding of Reed–Solomon codes
E Ben-Sasson, S Kopparty, J Radhakrishnan
IEEE Transactions on Information Theory 56 (1), 113-120, 2009
522009
A tight lower bound for parity in noisy communication networks
C Dutta, Y Kanoria, D Manjunath, J Radhakrishnan
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete …, 2008
492008
A rendszer jelenleg nem tudja elvégezni a műveletet. Próbálkozzon újra később.
Cikkek 1–20