Kheeran K. Naidu

My current research interest is in algorithms for processing massive graphs; in particular, data streaming algorithms.

PhD in Computer Science

Algorithms and Complexity Group, University of Bristol

Home CV

Contact me

Talks

2023 | University of Hamburg, Germany STACS40th Symposium on Theoretical Aspects of Computer Science

slides

Maximum Matching via Maximal Matching Queries

2022 | University of Illinois, Urbana-Champaign (Virtual) APPROX25th International Conference on Approximation Algorithms for Combinatorial Optimization Problems

slides

Space Optimal Vertex Cover in Dynamic Streams

2022 | University of Sydney, Australia (Virtual) SACT SeminarSydney Algorithms and Computing Theory Seminar

slides

Space Optimal Vertex Cover in Dynamic Streams (with an overview of graph streaming)

2022 | IRIF Paris, France IRIF SeminarInstitut de Recherche en Informatique Fondamentale Algorithms and Complexity Seminar

slides

Space Optimal Vertex Cover in Dynamic Streams (with an overview of graph streaming)

2021 | University of Washington, Seattle (Virtual) APPROX24th International Conference on Approximation Algorithms for Combinatorial Optimization Problems

video slides

On Two-Pass Streaming Algorithms for Maximum Bipartite Matching

2021 | University of Bristol, UK (Virtual) SCEEM PGRSchool of Computer Science, Electrical and Electronic Engineering, and Engineering Maths PGR Conference

slides

Finding Matchings in the Semi-Streaming Model

2021 | University of Liverpool, UK (Virtual) BCTCS37th British Colloquium for Theoretical Computer Science

slides

A Unifying Class of Algorithms for Semi-Streaming Bipartite Maximum Matching