| 2026 | ICALP | Color Fault-Tolerant Distance Preservers: ptimal Size in Conditionally ptimal Time. | Merav Parter, Asaf Petruschka |
| 2026 | SODA | Distributed Interactive Proofs for Planarity with Log-Star Communication. | Yuval Gil, Merav Parter |
| 2026 | SODA | New Oracles and Labeling Schemes for Vertex Cut Queries. | Yonggang Jiang, Merav Parter, Asaf Petruschka |
| 2026 | STOC | Sub-linear Secure Broadcast and Applications. | Yuval Gelles, Ilan Komargodski, Merav Parter |
| 2025 | PODC | Distributed Maximum Flow in Planar Graphs. | Yaseen Abd-Elhaleem, Michal Dory, Merav Parter, Oren Weimann |
| 2025 | PODC | All-to-All Communication with Mobile Edge Adversary: Almost Linearly More Faults, For Free. | Orr Fischer, Merav Parter |
| 2025 | PODC | Brief Announcement: New Distributed Interactive Proofs for Planarity: A Matter of Left and Right. | Yuval Gil, Merav Parter |
| 2025 | SODA | Fully Dynamic Algorithms for Graph Spanners via Low-Diameter Router Decomposition. | Julia Chuzhoy, Merav Parter |
| 2025 | SODA | Having Hope in Missing Spanners: New Distance Preservers and Light Hopsets. | Shimon Kogan, Merav Parter |
| 2025 | SODA | Parks and Recreation: Color Fault-Tolerant Spanners Made Local. | Merav Parter, Asaf Petruschka, Shay Sapir, Elad Tzalik |
| 2024 | ESA | Giving Some Slack: Shortcuts and Transitive Closure Compressions. | Shimon Kogan, Merav Parter |
| 2024 | ESA | The Algorithmic Power of the Greene-Kleitman Theorem. | Shimon Kogan, Merav Parter |
| 2024 | ICALP | Graphs Shortcuts: New Bounds and Algorithms (Invited Talk). | Merav Parter |
| 2024 | SODA | Fault-Tolerant Spanners against Bounded-Degree Edge Failures: Linearly More Faults, Almost For Free. | Greg Bodwin, Bernhard Haeupler, Merav Parter |
| 2024 | STOC | Connectivity Labeling and Routing with Multiple Vertex Failures. | Merav Parter, Asaf Petruschka, Seth Pettie |
| 2023 | ESA | Towards Bypassing Lower Bounds for Graph Shortcuts. | Shimon Kogan, Merav Parter |
| 2023 | FOCS | Secure Computation Meets Distributed Universal Optimality. | Merav Parter |
| 2023 | ICALP | New Additive Emulators. | Shimon Kogan, Merav Parter |
| 2023 | PODC | Distributed CONGEST Algorithms against Mobile Adversaries. | Orr Fischer, Merav Parter |
| 2023 | SODA | Faster and Unified Algorithms for Diameter Reducing Shortcuts and Minimum Chain Covers. | Shimon Kogan, Merav Parter |
| 2022 | FOCS | Having Hope in Hops: New Spanners, Preservers and Lower Bounds for Hopsets. | Shimon Kogan, Merav Parter |
| 2022 | ICALP | Beating Matrix Multiplication for n^{1/3}-Directed Shortcuts. | Shimon Kogan, Merav Parter |
| 2022 | PODC | A Graph Theoretic Approach for Resilient Distributed Algorithms. | Merav Parter |
| 2022 | SODA | New Diameter-Reducing Shortcuts and Directed Hopsets: Breaking the Barrier. | Shimon Kogan, Merav Parter |
| 2022 | STOC | Nearly optimal vertex fault-tolerant spanners in optimal time: sequential, distributed, and parallel. | Merav Parter |
| 2021 | PODC | Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs. | Greg Bodwin, Merav Parter |
| 2021 | PODC | Improved Deterministic (Δ+1) Coloring in Low-Space MPC. | Artur Czumaj, Peter Davies, Merav Parter |
| 2021 | PODC | Component Stability in Low-Space Massively Parallel Computation. | Artur Czumaj, Peter Davies, Merav Parter |
| 2021 | PODC | Fault-Tolerant Labeling and Compact Routing Schemes. | Michal Dory, Merav Parter |
| 2021 | PODC | Low-Congestion Shortcuts in Constant Diameter Graphs. | Shimon Kogan, Merav Parter |
| 2021 | SODA | Deterministic Replacement Path Covering. | Karthik C. S., Merav Parter |
| 2021 | SOFSEM | Invited Talk: Resilient Distributed Algorithms. | Merav Parter |
| 2020 | ICALP | New Fault Tolerant Subset Preservers. | Greg Bodwin, Keerti Choudhary, Merav Parter, Noa Shahar |
| 2020 | ICALP | On Packing Low-Diameter Spanning Trees. | Julia Chuzhoy, Merav Parter, Zihan Tan |
| 2020 | PODC | Simple, Deterministic, Constant-Round Coloring in the Congested Clique. | Artur Czumaj, Peter Davies, Merav Parter |
| 2020 | PODC | Exponentially Faster Shortest Paths in the Congested Clique. | Michal Dory, Merav Parter |
| 2020 | SODA | New ( | Uri Ben-Levy, Merav Parter |
| 2020 | SODA | The Power of Distributed Verifiers in Interactive Proofs. | Moni Naor, Merav Parter, Eylon Yogev |
| 2020 | SPAA | Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space. | Artur Czumaj, Peter Davies, Merav Parter |
| 2019 | ESA | Counting to Ten with Two Fingers: Compressed Counting with Spiking Neurons. | Yael Hitron, Merav Parter |
| 2019 | ICALP | Optimal Short Cycle Decomposition in Almost Linear Time. | Merav Parter, Eylon Yogev |
| 2019 | PODC | Secure Distributed Computing Made (Nearly) Optimal. | Merav Parter, Eylon Yogev |
| 2019 | SODA | Low Congestion Cycle Covers and Their Applications. | Merav Parter, Eylon Yogev |
| 2019 | SODA | Distributed Algorithms Made Secure: A Graph Theoretic Approach. | Merav Parter, Eylon Yogev |
| 2019 | STOC | Planar diameter via metric compression. | Jason Li, Merav Parter |
| 2019 | SPAA | Parallel Balanced Allocations: The Heavily Loaded Case. | Christoph Lenzen, Merav Parter, Eylon Yogev |
| 2018 | ICALP | (Delta+1) Coloring in the Congested Clique Model. | Merav Parter |
| 2018 | SODA | Optimal Vertex Fault Tolerant Spanners (for fixed stretch). | Greg Bodwin, Michael Dinitz, Merav Parter, Virginia Vassilevska Williams |
| 2018 | STACS | Efficient Oracles and Routing Schemes for Replacement Paths. | Davide Bil, Keerti Choudhary, Luciano Gual, Stefano Leucci, Merav Parter, Guido Proietti |
| 2018 | SPAA | Wireless Expanders. | Shirel Attali, Merav Parter, David Peleg, Shay Solomon |
| 2017 | ICALP | Preserving Distances in Very Faulty Graphs. | Greg Bodwin, Fabrizio Grandoni, Merav Parter, Virginia Vassilevska Williams |
| 2016 | PODC | MST in Log-Star Rounds of Congested Clique. | Mohsen Ghaffari, Merav Parter |
| 2016 | PODC | A Polylogarithmic Gossip Algorithm for Plurality Consensus. | Mohsen Ghaffari, Merav Parter |
| 2016 | SODA | Local-on-Average Distributed Tasks. | Merav Parter, David Peleg, Shay Solomon |
| 2016 | SPAA | Near-Optimal Distributed Algorithms for Fault-Tolerant Tree Structures. | Mohsen Ghaffari, Merav Parter |
| 2015 | FOCS | The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication. | Erez Kantor, Zvi Lotker, Merav Parter, David Peleg |
| 2015 | PODC | Dual Failure Resilient BFS Structure. | Merav Parter |
| 2015 | SPAA | Fault Tolerant BFS Structures: A Reinforcement-Backup Tradeoff. | Merav Parter, David Peleg |
| 2014 | ICALP | Bypassing Erdős' Girth Conjecture: Hybrid Stretch and Sourcewise Spanners. | Merav Parter |
| 2014 | SODA | Fault Tolerant Approximate BFS Structures. | Merav Parter, David Peleg |
| 2013 | ESA | Secluded Connectivity Problems. | Shiri Chechik, Matthew P. Johnson, Merav Parter, David Peleg |
| 2013 | ESA | Sparse Fault-Tolerant BFS Trees. | Merav Parter, David Peleg |
| 2013 | SODA | Generalized Perron-Frobenius Theorem for Multiple Choice Matrices, and Applications. | Chen Avin, Michael Borokhovich, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg |
| 2012 | SODA | SINR diagram with interference cancellation. | Chen Avin, Asaf Cohen, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg |
| 2011 | INFOCOM | Distributed power control in the SINR model. | Zvi Lotker, Merav Parter, David Peleg, Yvonne-Anne Pignolet |
| 2011 | STOC | The topology of wireless communication. | Erez Kantor, Zvi Lotker, Merav Parter, David Peleg |