1. Palette Sparsification Beyond (Δ +1) Vertex Coloring. In APPROX/RANDOM (LIPIcs, Vol. 176);Alon Noga;LZI,2020
2. A fast and simple randomized parallel algorithm for the maximal independent set problem
3. Sepehr Assadi , Yu Chen , and Sanjeev Khanna . 2019. Sublinear algorithms for (Δ + 1) vertex coloring . In SODA. SIAM , 767–786. Sepehr Assadi, Yu Chen, and Sanjeev Khanna. 2019. Sublinear algorithms for (Δ + 1) vertex coloring. In SODA. SIAM, 767–786.
4. Sublinear Time and Space Algorithms for Correlation Clustering via Sparse-Dense Decompositions. In ITCS (LIPIcs, Vol. 215);Assadi Sepehr;LZI,2022
5. Baruch Awerbuch , Andrew V. Goldberg , Michael Luby , and Serge A . Plotkin . 1989 . Network Decomposition and Locality in Distributed Computation. In FOCS. IEEE Computer Society , 364–369. Baruch Awerbuch, Andrew V. Goldberg, Michael Luby, and Serge A. Plotkin. 1989. Network Decomposition and Locality in Distributed Computation. In FOCS. IEEE Computer Society, 364–369.