Computer Science – Discrete Mathematics
Scientist
Computer Science
Discrete Mathematics
Scientist
A direct sum theorem in communication complexity via message compression
A lower bound for bounded round quantum communication complexity of set disjointness
A theorem about relative entropy of quantum states with an application to privacy in quantum communication
An entropy based proof of the Moore bound for irregular graphs
Analytical Studies of Strategies for Utilization of Cache Memory in Computers
No associations
LandOfFree
Jaikumar Radhakrishnan does not yet have a rating. At this time, there are no reviews or comments for this scientist.
If you have personal experience with Jaikumar Radhakrishnan, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Jaikumar Radhakrishnan will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-P-2021