| Randomized fully dynamic graph algorithms with polylogarithmic time per operation MR Henzinger, V King Journal of the ACM (JACM) 46 (4), 502-516, 1999 | 336 | 1999 |
| Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs V King 40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039 …, 1999 | 326 | 1999 |
| A faster deterministic maximum flow algorithm V King, S Rao, R Tarjan Journal of Algorithms 17 (3), 447-474, 1994 | 307 | 1994 |
| Dynamic graph connectivity in polylogarithmic worst case time BM Kapron, V King, B Mountjoy Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013 | 232 | 2013 |
| Fully dynamic biconnectivity and transitive closure MR Henzinger, V King Proceedings of IEEE 36th Annual Foundations of Computer Science, 664-672, 1995 | 195 | 1995 |
| Randomized dynamic graph algorithms with polylogarithmic time per operation MR Henzinger, V King Proceedings of the twenty-seventh annual ACM symposium on Theory of …, 1995 | 179 | 1995 |
| Breaking the O(n2) bit barrier: Scalable byzantine agreement with an adaptive adversary V King, J Saia Journal of the ACM (JACM) 58 (4), 1-24, 2011 | 178 | 2011 |
| Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology MR Henzinger, V King, T Warnow Algorithmica 24 (1), 1-13, 1999 | 151 | 1999 |
| Cochrane rapid reviews. Interim guidance from the Cochrane rapid reviews methods Group C Garritty, G Gartlehner, C Kamel, VJ King, B Nussbaumer-Streit, ... J. Clin. Epidemiol 130, 13-22, 2020 | 148 | 2020 |
| Scalable leader election V King, J Saia, V Sanwalani, E Vee SODA 6, 990-999, 2006 | 138 | 2006 |
| Maintaining minimum spanning trees in dynamic graphs MR Henzinger, V King Automata, Languages and Programming: 24th International Colloquium, ICALP'97 …, 1997 | 129 | 1997 |
| Choosing a random peer V King, J Saia Proceedings of the twenty-third annual ACM symposium on Principles of …, 2004 | 128 | 2004 |
| A FULLY DYNAMIC ALGORITHM FOR MAINTAINING THE TRANSITIVE CLOSURE V King, G Sagert Journal of Computer and System Sciences 65 (1), 150-167, 2003 | 128* | 2003 |
| Towards secure and scalable computation in peer-to-peer networks V King, J Saia, V Sanwalani, E Vee 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06 …, 2006 | 120 | 2006 |
| A simpler minimum spanning tree verification algorithm V King Algorithmica 18, 263-270, 1997 | 119 | 1997 |
| Fast asynchronous byzantine agreement and leader election with full information BM Kapron, D Kempe, V King, J Saia, V Sanwalani ACM Transactions on Algorithms (TALG) 6 (4), 1-28, 2010 | 98 | 2010 |
| Cochrane Rapid Reviews Methods Group to play a leading role in guiding the production of informed high-quality, timely research evidence syntheses C Garritty, A Stevens, G Gartlehner, V King, C Kamel, ... Systematic reviews 5, 1-5, 2016 | 80 | 2016 |
| On the complexity of distance-based evolutionary tree reconstruction. V King, L Zhang, Y Zhou SODA 3, 444-453, 2003 | 75 | 2003 |
| Maintaining minimum spanning forests in dynamic graphs MR Henzinger, V King SIAM Journal on Computing 31 (2), 364-374, 2001 | 75 | 2001 |
| Load balanced scalable byzantine agreement through quorum building, with full information V King, S Lonargan, J Saia, A Trehan International Conference on Distributed Computing and Networking, 203-214, 2011 | 72 | 2011 |
Jared SaiaUniversity of New Mexico在 cs.unm.edu 的電子郵件地址已通過驗證