( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Three Notes on Distributed Property Testing.

, , , , , , , , , , и . DISC, том 91 из LIPIcs, стр. 15:1-15:30. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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.

Rotei Oshman

Rotem Shlomo Lanzman

 

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

Public vs. private randomness in simultaneous multi-party communication complexity., , и . Theor. Comput. Sci., (2020)Superlinear Lower Bounds for Distributed Subgraph Detection., , и . CoRR, (2017)On the Multiparty Communication Complexity of Testing Triangle-Freeness., , и . PODC, стр. 111-120. ACM, (2017)Distributed Zero-Knowledge Proofs Over Networks., , и . SODA, стр. 2426-2458. SIAM, (2022)Quantum Distributed Algorithms for Detection of Cliques., , , , и . ITCS, том 215 из LIPIcs, стр. 35:1-35:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Proof Labeling Schemes for Reachability-Related Problems in Directed Graphs., , и . SIROCCO, том 13298 из Lecture Notes in Computer Science, стр. 21-41. Springer, (2022)Lower Bounds for Subgraph Detection in the CONGEST Model., и . OPODIS, том 95 из LIPIcs, стр. 6:1-6:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)A New Approach to Bounded Model Checking for Branching Time Logics., и . ATVA, том 4762 из Lecture Notes in Computer Science, стр. 410-424. Springer, (2007)On the Communication Complexity of Key-Agreement Protocols., , , , и . CoRR, (2021)Massively Parallel Computation in a Heterogeneous Regime., , и . CoRR, (2023)