( en | de | ru )

 

Disambiguation of "King, Valerie"

Author of the publication

copydeleteadd this publication to your clipboard
Brief Announcement: Faster Asynchronous MST and Low Diameter Tree Construction with Sublinear Communication.

, and . DISC, volume 146 of LIPIcs, page 49:1-49:3. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)

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

Time-communication trade-offs for minimum spanning tree construction., and . ICDCN, page 8. ACM, (2017)Sleeping on the Job: Energy-Efficient and Robust Broadcast for Radio Networks., , , and . Algorithmica, 61 (3): 518-554 (2011)Fast asynchronous byzantine agreement and leader election with full information., , , , and . SODA, page 1038-1047. SIAM, (2008)Communication Costs in a Geometric Communication Network., and . ICDCN, page 36-45. ACM, (2021)Scalable and Secure Computation Among Strangers: Message-Competitive Byzantine Protocols., , , , and . DISC, volume 179 of LIPIcs, page 31:1-31:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Byzantine agreement in polynomial expected time: extended abstract., and . STOC, page 401-410. ACM, (2013)Brief announcement: fast scalable Byzantine agreement in the full information model with a nonadaptive adversary., and . PODC, page 304-305. ACM, (2009)Random k-out Subgraph Leaves only O(n/k) Inter-Component Edges., , , , and . FOCS, page 896-909. IEEE Computer Society, (2019)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)On the Complexity of Parity Word Automata., , and . FoSSaCS, volume 2030 of Lecture Notes in Computer Science, page 276-286. Springer, (2001)