( en | de | ru )

 

Disambiguation of "King, Valerie"

Author of the publication

copydeleteadd this publication to your clipboard
A Faster Deterministic Maximum Flow Algorithm.

, , and . J. Algorithms, 17 (3): 447-474 (1994)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Harald King

Peter King

Lorenz King

Oskar King

Rudolf King

 

Other publications of authors with the same name

Maintaining Minimum Spanning Trees in Dynamic Graphs., and . ICALP, volume 1256 of Lecture Notes in Computer Science, page 594-604. Springer, (1997)Random k-out Subgraph Leaves only O(n/k) Inter-Component Edges., , , , and . FOCS, page 896-909. IEEE Computer Society, (2019)Communication-efficient randomized consensus., , , and . Distributed Comput., 31 (6): 489-501 (2018)A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms., and . COCOON, volume 2108 of Lecture Notes in Computer Science, page 268-277. Springer, (2001)Fast asynchronous byzantine agreement and leader election with full information., , , , and . SODA, page 1038-1047. SIAM, (2008)An Optimal EREW PRAM Algorithm for Minimum Spanning Tree Verification., , , and . Inf. Process. Lett., 62 (3): 153-159 (1997)Quorums Quicken Queries: Efficient Asynchronous Secure Multiparty Computation., , , and . CoRR, (2013)Time-communication trade-offs for minimum spanning tree construction., and . ICDCN, page 8. ACM, (2017)Communication-Efficient Randomized Consensus., , , and . DISC, volume 8784 of Lecture Notes in Computer Science, page 61-75. Springer, (2014)Utilizing the Uncertainty of Intrusion Detection to Strengthen Security for Ad Hoc Networks., , , and . ADHOC-NOW, volume 3158 of Lecture Notes in Computer Science, page 82-95. Springer, (2004)