( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Maintaining Minimum Spanning Trees in Dynamic Graphs.

, и . ICALP, том 1256 из Lecture Notes in Computer Science, стр. 594-604. Springer, (1997)

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.

Harald King

Peter King

Lorenz King

Oskar King

Rudolf King

 

Другие публикации лиц с тем же именем

Sleeping on the Job: Energy-Efficient and Robust Broadcast for Radio Networks., , , и . Algorithmica, 61 (3): 518-554 (2011)Time-communication trade-offs for minimum spanning tree construction., и . ICDCN, стр. 8. ACM, (2017)Fast asynchronous byzantine agreement and leader election with full information., , , , и . SODA, стр. 1038-1047. SIAM, (2008)Byzantine agreement in polynomial expected time: extended abstract., и . STOC, стр. 401-410. ACM, (2013)Brief announcement: fast scalable Byzantine agreement in the full information model with a nonadaptive adversary., и . PODC, стр. 304-305. ACM, (2009)On the Complexity of Parity Word Automata., , и . FoSSaCS, том 2030 из Lecture Notes in Computer Science, стр. 276-286. Springer, (2001)Utilizing the Uncertainty of Intrusion Detection to Strengthen Security for Ad Hoc Networks., , , и . ADHOC-NOW, том 3158 из Lecture Notes in Computer Science, стр. 82-95. Springer, (2004)Maintaining Minimum Spanning Trees in Dynamic Graphs., и . ICALP, том 1256 из Lecture Notes in Computer Science, стр. 594-604. Springer, (1997)On Boolean Decision Trees with Faulty Nodes., и . ISTCS, том 601 из Lecture Notes in Computer Science, стр. 24-31. Springer, (1992)Communication-Efficient Randomized Consensus., , , и . DISC, том 8784 из Lecture Notes in Computer Science, стр. 61-75. Springer, (2014)