( en | de | ru )

 

Disambiguation of "King, Valerie"

Author of the publication

copydeleteadd this publication to your clipboard
Human Contact Prediction Using Contact Graph Inference

, , and . IEEE-ACM International Conference on Green Computing and Communications and International Conference on Cyber, Physical and Social Computing, (2010)
DOI: http://doi.ieeecomputersociety.org/10.1109/GreenCom-CPSCom.2010.13

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)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)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)Communication Costs in a Geometric Communication Network., and . ICDCN, page 36-45. ACM, (2021)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)