PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "King, Valerie"

Author of the publication

copydeleteadd this publication to your clipboard
Predicting missing contacts in mobile social networks.

, , and . Pervasive and Mobile Computing, 8 (5): 698-716 (2012)

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.

Valerie Kiendl University of Stuttgart

Stefan King University of Stuttgart

Valerie Hietsch University of Stuttgart

Valerie Gerber University of Stuttgart

King Cho Wong University of Stuttgart

 

Other publications of authors with the same name

Fully Dynamic Biconnectivity and Transitive Closure., and . FOCS, page 664-672. IEEE Computer Society, (1995)Quorums Quicken Queries: Efficient Asynchronous Secure Multiparty Computation., , , and . CoRR, (2013)On Boolean Decision Trees with Faulty Nodes., and . ISTCS, volume 601 of Lecture Notes in Computer Science, page 24-31. Springer, (1992)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)Maintaining Minimum Spanning Trees in Dynamic Graphs., and . ICALP, volume 1256 of Lecture Notes in Computer Science, page 594-604. Springer, (1997)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)Kinetic and Stationary Point-Set Embeddability for Plane Graphs., , and . Graph Drawing, volume 7704 of Lecture Notes in Computer Science, page 279-290. Springer, (2012)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)