From post

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.

 

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

Should Algorithms for Random SAT and Max-SAT Be Different?, и . AAAI, стр. 3915-3921. AAAI Press, (2017)Chain, Generalization of Covering Code, and Deterministic Algorithm for k-SAT.. ICALP, том 107 из LIPIcs, стр. 88:1-88:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Simple Concurrent Labeling Algorithms for Connected Components., и . SOSA, том 69 из OASIcs, стр. 3:1-3:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Local Search for Hard SAT Formulas: The Strength of the Polynomial Law., и . AAAI, стр. 732-738. AAAI Press, (2016)Network analyses of Beijing subways., и . INDIN, стр. 1022-1024. IEEE, (2012)Multi-omics Analysis of Primary Cell Culture Models Reveals Genetic and Epigenetic Basis of Intratumoral Phenotypic Diversity., , , , , , , , , и 2 other автор(ы). Genom. Proteom. Bioinform., 17 (6): 576-589 (2019)Connected Components on a PRAM in Log Diameter Time., , и . SPAA, стр. 359-369. ACM, (2020)Connected Components in Linear Work and Near-Optimal Time., , и . SPAA, стр. 395-402. ACM, (2024)