受强制性开放获取政策约束的文章 - Merav Parter了解详情
无法在其他位置公开访问的文章：5 篇
Secure distributed computing made (nearly) optimal
M Parter, E Yogev
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019
强制性开放获取政策： European Commission
Sparse fault-tolerant BFS structures
M Parter, D Peleg
ACM Transactions on Algorithms (TALG) 13 (1), 1-24, 2016
强制性开放获取政策： US National Science Foundation
Fault tolerant approximate BFS structures with additive stretch
M Parter, D Peleg
Algorithmica 82 (12), 3458-3491, 2020
强制性开放获取政策： US National Science Foundation
Secure Computation Meets Distributed Universal Optimality
M Parter
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023
强制性开放获取政策： European Commission
Invited Talk: Resilient Distributed Algorithms
M Parter
SOFSEM 2021: Theory and Practice of Computer Science: 47th International …, 2021
强制性开放获取政策： European Commission
可在其他位置公开访问的文章：43 篇
Facilitated variation: how evolution learns from past environments to generalize to new environments
M Parter, N Kashtan, U Alon
PLoS computational biology 4 (11), e1000206, 2008
强制性开放获取政策： US National Institutes of Health
MST in log-star rounds of congested clique
M Ghaffari, M Parter
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016
强制性开放获取政策： US National Science Foundation
Derandomizing local distributed algorithms under bandwidth restrictions
K Censor-Hillel, M Parter, G Schwartzman
Distributed Computing 33 (3), 349-366, 2020
强制性开放获取政策： European Commission
A polylogarithmic gossip algorithm for plurality consensus
M Ghaffari, M Parter
Proceedings of the 2016 ACM symposium on principles of distributed computing …, 2016
强制性开放获取政策： US National Science Foundation
The power of distributed verifiers in interactive proofs
M Naor, M Parter, E Yogev
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
强制性开放获取政策： European Commission
Fault-tolerant approximate BFS structures
M Parter, D Peleg
ACM Transactions on Algorithms (TALG) 14 (1), 1-15, 2018
强制性开放获取政策： US National Science Foundation
Optimal vertex fault tolerant spanners (for fixed stretch)
G Bodwin, M Dinitz, M Parter, VV Williams
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
强制性开放获取政策： US National Science Foundation
Simple, deterministic, constant-round coloring in the congested clique
A Czumaj, P Davies, M Parter
Proceedings of the 39th Symposium on Principles of Distributed Computing …, 2020
强制性开放获取政策： UK Engineering and Physical Sciences Research Council, European Commission
Graph sparsification for derandomizing massively parallel computation with low space
A Czumaj, P Davies, M Parter
ACM Transactions on Algorithms (TALG) 17 (2), 1-27, 2021
强制性开放获取政策： UK Engineering and Physical Sciences Research Council, European Commission
Secluded connectivity problems
S Chechik, MP Johnson, M Parter, D Peleg
Algorithmica 79, 708-741, 2017
强制性开放获取政策： US National Science Foundation
Local-on-average distributed tasks
M Parter, D Peleg, S Solomon
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete …, 2016
强制性开放获取政策： US National Science Foundation
Exponentially faster shortest paths in the congested clique
M Dory, M Parter
ACM Journal of the ACM (JACM) 69 (4), 1-42, 2022
强制性开放获取政策： European Commission
New diameter-reducing shortcuts and directed hopsets: Breaking the barrier
S Kogan, M Parter
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
强制性开放获取政策： European Commission
Improved deterministic (Δ+ 1) coloring in low-space MPC
A Czumaj, P Davies, M Parter
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing …, 2021
强制性开放获取政策： UK Engineering and Physical Sciences Research Council, European Commission …
Optimal short cycle decomposition in almost linear time
M Parter, E Yogev
46th International Colloquium on Automata, Languages, and Programming (ICALP …, 2019
强制性开放获取政策： European Commission
出版信息和资助信息由计算机程序自动确定