( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A tight unconditional lower bound on distributed randomwalk computation.

, , и . PODC, стр. 257-266. ACM, (2011)

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.

No persons found for author name Nanongkai, Danupon
add a person with the name Nanongkai, Danupon
 

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

Distributed Exact Weighted All-Pairs Shortest Paths in Õ(n5/4) Rounds., , и . CoRR, (2017)Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time., и . CoRR, (2018)Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3 n) Worst Case Update Time., , и . SODA, стр. 470-489. SIAM, (2017)Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More., , и . SODA, стр. 1557-1576. SIAM, (2013)Nearly Optimal Communication and Query Complexity of Bipartite Matching., , , , и . FOCS, стр. 1174-1185. IEEE, (2022)Efficient distributed random walks with applications., , , и . PODC, стр. 201-210. ACM, (2010)A Faster Distributed Single-Source Shortest Paths Algorithm., и . FOCS, стр. 686-697. IEEE Computer Society, (2018)Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs., , , , , , , и . FOCS, стр. 919-930. IEEE, (2020)Computing and Testing Small Vertex Connectivity in Near-Linear Time and Queries., , и . CoRR, (2019)Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary., , , , , , и . CoRR, (2020)