Education

2020-2024 | PhD in Computer Science
   Thesis
  Algorithms and Complexity Group, University of Bristol Supervised by Christian Konrad

Publications  (by convention, author names are in alphabetical order)

Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams
   arxiv    SIAM
with Sepehr Assadi, Soheil Behnezhad, Christian Konrad, Janani Sundaresan SODA 2025Proceedings of the 36th ACM-SIAM Symposium on Discrete Algorithms
O(log log n) Passes is Optimal for Semi-Streaming Maximal Independent Set
   arxiv    ACM
with Sepehr Assadi, Christian Konrad, Janani Sundaresan STOC 2024Proceedings of the 56th Annual ACM Symposium on Theory of Computing (invited to SICOMP special issue)
An Unconditional Lower Bound for Two-Pass Streaming Algorithms for Maximum Matching Approximation
   SIAM    slides
with Christian Konrad SODA 2024Proceedings of the 35th ACM-SIAM Symposium on Discrete Algorithms
Maximum Matching via Maximal Matching Queries
   LIPIcs    slides
with Christian Konrad, Arun Steward STACS 2023Proceedings of the 40th Symposium on Theoretical Aspects of Computer Science
Improved Weighted Matching in the Sliding Window Model
   arxiv    LIPIcs    slides
with Cezar-Mihail Alexandru, Pavel Dvořák, Christian Konrad STACS 2023Proceedings of the 40th Symposium on Theoretical Aspects of Computer Science
Space Optimal Vertex Cover in Dynamic Streams
   arxiv    LIPIcs    slides
with Vihan Shah (student-only) APPROX 2022Proceedings of the 25th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems
On Two-Pass Streaming Algorithms for Maximum Bipartite Matching
   arxiv    LIPIcs    video    slides
with Christian Konrad APPROX 2021Proceedings of the 24th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems

Talks

Graph Streaming and Maximum Matching (in a Few Passes)
   slides
2024 | University of Bristol, UK Non-Away DayComputer Science Non-Away Day
An Unconditional Lower Bound for Two-Pass Streaming Algorithms for Maximum Matching Approximation
   slides
  2024 | Alexandria, Virginia, USA SODA35th ACM-SIAM Symposium on Discrete Algorithms
Maximum Matching via Maximal Matching Queries
   slides
  2023 | University of Hamburg, Germany STACS40th Symposium on Theoretical Aspects of Computer Science
Space Optimal Vertex Cover in Dynamic Streams
   slides
  2022 | University of Illinois, Urbana-Champaign (Virtual) APPROX25th International Conference on Approximation Algorithms for Combinatorial Optimization Problems
Space Optimal Vertex Cover in Dynamic Streams (with an overview of graph streaming)
   slides
  2022 | University of Sydney, Australia (Virtual) SACT SeminarSydney Algorithms and Computing Theory Seminar
Space Optimal Vertex Cover in Dynamic Streams (with an overview of graph streaming)
   slides
  2022 | IRIF Paris, France IRIF SeminarInstitut de Recherche en Informatique Fondamentale Algorithms and Complexity Seminar
On Two-Pass Streaming Algorithms for Maximum Bipartite Matching
   video    slides
  2021 | University of Washington, Seattle (Virtual) APPROX24th International Conference on Approximation Algorithms for Combinatorial Optimization Problems
Finding Matchings in the Semi-Streaming Model
   slides
2021 | University of Bristol, UK (Virtual) SCEEM PGRSchool of Computer Science, Electrical and Electronic Engineering, and Engineering Maths PGR Conference
A Unifying Class of Algorithms for Semi-Streaming Bipartite Maximum Matching
   slides
  2021 | University of Liverpool, UK (Virtual) BCTCS37th British Colloquium for Theoretical Computer Science

Teaching

COMSM0068Advanced Topics in Theoretical Computer Science
  2020-2023 | University of Bristol Postgraduate Lead Teaching Assistant
COMS30042Advanced Algorithms
  2020-2023 | University of Bristol Postgraduate Lead Teaching Assistant
COMS10017Algorithms I
  2020-2023 | University of Bristol Postgraduate Lead Teaching Assistant
COMS10013Mathematics for Computer Science B
  2020-2021 | University of Bristol Postgraduate Teaching Assistant
COMSM1302Overview of Computer Architecture
  2018-2020 | University of Bristol Undergraduate Teaching Assistant
COMS20002Communication, Complexity and Number Theory
  2019-2020 | University of Bristol Undergraduate Teaching Assistant
COMS10003Mathematical Methods for Computer Scientists
  2018-2020 | University of Bristol Undergraduate Teaching Assistant
COMS12200Introduction to Computer Architecture
  2018-2019 | University of Bristol Undergraduate Teaching Assistant