Urmăriți
Valerie King
Valerie King
Professor of Computer Science, University of Victoria
Adresă de e-mail confirmată pe uvic.ca - Pagina de pornire
Titlu
Citat de
Citat de
Anul
Randomized fully dynamic graph algorithms with polylogarithmic time per operation
MR Henzinger, V King
Journal of the ACM (JACM) 46 (4), 502-516, 1999
3331999
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
3191999
A faster deterministic maximum flow algorithm
V King, S Rao, R Tarjan
Journal of Algorithms 17 (3), 447-474, 1994
2971994
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
2132013
Fully dynamic biconnectivity and transitive closure
MR Henzinger, V King
Proceedings of IEEE 36th Annual Foundations of Computer Science, 664-672, 1995
1891995
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
1631995
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
1562011
Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology
MR Henzinger, V King, T Warnow
Algorithmica 24 (1), 1-13, 1999
1491999
Scalable leader election
V King, J Saia, V Sanwalani, E Vee
SODA 6, 990-999, 2006
1312006
Choosing a random peer
V King, J Saia
Proceedings of the twenty-third annual ACM symposium on Principles of …, 2004
1292004
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
Maintaining minimum spanning trees in dynamic graphs
MR Henzinger, V King
Automata, Languages and Programming: 24th International Colloquium, ICALP'97 …, 1997
1221997
A simpler minimum spanning tree verification algorithm
V King
Algorithmica 18, 263-270, 1997
1161997
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
1122006
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
912010
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
742016
Maintaining minimum spanning forests in dynamic graphs
MR Henzinger, V King
SIAM Journal on Computing 31 (2), 364-374, 2001
702001
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
692011
On the complexity of distance-based evolutionary tree reconstruction
L Zhang, V King, Y Zhout
Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete …, 2003
662003
A simpler minimum spanning tree verification algorithm
V King
Workshop on Algorithms and Data Structures, 440-448, 1995
611995
Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.
Articole 1–20