Facilitated Variation: How Evolution Learns from Past Environments To Generalize to New Environments. - Merav Parter; Nadav Kashtan; Uri Alon 001 (PLoS Comput. Biol., 2008)

Distributed power control in the SINR model. - Zvi Lotker; Merav Parter; David Peleg; Yvonne-Anne Pignolet (INFOCOM, 2011)

Randomized Distributed Decision. - Pierre Fraigniaud; Amos Korman; Merav Parter; David Peleg (DISC, 2012)

Sparse Fault-Tolerant BFS Trees. - Merav Parter; David Peleg (ESA, 2013)

Generalized Perron-Frobenius Theorem for Multiple Choice Matrices, and Applications. - Chen Avin; Michael Borokhovich; Yoram Haddad 001; Erez Kantor; Zvi Lotker; Merav Parter; David Peleg (SODA, 2013)

Braess's Paradox in Wireless Networks: The Danger of Improved Technology. - Michael Dinitz; Merav Parter (DISC, 2013)

Generalized Perron-Frobenius Theorem for Nonsquare Matrices. - Chen Avin; Michael Borokhovich; Yoram Haddad 001; Erez Kantor; Zvi Lotker; Merav Parter; David Peleg (CoRR, 2013)

Bypassing Erdős' Girth Conjecture: Hybrid Stretch and Sourcewise Spanners. - Merav Parter (ICALP (2), 2014)

Randomized distributed decision. - Pierre Fraigniaud; Mika Göös; Amos Korman; Merav Parter; David Peleg (Distributed Comput., 2014)

Testing the irreducibility of nonsquare Perron-Frobenius systems. - Chen Avin; Michael Borokhovich; Yoram Haddad 001; Erez Kantor; Zvi Lotker; Merav Parter; David Peleg (Inf. Process. Lett., 2014)

DISC 2014 Review. - Merav Parter; Edward Talmage (SIGACT News, 2014)

On the Relations Between SINR Diagrams and Voronoi Diagrams. - Merav Parter; David Peleg (ADHOC-NOW, 2015)

Dual Failure Resilient BFS Structure. - Merav Parter (PODC, 2015)

Fault Tolerant BFS Structures: A Reinforcement-Backup Tradeoff. - Merav Parter; David Peleg (SPAA, 2015)

Computing in Additive Networks with Bounded-Information Codes. - Keren Censor-Hillel; Erez Kantor; Nancy A. Lynch; Merav Parter (DISC, 2015)

Nonuniform SINR+Voroni Diagrams Are Effectively Uniform. - Erez Kantor; Zvi Lotker; Merav Parter; David Peleg (DISC, 2015)

The Topology of Wireless Communication. - Erez Kantor; Zvi Lotker; Merav Parter; David Peleg (J. ACM, 2015)

MST in Log-Star Rounds of Congested Clique. - Mohsen Ghaffari 001; Merav Parter (PODC, 2016)

A Polylogarithmic Gossip Algorithm for Plurality Consensus. - Mohsen Ghaffari 001; Merav Parter (PODC, 2016)

Local-on-Average Distributed Tasks. - Merav Parter; David Peleg; Shay Solomon (SODA, 2016)

Near-Optimal Distributed Algorithms for Fault-Tolerant Tree Structures. - Mohsen Ghaffari 001; Merav Parter (SPAA, 2016)

Fault-Tolerant Logical Network Structures. - Merav Parter (Bull. EATCS, 2016)

Sparse Fault-Tolerant BFS Structures. - Merav Parter; David Peleg (ACM Trans. Algorithms, 2016)

Preserving Distances in Very Faulty Graphs. - Greg Bodwin; Fabrizio Grandoni 001; Merav Parter; Virginia Vassilevska Williams (ICALP, 2017)

Computational Tradeoffs in Biological Neural Networks: Self-Stabilizing Winner-Take-All Networks. - Nancy A. Lynch; Cameron Musco; Merav Parter (ITCS, 2017)

Near-Optimal Distributed DFS in Planar Graphs. - Mohsen Ghaffari 001; Merav Parter (DISC, 2017)

Improved Deterministic Distributed Construction of Spanners. - Ofer Grossman; Merav Parter (DISC, 2017)

Neuro-RAM Unit with Applications to Similarity Testing and Compression in Spiking Neural Networks. - Nancy A. Lynch; Cameron Musco; Merav Parter (DISC, 2017)

SINR diagram with interference cancellation. - Chen Avin; Asaf Cohen 001; Yoram Haddad 001; Erez Kantor; Zvi Lotker; Merav Parter; David Peleg (Ad Hoc Networks, 2017)

Secluded Connectivity Problems. - Shiri Chechik; Matthew P. Johnson 001; Merav Parter; David Peleg (Algorithmica, 2017)

Vertex fault tolerant additive spanners. - Merav Parter (Distributed Comput., 2017)

Distributed Computing Made Secure: A New Cycle Cover Theorem. - Merav Parter; Eylon Yogev (IACR Cryptol. ePrint Arch., 2017)

(Delta+1) Coloring in the Congested Clique Model. - Merav Parter (ICALP, 2018)

Optimal Vertex Fault Tolerant Spanners (for fixed stretch). - Greg Bodwin; Michael Dinitz; Merav Parter; Virginia Vassilevska Williams (SODA, 2018)

Wireless Expanders. - Shirel Attali; Merav Parter; David Peleg; Shay Solomon (SPAA, 2018)

Efficient Oracles and Routing Schemes for Replacement Paths. - Davide Bilò; Keerti Choudhary; Luciano Gualà; Stefano Leucci 001; Merav Parter; Guido Proietti (STACS, 2018)

Randomized (Delta+1)-Coloring in O(log* Delta) Congested Clique Rounds. - Merav Parter; Hsin-Hao Su (DISC, 2018)

Congested Clique Algorithms for Graph Spanners. - Merav Parter; Eylon Yogev (DISC, 2018)

(Δ+1) Coloring in the Congested Clique Model. - Merav Parter (CoRR, 2018)

The Power of Distributed Verifiers in Interactive Proofs. - Moni Naor; Merav Parter; Eylon Yogev (Electron. Colloquium Comput. Complex., 2018)

Fault-Tolerant Approximate BFS Structures. - Merav Parter; David Peleg (ACM Trans. Algorithms, 2018)

The topology of wireless communication on a line. - Erez Kantor; Zvi Lotker; Merav Parter; David Peleg (Theor. Comput. Sci., 2018)

Counting to Ten with Two Fingers: Compressed Counting with Spiking Neurons. - Yael Hitron; Merav Parter (ESA, 2019)

Optimal Short Cycle Decomposition in Almost Linear Time. - Merav Parter; Eylon Yogev (ICALP, 2019)

Local Computation Algorithms for Spanners. - Merav Parter; Ronitt Rubinfeld; Ali Vakilian; Anak Yodpinyanee (ITCS, 2019)

Secure Distributed Computing Made (Nearly) Optimal. - Merav Parter; Eylon Yogev (PODC, 2019)

Low Congestion Cycle Covers and Their Applications. - Merav Parter; Eylon Yogev (SODA, 2019)

Distributed Algorithms Made Secure: A Graph Theoretic Approach. - Merav Parter; Eylon Yogev (SODA, 2019)

Parallel Balanced Allocations: The Heavily Loaded Case. - Christoph Lenzen 001; Merav Parter; Eylon Yogev (SPAA, 2019)

Planar diameter via metric compression. - Jason Li 006; Merav Parter (STOC, 2019)

Small Cuts and Connectivity Certificates: A Fault Tolerant Approach. - Merav Parter (DISC, 2019)

Winner-Take-All Computation in Spiking Neural Networks. - Nancy A. Lynch; Cameron Musco; Merav Parter (CoRR, 2019)

New (α, β) Spanners and Hopsets. - Uri Ben-Levy; Merav Parter (CoRR, 2019)

Planar Diameter via Metric Compression. - Jason Li; Merav Parter (CoRR, 2019)

New Fault Tolerant Subset Preservers. - Greg Bodwin; Keerti Choudhary; Merav Parter; Noa Shahar (ICALP, 2020)

On Packing Low-Diameter Spanning Trees. - Julia Chuzhoy; Merav Parter; Zihan Tan (ICALP, 2020)

Random Sketching, Clustering, and Short-Term Memory in Spiking Neural Networks. - Yael Hitron; Nancy A. Lynch; Cameron Musco; Merav Parter (ITCS, 2020)

The Computational Cost of Asynchronous Neural Communication. - Yael Hitron; Merav Parter; Gur Perri (ITCS, 2020)

Simple, Deterministic, Constant-Round Coloring in the Congested Clique. - Artur Czumaj; Peter Davies 001; Merav Parter (PODC, 2020)

New (α, β) Spanners and Hopsets. - Uri Ben-Levy; Merav Parter (SODA, 2020)

Spiking Neural Networks Through the Lens of Streaming Algorithms. - Yael Hitron; Cameron Musco; Merav Parter (DISC, 2020)

Distributed Constructions of Dual-Failure Fault-Tolerant Distance Preservers. - Merav Parter (DISC, 2020)

Distributed Planar Reachability in Nearly Optimal Time. - Merav Parter (DISC, 2020)

Fault Tolerant Approximate BFS Structures with Additive Stretch. - Merav Parter; David Peleg (Algorithmica, 2020)

Round-Efficient Distributed Byzantine Computation. - Yael Hitron; Merav Parter (CoRR, 2020)

Derandomizing local distributed algorithms under bandwidth restrictions. - Keren Censor-Hillel; Merav Parter; Gregory Schwartzman (Distributed Comput., 2020)

Improved Deterministic (Δ+1) Coloring in Low-Space MPC. - Artur Czumaj; Peter Davies 001; Merav Parter (PODC, 2021)

Fault-Tolerant Labeling and Compact Routing Schemes. - Michal Dory; Merav Parter (PODC, 2021)

Low-Congestion Shortcuts in Constant Diameter Graphs. - Shimon Kogan; Merav Parter (PODC, 2021)

Invited Talk: Resilient Distributed Algorithms. - Merav Parter (SOFSEM, 2021)

Broadcast CONGEST Algorithms against Adversarial Edges. - Yael Hitron; Merav Parter (DISC, 2021)

General CONGEST Compilers against Adversarial Edges. - Yael Hitron; Merav Parter (DISC, 2021)

New Diameter-Reducing Shortcuts and Directed Hopsets: Breaking the √n Barrier. - Shimon Kogan; Merav Parter (CoRR, 2021)

Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC. - Artur Czumaj; Peter Davies 001; Merav Parter (SIAM J. Comput., 2021)

Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space. - Artur Czumaj; Peter Davies 001; Merav Parter (ACM Trans. Algorithms, 2021)

Nonuniform SINR+Voronoi diagrams are effectively uniform. - Erez Kantor; Zvi Lotker; Merav Parter; David Peleg (Theor. Comput. Sci., 2021)

Having Hope in Hops: New Spanners, Preservers and Lower Bounds for Hopsets. - Shimon Kogan; Merav Parter (FOCS, 2022)

Beating Matrix Multiplication for n^{1/3}-Directed Shortcuts. - Shimon Kogan; Merav Parter (ICALP, 2022)

A Graph Theoretic Approach for Resilient Distributed Algorithms. - Merav Parter (PODC, 2022)

New Diameter-Reducing Shortcuts and Directed Hopsets: Breaking the Barrier. - Shimon Kogan; Merav Parter (SODA, 2022)

Nearly optimal vertex fault-tolerant spanners in optimal time: sequential, distributed, and parallel. - Merav Parter (STOC, 2022)

Broadcast CONGEST Algorithms Against Eavesdroppers. - Yael Hitron; Merav Parter; Eylon Yogev (DISC, 2022)

Õptimal Dual Vertex Failure Connectivity Labels. - Merav Parter; Asaf Petruschka (DISC, 2022)

Õptimal Vertex Fault-Tolerant Spanners in Õptimal Time: Sequential, Distributed and Parallel. - Merav Parter (CoRR, 2022)

Exponentially Faster Shortest Paths in the Congested Clique. - Michal Dory; Merav Parter (J. ACM, 2022)

Towards Bypassing Lower Bounds for Graph Shortcuts. - Shimon Kogan; Merav Parter (ESA, 2023)

Secure Computation Meets Distributed Universal Optimality. - Merav Parter (FOCS, 2023)

New Additive Emulators. - Shimon Kogan; Merav Parter (ICALP, 2023)

Secure Distributed Network Optimization Against Eavesdroppers. - Yael Hitron; Merav Parter; Eylon Yogev (ITCS, 2023)

Distributed CONGEST Algorithms against Mobile Adversaries. - Orr Fischer; Merav Parter (PODC, 2023)

Faster and Unified Algorithms for Diameter Reducing Shortcuts and Minimum Chain Covers. - Shimon Kogan; Merav Parter (SODA, 2023)

Connectivity Labeling for Multiple Vertex Failures. - Merav Parter; Asaf Petruschka; Seth Pettie (CoRR, 2023)

The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication. - Erez Kantor; Zvi Lotker; Merav Parter; David Peleg (ACM Trans. Algorithms, 2023)

Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs. - Greg Bodwin; Merav Parter (J. ACM, 2023)

Giving Some Slack: Shortcuts and Transitive Closure Compressions. - Shimon Kogan; Merav Parter (ESA, 2024)

The Algorithmic Power of the Greene-Kleitman Theorem. - Shimon Kogan; Merav Parter (ESA, 2024)

Graphs Shortcuts: New Bounds and Algorithms (Invited Talk). - Merav Parter (ICALP, 2024)

Fault-Tolerant Spanners against Bounded-Degree Edge Failures: Linearly More Faults, Almost For Free. - Greg Bodwin; Bernhard Haeupler; Merav Parter (SODA, 2024)

Connectivity Labeling and Routing with Multiple Vertex Failures. - Merav Parter; Asaf Petruschka; Seth Pettie (STOC, 2024)

Brief Announcement: Distributed Maximum Flow in Planar Graphs. - Yaseen Abd-Elhaleem; Michal Dory; Merav Parter; Oren Weimann (DISC, 2024)

Component stability in low-space massively parallel computation. - Artur Czumaj; Peter Davies-Peck; Merav Parter (Distributed Comput., 2024)

Near-optimal distributed computation of small vertex cuts. - Merav Parter; Asaf Petruschka (Distributed Comput., 2024)

Deterministic Replacement Path Covering. - Karthik C. S. 001; Merav Parter (ACM Trans. Algorithms, 2024)

Distributed Maximum Flow in Planar Graphs. - Yaseen Abd-Elhaleem; Michal Dory; Merav Parter; Oren Weimann (PODC, 2025)

All-to-All Communication with Mobile Edge Adversary: Almost Linearly More Faults, For Free. - Orr Fischer; Merav Parter (PODC, 2025)

Brief Announcement: New Distributed Interactive Proofs for Planarity: A Matter of Left and Right. - Yuval Gil; Merav Parter (PODC, 2025)

Fully Dynamic Algorithms for Graph Spanners via Low-Diameter Router Decomposition. - Julia Chuzhoy; Merav Parter (SODA, 2025)

Having Hope in Missing Spanners: New Distance Preservers and Light Hopsets. - Shimon Kogan; Merav Parter (SODA, 2025)

Parks and Recreation: Color Fault-Tolerant Spanners Made Local. - Merav Parter; Asaf Petruschka; Shay Sapir; Elad Tzalik (SODA, 2025)

Connectivity Certificate against Bounded-Degree Faults: Simpler, Better and Supporting Vertex Faults. - Merav Parter; Elad Tzalik (SOSA, 2025)

New Oracles and Labeling Schemes for Vertex Cut Queries. - Yonggang Jiang; Merav Parter; Asaf Petruschka (CoRR, 2025)

Preserving Distances in Faulty Colored Graphs. - Merav Parter; Asaf Petruschka (CoRR, 2025)

New Distributed Interactive Proofs for Planarity: A Matter of Left and Right. - Yuval Gil; Merav Parter (CoRR, 2025)