| Linear-time approximation for maximum weight matching R Duan, S Pettie Journal of the ACM (JACM) 61 (1), 1-23, 2014 | 347 | 2014 |
| Faster matrix multiplication via asymmetric hashing R Duan, H Wu, R Zhou 2023 IEEE 64th annual symposium on Foundations of Computer Science (FOCS …, 2023 | 206 | 2023 |
| A scaling algorithm for maximum weight matching in bipartite graphs R Duan, HH Su Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012 | 115 | 2012 |
| More asymmetry yields faster matrix multiplication J Alman, R Duan, VV Williams, Y Xu, Z Xu, R Zhou Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2025 | 113 | 2025 |
| Fast algorithms for (max, min)-matrix multiplication and bottleneck shortest paths R Duan, S Pettie Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009 | 111 | 2009 |
| Dual-failure distance and connectivity oracles R Duan, S Pettie Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009 | 107 | 2009 |
| Scaling algorithms for weighted matching in general graphs R Duan, S Pettie, HH Su ACM Transactions on Algorithms (TALG) 14 (1), 1-35, 2018 | 84 | 2018 |
| Approximating maximum weight matching in near-linear time R Duan, S Pettie 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 673-682, 2010 | 84 | 2010 |
| A combinatorial polynomial algorithm for the linear Arrow–Debreu market R Duan, K Mehlhorn Information and Computation 243, 112-132, 2015 | 79 | 2015 |
| An improved combinatorial polynomial algorithm for the linear Arrow-Debreu market R Duan, J Garg, K Mehlhorn Proceedings of the twenty-seventh annual ACM-SIAM symposium on discrete …, 2016 | 54 | 2016 |
| Dynamic edge coloring with improved approximation R Duan, H He, T Zhang Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 47 | 2019 |
| Faster min-plus product for monotone instances S Chi, R Duan, T Xie, T Zhang Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 44 | 2022 |
| Connectivity oracles for graphs subject to vertex failures R Duan, S Pettie SIAM Journal on Computing 49 (6), 1363-1396, 2020 | 42 | 2020 |
| Connectivity oracles for failure prone graphs R Duan, S Pettie Proceedings of the forty-second ACM Symposium on Theory of Computing, 465-474, 2010 | 37 | 2010 |
| Scaling algorithms for approximate and exact maximum weight matching R Duan, S Pettie, HH Su arXiv preprint arXiv:1112.0790, 2011 | 25 | 2011 |
| Breaking the Sorting Barrier for Directed Single-Source Shortest Paths R Duan, J Mao, X Mao, X Shu, L Yin Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 36-44, 2025 | 23 | 2025 |
| New data structures for subgraph connectivity R Duan International Colloquium on Automata, Languages, and Programming, 201-212, 2010 | 22 | 2010 |
| A randomized algorithm for single-source shortest path on undirected real-weighted graphs R Duan, J Mao, X Shu, L Yin 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 18 | 2023 |
| Improved distance sensitivity oracles via tree partitioning R Duan, T Zhang Workshop on Algorithms and Data Structures, 349-360, 2017 | 18 | 2017 |
| Maintaining exact distances under multiple edge failures R Duan, H Ren Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 16 | 2022 |
Seth PettieProfessor of Computer Science and Engineering, University of MichiganVerified email at umich.edu
