Parth Mittal

According to our database, Parth Mittal authored at least 5 papers between 2022 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

(Δ + 1) vertex coloring in O(n) communication.

Maxime Flin, Parth Mittal

Distributed Comput., March, 2025

2024

(Δ+1) Vertex Coloring in <i>O</i>(<i>n</i>) Communication.

Maxime Flin, Parth Mittal

Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

Polynomial Pass Semi-Streaming Lower Bounds for K-Cores and Degeneracy.

Sepehr Assadi, Prantar Ghosh, Bruno Loff, Parth Mittal, Sagnik Mukhopadhyay

Proceedings of the 39th Computational Complexity Conference, 2024

2023

Brooks' Theorem in Graph Streams: A Single-Pass Semi-Streaming Algorithm for Δ-Coloring.

Sepehr Assadi, Pankaj Kumar, Parth Mittal

TheoretiCS, 2023

2022

Brooks' theorem in graph streams: a single-pass semi-streaming algorithm for ∆-coloring.

Sepehr Assadi, Pankaj Kumar, Parth Mittal

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022