Get started
Author

Kheeran K. Naidu

Observed names: Kheeran Naidu, Naidu, Kheeran K.
ORCID: 0000-0002-5946-4702
Observed ORCID: 0000-0002-5946-4702
OpenAlex ID: A5040838706
On Two-Pass Streaming Algorithms for Maximum Bipartite Matching
2021 · Konrad, Christian, Naidu, Kheeran K. · arXiv (Cornell University) · 16
PDF
O(log log n) Passes Is Optimal for Semi-streaming Maximal Independent Set
2024 · Sepehr Assadi, Christian Konrad, et al. · ACM Symposium on Theory of Computing (STOC) · 8
An Unconditional Lower Bound for Two-Pass Streaming Algorithms for Maximum Matching Approximation
2024 · Christian Konrad, Kheeran K. Naidu · Society for Industrial and Applied Mathematics eBooks · 5
Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams
2025 · Sepehr Assadi, Soheil Behnezhad, et al. · Society for Industrial and Applied Mathematics eBooks · 4
Unit Interval Selection in Random Order Streams
2026 · Alexandru, Cezar-Mihail, Diddapur, Adithya, et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 1
Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams
2026 · Sepehr Assadi, Soheil Behnezhad, et al. · Journal of the ACM
Unit Interval Selection in Random Order Streams
2026 · Alexandru, Cezar-Mihail, Diddapur, Adithya, et al. · arXiv (Cornell University)
PDF
On the Assadi Liu Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance
2026 · Konrad, Christian, Naidu, Kheeran K., et al. · arXiv (Cornell University)
PDF
\({\mathcal{O}}\)\({(\log\,\log\,{{n}})}\) Passes Are Optimal for Semistreaming Maximal Independent Set
2025 · Sepehr Assadi, Christian Konrad, et al. · SIAM Journal on Computing
Works count: 11
Citation count: 44
H-index: 4
I10-index: 1
Year
Topic
Type