Merav Parter

ORCID

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 132

Top Venues

Publications

Merav Parter
Graphs Shortcuts: New Bounds and Algorithms (Invited Talk). ICALP (2024)
Artur Czumaj, Peter Davies-Peck, Merav Parter
Component stability in low-space massively parallel computation. Distributed Comput. 37 (1) (2024)
Greg Bodwin, Bernhard Haeupler, Merav Parter
Fault-Tolerant Spanners against Bounded-Degree Edge Failures: Linearly More Faults, Almost For Free. SODA (2024)
Merav Parter, Asaf Petruschka, Seth Pettie
Connectivity Labeling and Routing with Multiple Vertex Failures. STOC (2024)
Merav Parter, Asaf Petruschka
Near-optimal distributed computation of small vertex cuts. Distributed Comput. 37 (2) (2024)
Shimon Kogan, Merav Parter
Faster and Unified Algorithms for Diameter Reducing Shortcuts and Minimum Chain Covers. SODA (2023)
Erez Kantor, Zvi Lotker, Merav Parter, David Peleg
The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication. ACM Trans. Algorithms 19 (1) (2023)
Yael Hitron, Merav Parter, Eylon Yogev
Secure Distributed Network Optimization Against Eavesdroppers. ITCS (2023)
Orr Fischer, Merav Parter
Distributed CONGEST Algorithms against Mobile Adversaries. CoRR (2023)
Merav Parter, Asaf Petruschka, Seth Pettie
Connectivity Labeling for Multiple Vertex Failures. CoRR (2023)
Orr Fischer, Merav Parter
Distributed CONGEST Algorithms against Mobile Adversaries. PODC (2023)
Shimon Kogan, Merav Parter
New Additive Emulators. ICALP (2023)
Greg Bodwin, Bernhard Haeupler, Merav Parter
Fault-Tolerant Spanners against Bounded-Degree Edge Failures: Linearly More Faults, Almost For Free. CoRR (2023)
Shimon Kogan, Merav Parter
Towards Bypassing Lower Bounds for Graph Shortcuts. ESA (2023)
Greg Bodwin, Merav Parter
Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs. J. ACM 70 (5) (2023)
Merav Parter
Secure Computation Meets Distributed Universal Optimality. FOCS (2023)
Merav Parter, Asaf Petruschka
Near-Optimal Distributed Computation of Small Vertex Cuts. CoRR (2022)
Shimon Kogan, Merav Parter
New Diameter-Reducing Shortcuts and Directed Hopsets: Breaking the Barrier. SODA (2022)
Merav Parter, Asaf Petruschka
Near-Optimal Distributed Computation of Small Vertex Cuts. DISC (2022)
Michal Dory, Merav Parter
Exponentially Faster Shortest Paths in the Congested Clique. J. ACM 69 (4) (2022)
Shimon Kogan, Merav Parter
Having Hope in Hops: New Spanners, Preservers and Lower Bounds for Hopsets. CoRR (2022)
Merav Parter
Nearly optimal vertex fault-tolerant spanners in optimal time: sequential, distributed, and parallel. STOC (2022)
Shimon Kogan, Merav Parter
Having Hope in Hops: New Spanners, Preservers and Lower Bounds for Hopsets. FOCS (2022)
Merav Parter, Asaf Petruschka
Õptimal Dual Vertex Failure Connectivity Labels. CoRR (2022)
Merav Parter
A Graph Theoretic Approach for Resilient Distributed Algorithms. PODC (2022)
Merav Parter, Asaf Petruschka
Õptimal Dual Vertex Failure Connectivity Labels. DISC (2022)
Merav Parter
Õptimal Vertex Fault-Tolerant Spanners in Õptimal Time: Sequential, Distributed and Parallel. CoRR (2022)
Shimon Kogan, Merav Parter
Beating Matrix Multiplication for n^{1/3}-Directed Shortcuts. ICALP (2022)
Yael Hitron, Merav Parter, Eylon Yogev
Broadcast CONGEST Algorithms Against Eavesdroppers. DISC (2022)
Michal Dory, Merav Parter
Fault-Tolerant Labeling and Compact Routing Schemes. CoRR (2021)
Yael Hitron, Merav Parter
Broadcast CONGEST Algorithms against Adversarial Edges. DISC (2021)
Artur Czumaj, Peter Davies, Merav Parter
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space. ACM Trans. Algorithms 17 (2) (2021)
Michal Dory, Merav Parter
Fault-Tolerant Labeling and Compact Routing Schemes. PODC (2021)
Merav Parter
Invited Talk: Resilient Distributed Algorithms. SOFSEM (2021)
Shimon Kogan, Merav Parter
Low-Congestion Shortcuts in Constant Diameter Graphs. CoRR (2021)
Artur Czumaj, Peter Davies, Merav Parter
Improved Deterministic (Δ+1) Coloring in Low-Space MPC. PODC (2021)
Artur Czumaj, Peter Davies, Merav Parter
Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC. SIAM J. Comput. 50 (5) (2021)
Artur Czumaj, Peter Davies, Merav Parter
Component Stability in Low-Space Massively Parallel Computation. CoRR (2021)
Yael Hitron, Merav Parter
General CONGEST Compilers against Adversarial Edges. DISC (2021)
Greg Bodwin, Merav Parter
Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs. PODC (2021)
Shimon Kogan, Merav Parter
New Diameter-Reducing Shortcuts and Directed Hopsets: Breaking the √n Barrier. CoRR (2021)
Karthik C. S., Merav Parter
Deterministic Replacement Path Covering. SODA (2021)
Greg Bodwin, Merav Parter
Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs. CoRR (2021)
Artur Czumaj, Peter Davies, Merav Parter
Component Stability in Low-Space Massively Parallel Computation. PODC (2021)
Artur Czumaj, Peter Davies, Merav Parter
Improved Deterministic (Δ+1)-Coloring in Low-Space MPC. CoRR (2021)
Shimon Kogan, Merav Parter
Low-Congestion Shortcuts in Constant Diameter Graphs. PODC (2021)
Erez Kantor, Zvi Lotker, Merav Parter, David Peleg
Nonuniform SINR+Voronoi diagrams are effectively uniform. Theor. Comput. Sci. (2021)
Keren Censor-Hillel, Merav Parter, Gregory Schwartzman
Derandomizing local distributed algorithms under bandwidth restrictions. Distributed Comput. 33 (3-4) (2020)
Michal Dory, Merav Parter
Exponentially Faster Shortest Paths in the Congested Clique. PODC (2020)
Artur Czumaj, Peter Davies, Merav Parter
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space. SPAA (2020)
Merav Parter, David Peleg
Fault Tolerant Approximate BFS Structures with Additive Stretch. Algorithmica 82 (12) (2020)
Artur Czumaj, Peter Davies, Merav Parter
Simple, Deterministic, Constant-Round Coloring in the Congested Clique. CoRR (2020)
Yael Hitron, Nancy A. Lynch, Cameron Musco, Merav Parter
Random Sketching, Clustering, and Short-Term Memory in Spiking Neural Networks. ITCS (2020)
Yael Hitron, Cameron Musco, Merav Parter
Spiking Neural Networks Through the Lens of Streaming Algorithms. DISC (2020)
Merav Parter
Distributed Planar Reachability in Nearly Optimal Time. DISC (2020)
Yael Hitron, Cameron Musco, Merav Parter
Spiking Neural Networks Through the Lens of Streaming Algorithms. CoRR (2020)
Julia Chuzhoy, Merav Parter, Zihan Tan
On Packing Low-Diameter Spanning Trees. ICALP (2020)
Uri Ben-Levy, Merav Parter
) Spanners and Hopsets. SODA (2020)
Moni Naor, Merav Parter, Eylon Yogev
The Power of Distributed Verifiers in Interactive Proofs. SODA (2020)
Michal Dory, Merav Parter
Exponentially Faster Shortest Paths in the Congested Clique. CoRR (2020)
Greg Bodwin, Keerti Choudhary, Merav Parter, Noa Shahar
New Fault Tolerant Subset Preservers. ICALP (2020)
Merav Parter
Distributed Constructions of Dual-Failure Fault-Tolerant Distance Preservers. DISC (2020)
Yael Hitron, Merav Parter, Gur Perri
The Computational Cost of Asynchronous Neural Communication. ITCS (2020)
Julia Chuzhoy, Merav Parter, Zihan Tan
On Packing Low-Diameter Spanning Trees. CoRR (2020)
Merav Parter
Distributed Constructions of Dual-Failure Fault-Tolerant Distance Preservers. CoRR (2020)
Yael Hitron, Merav Parter
Round-Efficient Distributed Byzantine Computation. CoRR (2020)
Karthik C. S., Merav Parter
Deterministic Replacement Path Covering. CoRR (2020)
Artur Czumaj, Peter Davies, Merav Parter
Simple, Deterministic, Constant-Round Coloring in the Congested Clique. PODC (2020)
Uri Ben-Levy, Merav Parter
New (α, β) Spanners and Hopsets. CoRR (2019)
Nancy A. Lynch, Cameron Musco, Merav Parter
Winner-Take-All Computation in Spiking Neural Networks. CoRR (2019)
Christoph Lenzen, Merav Parter, Eylon Yogev
Parallel Balanced Allocations: The Heavily Loaded Case. SPAA (2019)
Merav Parter, Eylon Yogev
Distributed Algorithms Made Secure: A Graph Theoretic Approach. SODA (2019)
Merav Parter
Small Cuts and Connectivity Certificates: A Fault Tolerant Approach. CoRR (2019)
Merav Parter, Eylon Yogev
Low Congestion Cycle Covers and Their Applications. SODA (2019)
Merav Parter
Small Cuts and Connectivity Certificates: A Fault Tolerant Approach. DISC (2019)
Merav Parter, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee
Local Computation Algorithms for Spanners. ITCS (2019)
Merav Parter, Eylon Yogev
Secure Distributed Computing Made (Nearly) Optimal. PODC (2019)
Yael Hitron, Merav Parter
Counting to Ten with Two Fingers: Compressed Counting with Spiking Neurons. CoRR (2019)
Christoph Lenzen, Merav Parter, Eylon Yogev
Parallel Balanced Allocations: The Heavily Loaded Case. CoRR (2019)
Merav Parter, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee
Local Computation Algorithms for Spanners. CoRR (2019)
Artur Czumaj, Peter Davies, Merav Parter
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space. CoRR (2019)
Jason Li, Merav Parter
Planar diameter via metric compression. STOC (2019)
Jason Li, Merav Parter
Planar Diameter via Metric Compression. CoRR (2019)
Yael Hitron, Merav Parter
Counting to Ten with Two Fingers: Compressed Counting with Spiking Neurons. ESA (2019)
Merav Parter, Eylon Yogev
Optimal Short Cycle Decomposition in Almost Linear Time. ICALP (2019)
Merav Parter, David Peleg
Fault-Tolerant Approximate BFS Structures. ACM Trans. Algorithms 14 (1) (2018)
Erez Kantor, Zvi Lotker, Merav Parter, David Peleg
The topology of wireless communication on a line. Theor. Comput. Sci. 711 (2018)
Merav Parter
(Δ+1) Coloring in the Congested Clique Model. CoRR (2018)
Moni Naor, Merav Parter, Eylon Yogev
The Power of Distributed Verifiers in Interactive Proofs. CoRR (2018)
Shirel Attali, Merav Parter, David Peleg, Shay Solomon
Wireless Expanders. SPAA (2018)
Merav Parter, Eylon Yogev
Congested Clique Algorithms for Graph Spanners. CoRR (2018)
Merav Parter, Eylon Yogev
Congested Clique Algorithms for Graph Spanners. DISC (2018)
Moni Naor, Merav Parter, Eylon Yogev
The Power of Distributed Verifiers in Interactive Proofs. Electron. Colloquium Comput. Complex. 25 (2018)
Merav Parter
(Delta+1) Coloring in the Congested Clique Model. ICALP (2018)
Shirel Attali, Merav Parter, David Peleg, Shay Solomon
Wireless Expanders. CoRR (2018)
Merav Parter, Eylon Yogev
Low Congestion Cycle Covers and their Applications. CoRR (2018)
Merav Parter, Hsin-Hao Su
Randomized (Delta+1)-Coloring in O(log* Delta) Congested Clique Rounds. DISC (2018)
Greg Bodwin, Michael Dinitz, Merav Parter, Virginia Vassilevska Williams
Optimal Vertex Fault Tolerant Spanners (for fixed stretch). SODA (2018)
Davide Bilò, Keerti Choudhary, Luciano Gualà, Stefano Leucci, Merav Parter, Guido Proietti
Efficient Oracles and Routing Schemes for Replacement Paths. STACS (2018)
Ofer Grossman, Merav Parter
Improved Deterministic Distributed Construction of Spanners. CoRR (2017)

Merav Parter.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Merav Parter