Kheeran K. Naidu

Seeking a postdoc in a theory group to tackle research questions pertaining to sublinear algorithms and beyond.

PhD in Computer Science

Algorithms and Complexity Group, University of Bristol

Home CV

Presenter

2024 | University of Bristol, UK Graph Streaming and Maximum Matching (in a Few Passes)

slides

Non-Away DayComputer Science Non-Away Day

2024 | Alexandria, Virginia, USA An Unconditional Lower Bound for Two-Pass Streaming Algorithms for Maximum Matching Approximation

slides

SODA35th ACM-SIAM Symposium on Discrete Algorithms

2023 | University of Hamburg, Germany Maximum Matching via Maximal Matching Queries

slides

STACS40th Symposium on Theoretical Aspects of Computer Science

2022 | University of Illinois, Urbana-Champaign (Virtual) Space Optimal Vertex Cover in Dynamic Streams

slides

APPROX25th International Conference on Approximation Algorithms for Combinatorial Optimization Problems

2022 | University of Sydney, Australia (Virtual) Space Optimal Vertex Cover in Dynamic Streams (with an overview of graph streaming)

slides

SACT SeminarSydney Algorithms and Computing Theory Seminar

2022 | IRIF Paris, France Space Optimal Vertex Cover in Dynamic Streams (with an overview of graph streaming)

slides

IRIF SeminarInstitut de Recherche en Informatique Fondamentale Algorithms and Complexity Seminar

2021 | University of Washington, Seattle (Virtual) On Two-Pass Streaming Algorithms for Maximum Bipartite Matching

video slides

APPROX24th International Conference on Approximation Algorithms for Combinatorial Optimization Problems

2021 | University of Bristol, UK (Virtual) Finding Matchings in the Semi-Streaming Model

slides

SCEEM PGRSchool of Computer Science, Electrical and Electronic Engineering, and Engineering Maths PGR Conference

2021 | University of Liverpool, UK (Virtual) A Unifying Class of Algorithms for Semi-Streaming Bipartite Maximum Matching

slides

BCTCS37th British Colloquium for Theoretical Computer Science