( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Local max-cut in smoothed polynomial time.

, , , и . STOC, стр. 429-437. ACM, (2017)

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.

Emin Sinan Ömeroglu

Lutful Mannan Osama Omer

Abrehet Mohammed Omer

Lutful Mannan Osama Omer

Osman Hussein Omer

 

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

Random Subnetworks of Random Sorting Networks., и . Electron. J. Comb., (2010)The String of Diamonds Is Tight for Rumor Spreading., , и . APPROX-RANDOM, том 81 из LIPIcs, стр. 26:1-26:9. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Random walks on stochastic hyperbolic half planar triangulations., , и . Random Struct. Algorithms, 49 (2): 213-234 (2016)Routing complexity of faulty networks., , , и . PODC, стр. 209-217. ACM, (2005)Routing complexity of faulty networks., , , и . Random Struct. Algorithms, 32 (1): 71-87 (2008)A Tight Upper Bound on Acquaintance Time of Graphs., и . CoRR, (2013)Random Infinite Permutations and the Cyclic Time Random Walk.. DRW, том AC из DMTCS Proceedings, стр. 9-16. DMTCS, (2003)An Isoperimetric Inequality for Planar Triangulations., , и . Discret. Comput. Geom., 59 (4): 802-809 (2018)Local max-cut in smoothed polynomial time., , , и . STOC, стр. 429-437. ACM, (2017)The string of diamonds is nearly tight for rumour spreading., , и . Comb. Probab. Comput., 29 (2): 190-199 (2020)