Valerie King
Valerie King
Professor of Computer Science, University of Victoria
Verified email at uvic.ca - Homepage
Title
Cited by
Cited by
Year
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
2941999
Randomized fully dynamic graph algorithms with polylogarithmic time per operation
MR Henzinger, V King
Journal of the ACM (JACM) 46 (4), 502-516, 1999
2851999
A faster deterministic maximum flow algorithm
V King, S Rao, R Tarjan
Journal of Algorithms 17 (3), 447-474, 1994
2511994
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
1782013
Fully dynamic biconnectivity and transitive closure
MR Henzinger, V King
Proceedings of IEEE 36th Annual Foundations of Computer Science, 664-672, 1995
1691995
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
1501995
Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology
MR Henzinger, V King, T Warnow
Algorithmica 24 (1), 1-13, 1999
1401999
Choosing a random peer
V King, J Saia
Proceedings of the twenty-third annual ACM symposium on Principles of …, 2004
1262004
A FULLY DYNAMIC ALGORITHM FOR MAINTAINING THE TRANSITIVE CLOSURE
V King, G Sagert
Journal of Computer and System Sciences 65 (1), 150-167, 2003
1132003
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
1112011
A simpler minimum spanning tree verification algorithm
V King
Algorithmica 18 (2), 263-270, 1997
1081997
Maintaining minimum spanning trees in dynamic graphs
MR Henzinger, V King
International Colloquium on Automata, Languages, and Programming, 594-604, 1997
1051997
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
1032006
Scalable leader election
V King, J Saia, V Sanwalani, E Vee
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006
1012006
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
742010
Cochrane Rapid Reviews Methods Group offers evidence-informed guidance to conduct rapid reviews
C Garritty, G Gartlehner, B Nussbaumer-Streit, VJ King, C Hamel, ...
Journal of clinical epidemiology, 2020
662020
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
632011
Maintaining minimum spanning forests in dynamic graphs
MR Henzinger, V King
SIAM Journal on Computing 31 (2), 364-374, 2001
592001
A simpler minimum spanning tree verification algorithm
V King
Workshop on Algorithms and Data Structures, 440-448, 1995
581995
On the complexity of distance-based evolutionary tree reconstruction.
V King, L Zhang, Y Zhou
SODA 3, 444-453, 2003
572003
The system can't perform the operation now. Try again later.
Articles 1–20