V
Valerie King
Researcher at University of Victoria
Publications - 146
Citations - 5478
Valerie King is an academic researcher from University of Victoria. The author has contributed to research in topics: Asynchronous communication & Distributed algorithm. The author has an hindex of 38, co-authored 141 publications receiving 4670 citations. Previous affiliations of Valerie King include University of California, Berkeley & University of Toronto.
Papers
More filters
Journal ArticleDOI
Cochrane Rapid Reviews Methods Group offers evidence-informed guidance to conduct rapid reviews.
Chantelle Garritty,Chantelle Garritty,Gerald Gartlehner,Barbara Nussbaumer-Streit,Valerie King,Candyce Hamel,Candyce Hamel,Chris Kamel,Lisa Affengruber,Adrienne Stevens +9 more
TL;DR: New, interim guidance to support the conduct of rapid reviews (RRs) produced within Cochrane and beyond is offered in response to requests for timely evidence syntheses for decision-making purposes including urgent health issues of high priority.
Proceedings ArticleDOI
Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs
TL;DR: The first fully dynamic algorithms for maintaining all-pairs shortest paths in digraphs with positive integer weights less than b are presented, which use simple data structures, and are deterministic.
Journal ArticleDOI
Randomized fully dynamic graph algorithms with polylogarithmic time per operation
Monika Henzinger,Valerie King +1 more
TL;DR: The first fully dynamic algorithms that maintain connectivity, bipartiteness, and approximate minimum spanning trees in polylogarithmic time per edge insertion or deletion are presented.
Proceedings ArticleDOI
Dynamic graph connectivity in polylogarithmic worst case time
TL;DR: The technique can be used to simplify and significantly speed up the preprocessing time for the emergency planning problem while matching previous bounds for an update, and to approximate the sizes of cutsets of dynamic graphs in time O(min{|S|, |V\S|}) for an oblivious adversary.
Journal ArticleDOI
A faster deterministic maximum flow algorithm
TL;DR: A deterministic version of a 1990 Cheriyan, Hagerup, and Mehlhorn randomized algorithm for computing the maximum flow on a directed graph which runs in time improves upon Alon's 1989 bound and matches the 1988 algorithm of Goldberg and Tarjan for smaller values of m/n.