| Randomized fully dynamic graph algorithms with polylogarithmic time per operation MR Henzinger, V King Journal of the ACM (JACM) 46 (4), 502-516, 1999 | 346 | 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 | 327 | 1999 |
| A faster deterministic maximum flow algorithm V King, S Rao, R Tarjan Journal of Algorithms 17 (3), 447-474, 1994 | 305 | 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 | 234 | 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 | 185 | 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 | 183 | 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 | 154 | 1999 |
| Scalable leader election V King, J Saia, V Sanwalani, E Vee SODA 6, 990-999, 2006 | 141 | 2006 |
| Maintaining minimum spanning trees in dynamic graphs MR Henzinger, V King Automata, Languages and Programming: 24th International Colloquium, ICALP'97 …, 1997 | 132 | 1997 |
| Choosing a random peer V King, J Saia Proceedings of the twenty-third annual ACM symposium on Principles of …, 2004 | 125 | 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 | 125* | 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 | 122 | 2006 |
| A simpler minimum spanning tree verification algorithm V King Algorithmica 18, 263-270, 1997 | 116 | 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 | 101 | 2010 |
| On the complexity of distance-based evolutionary tree V King, L Zhang, Y Zhou Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete …, 2003 | 77 | 2003 |
| Maintaining minimum spanning forests in dynamic graphs MR Henzinger, V King SIAM Journal on Computing 31 (2), 364-374, 2001 | 76 | 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 |
| Construction and impromptu repair of an MST in a distributed network with o (m) communication V King, S Kutten, M Thorup Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing …, 2015 | 65 | 2015 |
| A simpler minimum spanning tree verification algorithm V King Workshop on Algorithms and Data Structures, 440-448, 1995 | 60 | 1995 |
Jared SaiaUniversity of New Mexico確認したメール アドレス: cs.unm.edu