Soheil Behnezhad. Time-Optimal Sublinear Algorithms for Matching and Vertex Cover. In 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022. pages 873-884, IEEE, 2021. [doi]
@inproceedings{Behnezhad21,
title = {Time-Optimal Sublinear Algorithms for Matching and Vertex Cover},
author = {Soheil Behnezhad},
year = {2021},
doi = {10.1109/FOCS52979.2021.00089},
url = {https://doi.org/10.1109/FOCS52979.2021.00089},
researchr = {https://researchr.org/publication/Behnezhad21},
cites = {0},
citedby = {0},
pages = {873-884},
booktitle = {62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022},
publisher = {IEEE},
isbn = {978-1-6654-2055-6},
}