Jaikumar Radhakrishnan
From MaRDI portal
Jaikumar Radhakrishnan Q6499270
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Linear time, almost linear time, and almost always linear time: snippets from the work of Robert Endre Tarjan | 2024-07-29 | Paper |
| Set membership with two classical and quantum bit probes | 2024-06-24 | Paper |
| Randomized versus deterministic decision tree size | 2024-05-08 | Paper |
| An Entropy-Based Proof for the Moore Bound for Irregular Graphs Perspectives in Computational Complexity | 2016-09-22 | Paper |
| Coordination complexity: small information coordinating large populations Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science | 2016-04-15 | Paper |
| Streaming algorithms for language recognition problems Theoretical Computer Science | 2014-01-10 | Paper |
| An entropy proof of Bregman's theorem Journal of Combinatorial Theory. Series A | 1998-08-12 | Paper |
Research outcomes over time
This page was built for person: Jaikumar Radhakrishnan
