( en | de | ru )

 

Disambiguation of "King, Valerie"

Author of the publication

copydeleteadd this publication to your clipboard
A Simple, Faster Method for Kinetic Proximity Problems.

, , , , and . CoRR, (2013)

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.

Peter King

Harald King

Lorenz King

Oskar King

Rudolf King

 

Other publications of authors with the same name

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)An Optimal EREW PRAM Algorithm for Minimum Spanning Tree Verification., , , and . Inf. Process. Lett., 62 (3): 153-159 (1997)Fast asynchronous byzantine agreement and leader election with full information., , , , and . SODA, page 1038-1047. SIAM, (2008)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)Byzantine agreement in polynomial expected time: extended abstract., and . STOC, page 401-410. ACM, (2013)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)On the Complexity of Parity Word Automata., , and . FoSSaCS, volume 2030 of Lecture Notes in Computer Science, page 276-286. Springer, (2001)