Parallel Reachability in Almost Linear Work and Square Root Depth

Yang P. Liu, Arun Jambulapati, Aaron Sidford. Parallel Reachability in Almost Linear Work and Square Root Depth. In David Zuckerman, editor, 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, November 9-12, 2019. pages 1664-1686, IEEE Computer Society, 2019. [doi]

@inproceedings{LiuJS19-0,
  title = {Parallel Reachability in Almost Linear Work and Square Root Depth},
  author = {Yang P. Liu and Arun Jambulapati and Aaron Sidford},
  year = {2019},
  doi = {10.1109/FOCS.2019.00098},
  url = {https://doi.org/10.1109/FOCS.2019.00098},
  researchr = {https://researchr.org/publication/LiuJS19-0},
  cites = {0},
  citedby = {0},
  pages = {1664-1686},
  booktitle = {60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, November 9-12, 2019},
  editor = {David Zuckerman},
  publisher = {IEEE Computer Society},
  isbn = {978-1-7281-4952-3},
}