( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Beeping Shortest Paths via Hypergraph Bipartite Decomposition.

, , и . ITCS, том 251 из LIPIcs, стр. 45:1-45:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)

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.

Ran Gelles

Ran Ran

Friedrich Gelles

Michael Gelles

Ran Zhang

 

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

Efficient Error-Correcting Codes for Sliding Windows., , и . SIAM J. Discret. Math., 34 (1): 904-937 (2020)Towards Optimal Communication Byzantine Reliable Broadcast under a Message Adversary., , , , , , , и . CoRR, (2023)Distributed Computations in Fully-Defective Networks., , , и . PODC, стр. 141-150. ACM, (2022)Correction to: Distributed computations in fully-defective networks., , , и . Distributed Comput., 36 (4): 529 (декабря 2023)Optimal Short-Circuit Resilient Formulas., , , и . J. ACM, 69 (4): 26:1-26:37 (2022)Multiparty Interactive Coding over Networks of Intersecting Broadcast Links., и . CoRR, (2021)Beeping Shortest Paths via Hypergraph Bipartite Decomposition., , и . CoRR, (2022)Efficient Multiparty Interactive Coding for Insertions, Deletions, and Substitutions., , и . PODC, стр. 137-146. ACM, (2019)Efficient Multiparty Interactive Coding - Part II: Non-Oblivious Noise., , и . IEEE Trans. Inf. Theory, 68 (7): 4723-4749 (2022)Interactive Coding Resilient to an Unknown Number of Erasures., и . OPODIS, том 153 из LIPIcs, стр. 13:1-13:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)