( en | de | ru )

 

Disambiguation of "King, Valerie"

Author of the publication

copydeleteadd this publication to your clipboard
Social-Greedy: a socially-based greedy routing algorithm for delay tolerant networks.

, , and . MobiOpp, page 159-162. ACM, (2010)

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

Fast asynchronous byzantine agreement and leader election with full information., , , , and . SODA, page 1038-1047. SIAM, (2008)Time-communication trade-offs for minimum spanning tree construction., and . ICDCN, page 8. ACM, (2017)Brief announcement: fast scalable Byzantine agreement in the full information model with a nonadaptive adversary., and . PODC, page 304-305. ACM, (2009)Byzantine agreement in polynomial expected time: extended abstract., and . STOC, page 401-410. ACM, (2013)Communication Costs in a Geometric Communication Network., and . ICDCN, page 36-45. ACM, (2021)Sleeping on the Job: Energy-Efficient and Robust Broadcast for Radio Networks., , , and . Algorithmica, 61 (3): 518-554 (2011)On Boolean Decision Trees with Faulty Nodes., and . ISTCS, volume 601 of Lecture Notes in Computer Science, page 24-31. Springer, (1992)On the Complexity of Parity Word Automata., , and . FoSSaCS, volume 2030 of Lecture Notes in Computer Science, page 276-286. Springer, (2001)Maintaining Minimum Spanning Trees in Dynamic Graphs., and . ICALP, volume 1256 of Lecture Notes in Computer Science, page 594-604. Springer, (1997)Communication-Efficient Randomized Consensus., , , and . DISC, volume 8784 of Lecture Notes in Computer Science, page 61-75. Springer, (2014)