Maximum flow and minimum-cost flow in almost-linear time L Chen, R Kyng, YP Liu, R Peng, MP Gutenberg, S Sachdeva 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 228 | 2022 |

Minimum cost flows, MDPs, and ℓ_{1}-regression in nearly linear time for dense instancesJ van den Brand, YT Lee, YP Liu, T Saranurak, A Sidford, Z Song, D Wang Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 139 | 2021 |

Faster divergence maximization for faster maximum flow YP Liu, A Sidford arXiv preprint arXiv:2003.08929, 2020 | 89* | 2020 |

Faster energy maximization for faster maximum flow YP Liu, A Sidford Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020 | 80 | 2020 |

Fully dynamic electrical flows: Sparse maxflow faster than goldberg-rao Y Gao, YP Liu, R Peng 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 71 | 2022 |

Parallel reachability in almost linear work and square root depth A Jambulapati, YP Liu, A Sidford 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019 | 43 | 2019 |

Discrepancy minimization via a self-balancing walk R Alweiss, YP Liu, M Sawhney Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 42 | 2021 |

Faster maxflow via improved dynamic spectral vertex sparsifiers J van den Brand, Y Gao, A Jambulapati, YT Lee, YP Liu, R Peng, ... Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 29 | 2022 |

Near-optimal approximate discrete and continuous submodular function minimization B Axelrod, YP Liu, A Sidford Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 26 | 2020 |

Vertex Sparsification for Edge Connectivity P Chalermsook, S Das, Y Kook, B Laekhanukit, YP Liu, R Peng, M Sellke, ... Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 24* | 2021 |

Reproducibility and pseudo-determinism in log-space O Grossman, YP Liu Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 24 | 2019 |

A deterministic almost-linear time algorithm for minimum-cost flow J Van Den Brand, L Chen, R Peng, R Kyng, YP Liu, MP Gutenberg, ... 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 18 | 2023 |

Minor Sparsifiers and the Distributed Laplacian Paradigm S Forster, G Goranci, YP Liu, R Peng, X Sun, M Ye 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 18 | 2022 |

Improved iteration complexities for overconstrained *p*-norm regressionA Jambulapati, YP Liu, A Sidford Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 16 | 2022 |

Short cycles via low-diameter decompositions YP Liu, S Sachdeva, Z Yu Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 15 | 2019 |

On the upper tail problem for random hypergraphs YP Liu, Y Zhao Random Structures & Algorithms 58 (2), 179-220, 2021 | 13 | 2021 |

Chaining, group leverage score overestimates, and fast spectral hypergraph sparsification A Jambulapati, YP Liu, A Sidford Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 196-206, 2023 | 11 | 2023 |

Constant girth approximation for directed graphs in subquadratic time S Chechik, YP Liu, O Rotem, A Sidford Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020 | 11 | 2020 |

An exponential separation between MA and AM proofs of proximity T Gur, YP Liu, RD Rothblum computational complexity 30 (2), 12, 2021 | 10 | 2021 |

Online edge coloring via tree recurrences and correlation decay J Kulkarni, YP Liu, A Sah, M Sawhney, J Tarnawski Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 9 | 2022 |