Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMerav Parter
מרב פרטר
Person information
- unicode name: מרב פרטר
- affiliation: Weizmann Institute of Science, Department of Computer Science and Applied Mathematics, Rehovot, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2024
[j22]Artur Czumaj, Peter Davies-Peck, Merav Parter:
Component stability in low-space massively parallel computation. Distributed Comput. 37(1): 35-64 (2024)- [j21]Merav Parter, Asaf Petruschka:
Near-optimal distributed computation of small vertex cuts. Distributed Comput. 37(2): 67-88 (2024) - 2023
- [j20]Greg Bodwin
, Merav Parter:
Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs. J. ACM 70(5): 28:1-28:24 (2023) - [j19]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): 1:1-1:45 (2023) - 2022
- [j18]Michal Dory, Merav Parter:
Exponentially Faster Shortest Paths in the Congested Clique. J. ACM 69(4): 29:1-29:42 (2022) - 2021
- [j17]Artur Czumaj, Peter Davies, Merav Parter:
Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC. SIAM J. Comput. 50(5): 1603-1626 (2021) - [j16]Artur Czumaj, Peter Davies, Merav Parter:
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space. ACM Trans. Algorithms 17(2): 16:1-16:27 (2021) - [j15]Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
Nonuniform SINR+Voronoi diagrams are effectively uniform. Theor. Comput. Sci. 878-879: 53-66 (2021) - 2020
- [j14]Merav Parter, David Peleg:
Fault Tolerant Approximate BFS Structures with Additive Stretch. Algorithmica 82(12): 3458-3491 (2020) - [j13]Keren Censor-Hillel, Merav Parter, Gregory Schwartzman:
Derandomizing local distributed algorithms under bandwidth restrictions. Distributed Comput. 33(3-4): 349-366 (2020) - 2018
- [j12]Merav Parter, David Peleg:
Fault-Tolerant Approximate BFS Structures. ACM Trans. Algorithms 14(1): 10:1-10:15 (2018) - [j11]Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
The topology of wireless communication on a line. Theor. Comput. Sci. 711: 105-108 (2018) - 2017
- [j10]Chen Avin, Asaf Cohen, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
SINR diagram with interference cancellation. Ad Hoc Networks 54: 1-16 (2017) - [j9]Shiri Chechik, Matthew P. Johnson, Merav Parter, David Peleg:
Secluded Connectivity Problems. Algorithmica 79(3): 708-741 (2017) - [j8]Merav Parter:
Vertex fault tolerant additive spanners. Distributed Comput. 30(5): 357-372 (2017) - 2016
- [j7]Merav Parter:
Fault-Tolerant Logical Network Structures. Bull. EATCS 118 (2016) - [j6]Merav Parter, David Peleg:
Sparse Fault-Tolerant BFS Structures. ACM Trans. Algorithms 13(1): 11:1-11:24 (2016) - 2015
- [j5]Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
The Topology of Wireless Communication. J. ACM 62(5): 37:1-37:32 (2015) - 2014
- [j4]Pierre Fraigniaud, Mika Göös, Amos Korman, Merav Parter, David Peleg:
Randomized distributed decision. Distributed Comput. 27(6): 419-434 (2014) - [j3]Chen Avin, Michael Borokhovich, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
Testing the irreducibility of nonsquare Perron-Frobenius systems. Inf. Process. Lett. 114(12): 728-733 (2014) - [j2]Merav Parter, Edward Talmage:
DISC 2014 Review. SIGACT News 45(4): 94-99 (2014) - 2008
- [j1]Merav Parter, Nadav Kashtan, Uri Alon:
Facilitated Variation: How Evolution Learns from Past Environments To Generalize to New Environments. PLoS Comput. Biol. 4(11) (2008)
Conference and Workshop Papers
- 2024
- [c79]Greg Bodwin, Bernhard Haeupler, Merav Parter:
Fault-Tolerant Spanners against Bounded-Degree Edge Failures: Linearly More Faults, Almost For Free. SODA 2024: 2609-2642 - [c78]Merav Parter, Asaf Petruschka, Seth Pettie:
Connectivity Labeling and Routing with Multiple Vertex Failures. STOC 2024: 823-834 - 2023
- [c77]Shimon Kogan, Merav Parter:
Towards Bypassing Lower Bounds for Graph Shortcuts. ESA 2023: 73:1-73:16 - [c76]Merav Parter:
Secure Computation Meets Distributed Universal Optimality. FOCS 2023: 2336-2368 - [c75]Shimon Kogan, Merav Parter:
New Additive Emulators. ICALP 2023: 85:1-85:17 - [c74]Yael Hitron, Merav Parter, Eylon Yogev:
Secure Distributed Network Optimization Against Eavesdroppers. ITCS 2023: 71:1-71:20 - [c73]Orr Fischer, Merav Parter:
Distributed CONGEST Algorithms against Mobile Adversaries. PODC 2023: 262-273 - [c72]Shimon Kogan, Merav Parter:
Faster and Unified Algorithms for Diameter Reducing Shortcuts and Minimum Chain Covers. SODA 2023: 212-239 - 2022
- [c71]Shimon Kogan, Merav Parter:
Having Hope in Hops: New Spanners, Preservers and Lower Bounds for Hopsets. FOCS 2022: 766-777 - [c70]Shimon Kogan, Merav Parter:
Beating Matrix Multiplication for n^{1/3}-Directed Shortcuts. ICALP 2022: 82:1-82:20 - [c69]Merav Parter:
A Graph Theoretic Approach for Resilient Distributed Algorithms. PODC 2022: 324 - [c68]Shimon Kogan, Merav Parter:
New Diameter-Reducing Shortcuts and Directed Hopsets: Breaking the Barrier. SODA 2022: 1326-1341 - [c67]Merav Parter:
Nearly optimal vertex fault-tolerant spanners in optimal time: sequential, distributed, and parallel. STOC 2022: 1080-1092 - [c66]Yael Hitron, Merav Parter, Eylon Yogev:
Broadcast CONGEST Algorithms Against Eavesdroppers. DISC 2022: 27:1-27:19 - [c65]Merav Parter, Asaf Petruschka:
Near-Optimal Distributed Computation of Small Vertex Cuts. DISC 2022: 31:1-31:21 - [c64]Merav Parter, Asaf Petruschka:
Õptimal Dual Vertex Failure Connectivity Labels. DISC 2022: 32:1-32:19 - 2021
- [c63]Shimon Kogan, Merav Parter:
Low-Congestion Shortcuts in Constant Diameter Graphs. PODC 2021: 203-211 - [c62]Greg Bodwin, Merav Parter:
Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs. PODC 2021: 435-443 - [c61]Michal Dory, Merav Parter:
Fault-Tolerant Labeling and Compact Routing Schemes. PODC 2021: 445-455 - [c60]Artur Czumaj, Peter Davies, Merav Parter:
Improved Deterministic (Δ+1) Coloring in Low-Space MPC. PODC 2021: 469-479 - [c59]Artur Czumaj, Peter Davies, Merav Parter:
Component Stability in Low-Space Massively Parallel Computation. PODC 2021: 481-491 - [c58]Karthik C. S., Merav Parter:
Deterministic Replacement Path Covering. SODA 2021: 704-723 - [c57]Merav Parter:
Invited Talk: Resilient Distributed Algorithms. SOFSEM 2021: 28-42 - [c56]Yael Hitron, Merav Parter:
Broadcast CONGEST Algorithms against Adversarial Edges. DISC 2021: 23:1-23:19 - [c55]Yael Hitron, Merav Parter:
General CONGEST Compilers against Adversarial Edges. DISC 2021: 24:1-24:18 - 2020
- [c54]Greg Bodwin, Keerti Choudhary, Merav Parter, Noa Shahar:
New Fault Tolerant Subset Preservers. ICALP 2020: 15:1-15:19 - [c53]Julia Chuzhoy, Merav Parter, Zihan Tan:
On Packing Low-Diameter Spanning Trees. ICALP 2020: 33:1-33:18 - [c52]Yael Hitron, Nancy A. Lynch, Cameron Musco, Merav Parter:
Random Sketching, Clustering, and Short-Term Memory in Spiking Neural Networks. ITCS 2020: 23:1-23:31 - [c51]Yael Hitron, Merav Parter, Gur Perri:
The Computational Cost of Asynchronous Neural Communication. ITCS 2020: 48:1-48:47 - [c50]Michal Dory, Merav Parter:
Exponentially Faster Shortest Paths in the Congested Clique. PODC 2020: 59-68 - [c49]Artur Czumaj, Peter Davies, Merav Parter:
Simple, Deterministic, Constant-Round Coloring in the Congested Clique. PODC 2020: 309-318 - [c48]Moni Naor, Merav Parter, Eylon Yogev:
The Power of Distributed Verifiers in Interactive Proofs. SODA 2020: 1096-115 - [c47]Uri Ben-Levy, Merav Parter:
New (α, β) Spanners and Hopsets. SODA 2020: 1695-1714 - [c46]Artur Czumaj, Peter Davies, Merav Parter:
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space. SPAA 2020: 175-185 - [c45]Yael Hitron, Cameron Musco, Merav Parter:
Spiking Neural Networks Through the Lens of Streaming Algorithms. DISC 2020: 10:1-10:18 - [c44]Merav Parter:
Distributed Constructions of Dual-Failure Fault-Tolerant Distance Preservers. DISC 2020: 21:1-21:17 - [c43]Merav Parter:
Distributed Planar Reachability in Nearly Optimal Time. DISC 2020: 38:1-38:17 - 2019
- [c42]Yael Hitron, Merav Parter:
Counting to Ten with Two Fingers: Compressed Counting with Spiking Neurons. ESA 2019: 57:1-57:17 - [c41]Merav Parter, Eylon Yogev:
Optimal Short Cycle Decomposition in Almost Linear Time. ICALP 2019: 89:1-89:14 - [c40]Merav Parter, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee:
Local Computation Algorithms for Spanners. ITCS 2019: 58:1-58:21 - [c39]Merav Parter, Eylon Yogev:
Secure Distributed Computing Made (Nearly) Optimal. PODC 2019: 107-116 - [c38]Merav Parter, Eylon Yogev:
Low Congestion Cycle Covers and Their Applications. SODA 2019: 1673-1692 - [c37]Merav Parter, Eylon Yogev:
Distributed Algorithms Made Secure: A Graph Theoretic Approach. SODA 2019: 1693-1710 - [c36]Christoph Lenzen, Merav Parter, Eylon Yogev:
Parallel Balanced Allocations: The Heavily Loaded Case. SPAA 2019: 313-322 - [c35]Jason Li, Merav Parter:
Planar diameter via metric compression. STOC 2019: 152-163 - [c34]Merav Parter:
Small Cuts and Connectivity Certificates: A Fault Tolerant Approach. DISC 2019: 30:1-30:16 - 2018
- [c33]Merav Parter:
(Delta+1) Coloring in the Congested Clique Model. ICALP 2018: 160:1-160:14 - [c32]Greg Bodwin, Michael Dinitz, Merav Parter, Virginia Vassilevska Williams:
Optimal Vertex Fault Tolerant Spanners (for fixed stretch). SODA 2018: 1884-1900 - [c31]Shirel Attali, Merav Parter, David Peleg, Shay Solomon:
Wireless Expanders. SPAA 2018: 13-22 - [c30]Davide Bilò, Keerti Choudhary, Luciano Gualà, Stefano Leucci, Merav Parter, Guido Proietti:
Efficient Oracles and Routing Schemes for Replacement Paths. STACS 2018: 13:1-13:15 - [c29]Merav Parter, Hsin-Hao Su:
Randomized (Delta+1)-Coloring in O(log* Delta) Congested Clique Rounds. DISC 2018: 39:1-39:18 - [c28]Merav Parter, Eylon Yogev:
Congested Clique Algorithms for Graph Spanners. DISC 2018: 40:1-40:18 - 2017
- [c27]Greg Bodwin, Fabrizio Grandoni, Merav Parter, Virginia Vassilevska Williams:
Preserving Distances in Very Faulty Graphs. ICALP 2017: 73:1-73:14 - [c26]Nancy A. Lynch, Cameron Musco, Merav Parter:
Computational Tradeoffs in Biological Neural Networks: Self-Stabilizing Winner-Take-All Networks. ITCS 2017: 15:1-15:44 - [c25]Keren Censor-Hillel, Merav Parter, Gregory Schwartzman:
Derandomizing Local Distributed Algorithms under Bandwidth Restrictions. DISC 2017: 11:1-11:16 - [c24]Mohsen Ghaffari, Merav Parter:
Near-Optimal Distributed DFS in Planar Graphs. DISC 2017: 21:1-21:16 - [c23]Ofer Grossman, Merav Parter:
Improved Deterministic Distributed Construction of Spanners. DISC 2017: 24:1-24:16 - [c22]Nancy A. Lynch, Cameron Musco, Merav Parter:
Neuro-RAM Unit with Applications to Similarity Testing and Compression in Spiking Neural Networks. DISC 2017: 33:1-33:16 - 2016
- [c21]Mohsen Ghaffari, Merav Parter:
MST in Log-Star Rounds of Congested Clique. PODC 2016: 19-28 - [c20]Mohsen Ghaffari, Merav Parter:
A Polylogarithmic Gossip Algorithm for Plurality Consensus. PODC 2016: 117-126 - [c19]Merav Parter, David Peleg, Shay Solomon:
Local-on-Average Distributed Tasks. SODA 2016: 220-239 - [c18]Mohsen Ghaffari, Merav Parter:
Near-Optimal Distributed Algorithms for Fault-Tolerant Tree Structures. SPAA 2016: 387-396 - 2015
- [c17]Merav Parter, David Peleg:
On the Relations Between SINR Diagrams and Voronoi Diagrams. ADHOC-NOW 2015: 225-237 - [c16]Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication. FOCS 2015: 330-349 - [c15]Merav Parter:
Dual Failure Resilient BFS Structure. PODC 2015: 481-490 - [c14]Merav Parter, David Peleg:
Fault Tolerant BFS Structures: A Reinforcement-Backup Tradeoff. SPAA 2015: 264-273 - [c13]Keren Censor-Hillel, Erez Kantor, Nancy A. Lynch, Merav Parter:
Computing in Additive Networks with Bounded-Information Codes. DISC 2015: 405-419 - [c12]Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
Nonuniform SINR+Voroni Diagrams Are Effectively Uniform. DISC 2015: 588-601 - 2014
- [c11]Merav Parter:
Bypassing Erdős' Girth Conjecture: Hybrid Stretch and Sourcewise Spanners. ICALP (2) 2014: 608-619 - [c10]Merav Parter, David Peleg:
Fault Tolerant Approximate BFS Structures. SODA 2014: 1073-1092 - [c9]Merav Parter:
Vertex Fault Tolerant Additive Spanners. DISC 2014: 167-181 - 2013
- [c8]Shiri Chechik, Matthew P. Johnson, Merav Parter, David Peleg:
Secluded Connectivity Problems. ESA 2013: 301-312 - [c7]Merav Parter, David Peleg:
Sparse Fault-Tolerant BFS Trees. ESA 2013: 779-790 - [c6]Chen Avin, Michael Borokhovich, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
Generalized Perron-Frobenius Theorem for Multiple Choice Matrices, and Applications. SODA 2013: 478-497 - [c5]Michael Dinitz, Merav Parter:
Braess's Paradox in Wireless Networks: The Danger of Improved Technology. DISC 2013: 477-491 - 2012
- [c4]Chen Avin, Asaf Cohen, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
SINR diagram with interference cancellation. SODA 2012: 502-515 - [c3]Pierre Fraigniaud, Amos Korman, Merav Parter, David Peleg:
Randomized Distributed Decision. DISC 2012: 371-385 - 2011
- [c2]Zvi Lotker, Merav Parter, David Peleg, Yvonne-Anne Pignolet:
Distributed power control in the SINR model. INFOCOM 2011: 2525-2533 - [c1]Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
The topology of wireless communication. STOC 2011: 383-392
Editorship
- 2024
- [e2]Merav Parter, Seth Pettie:
2024 Symposium on Simplicity in Algorithms, SOSA 2024, Alexandria, VA, USA, January 8-10, 2024. SIAM 2024, ISBN 978-1-61197-793-6 [contents] - 2022
- [e1]Merav Parter:
Structural Information and Communication Complexity - 29th International Colloquium, SIROCCO 2022, Paderborn, Germany, June 27-29, 2022, Proceedings. Lecture Notes in Computer Science 13298, Springer 2022, ISBN 978-3-031-09992-2 [contents]
Informal and Other Publications
- 2023
- [i55]Orr Fischer, Merav Parter:
Distributed CONGEST Algorithms against Mobile Adversaries. CoRR abs/2305.14300 (2023) - [i54]Merav Parter, Asaf Petruschka, Seth Pettie:
Connectivity Labeling for Multiple Vertex Failures. CoRR abs/2307.06276 (2023) - [i53]Greg Bodwin, Bernhard Haeupler, Merav Parter:
Fault-Tolerant Spanners against Bounded-Degree Edge Failures: Linearly More Faults, Almost For Free. CoRR abs/2309.06696 (2023) - 2022
- [i52]Merav Parter, Asaf Petruschka:
Õptimal Dual Vertex Failure Connectivity Labels. CoRR abs/2208.10168 (2022) - [i51]Merav Parter:
Õptimal Vertex Fault-Tolerant Spanners in Õptimal Time: Sequential, Distributed and Parallel. CoRR abs/2209.02990 (2022) - [i50]Shimon Kogan, Merav Parter:
Having Hope in Hops: New Spanners, Preservers and Lower Bounds for Hopsets. CoRR abs/2211.06920 (2022) - [i49]Merav Parter, Asaf Petruschka:
Near-Optimal Distributed Computation of Small Vertex Cuts. CoRR abs/2211.09415 (2022) - 2021
- [i48]Greg Bodwin, Merav Parter:
Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs. CoRR abs/2102.10174 (2021) - [i47]Michal Dory, Merav Parter:
Fault-Tolerant Labeling and Compact Routing Schemes. CoRR abs/2106.00374 (2021) - [i46]Artur Czumaj, Peter Davies, Merav Parter:
Component Stability in Low-Space Massively Parallel Computation. CoRR abs/2106.01880 (2021) - [i45]Shimon Kogan, Merav Parter:
Low-Congestion Shortcuts in Constant Diameter Graphs. CoRR abs/2106.01894 (2021) - [i44]Shimon Kogan, Merav Parter:
New Diameter-Reducing Shortcuts and Directed Hopsets: Breaking the √n Barrier. CoRR abs/2111.13240 (2021) - [i43]Artur Czumaj, Peter Davies, Merav Parter:
Improved Deterministic (Δ+1)-Coloring in Low-Space MPC. CoRR abs/2112.05831 (2021) - 2020
- [i42]Michal Dory, Merav Parter:
Exponentially Faster Shortest Paths in the Congested Clique. CoRR abs/2003.03058 (2020) - [i41]Yael Hitron, Merav Parter:
Round-Efficient Distributed Byzantine Computation. CoRR abs/2004.06436 (2020) - [i40]Julia Chuzhoy, Merav Parter, Zihan Tan:
On Packing Low-Diameter Spanning Trees. CoRR abs/2006.07486 (2020) - [i39]Karthik C. S., Merav Parter:
Deterministic Replacement Path Covering. CoRR abs/2008.05421 (2020) - [i38]Artur Czumaj, Peter Davies, Merav Parter:
Simple, Deterministic, Constant-Round Coloring in the Congested Clique. CoRR abs/2009.06043 (2020) - [i37]Yael Hitron, Cameron Musco, Merav Parter:
Spiking Neural Networks Through the Lens of Streaming Algorithms. CoRR abs/2010.01423 (2020) - [i36]Merav Parter:
Distributed Constructions of Dual-Failure Fault-Tolerant Distance Preservers. CoRR abs/2010.01503 (2020) - 2019
- [i35]Merav Parter, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee:
Local Computation Algorithms for Spanners. CoRR abs/1902.08266 (2019) - [i34]Yael Hitron, Merav Parter:
Counting to Ten with Two Fingers: Compressed Counting with Spiking Neurons. CoRR abs/1902.10369 (2019) - [i33]Christoph Lenzen, Merav Parter, Eylon Yogev:
Parallel Balanced Allocations: The Heavily Loaded Case. CoRR abs/1904.07532 (2019) - [i32]Nancy A. Lynch, Cameron Musco, Merav Parter:
Winner-Take-All Computation in Spiking Neural Networks. CoRR abs/1904.12591 (2019) - [i31]Uri Ben-Levy, Merav Parter:
New (α, β) Spanners and Hopsets. CoRR abs/1907.11402 (2019) - [i30]Merav Parter:
Small Cuts and Connectivity Certificates: A Fault Tolerant Approach. CoRR abs/1908.03022 (2019) - [i29]Artur Czumaj, Peter Davies, Merav Parter:
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space. CoRR abs/1912.05390 (2019) - [i28]Jason Li, Merav Parter:
Planar Diameter via Metric Compression. CoRR abs/1912.11491 (2019) - 2018
- [i27]Shirel Attali, Merav Parter, David Peleg, Shay Solomon:
Wireless Expanders. CoRR abs/1802.07177 (2018) - [i26]Merav Parter:
(Δ+1) Coloring in the Congested Clique Model. CoRR abs/1805.02457 (2018) - [i25]Merav Parter, Eylon Yogev:
Congested Clique Algorithms for Graph Spanners. CoRR abs/1805.05404 (2018) - [i24]Merav Parter, Eylon Yogev:
Low Congestion Cycle Covers and their Applications. CoRR abs/1812.04492 (2018) - [i23]Moni Naor, Merav Parter, Eylon Yogev:
The Power of Distributed Verifiers in Interactive Proofs. CoRR abs/1812.10917 (2018) - [i22]Moni Naor, Merav Parter, Eylon Yogev:
The Power of Distributed Verifiers in Interactive Proofs. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [i21]Greg Bodwin, Fabrizio Grandoni, Merav Parter, Virginia Vassilevska Williams:
Preserving Distances in Very Faulty Graphs. CoRR abs/1703.10293 (2017) - [i20]Nancy A. Lynch, Cameron Musco, Merav Parter:
Neuro-RAM Unit with Applications to Similarity Testing and Compression in Spiking Neural Networks. CoRR abs/1706.01382 (2017) - [i19]Ofer Grossman, Merav Parter:
Improved Deterministic Distributed Construction of Spanners. CoRR abs/1708.01011 (2017) - [i18]Greg Bodwin, Michael Dinitz, Merav Parter, Virginia Vassilevska Williams:
Optimal Vertex Fault Tolerant Spanners (for fixed stretch). CoRR abs/1710.03164 (2017) - [i17]Merav Parter, Eylon Yogev:
Distributed Computing Made Secure: A New Cycle Cover Theorem. CoRR abs/1712.01139 (2017) - [i16]Merav Parter, Eylon Yogev:
Distributed Computing Made Secure: A New Cycle Cover Theorem. IACR Cryptol. ePrint Arch. 2017: 1182 (2017) - 2016
- [i15]Keren Censor-Hillel, Merav Parter, Gregory Schwartzman:
Derandomizing Local Distributed Algorithms under Bandwidth Restrictions. CoRR abs/1608.01689 (2016) - [i14]Nancy A. Lynch, Cameron Musco, Merav Parter:
Computational Tradeoffs in Biological Neural Networks: Self-Stabilizing Winner-Take-All Networks. CoRR abs/1610.02084 (2016) - 2015
- [i13]Merav Parter, David Peleg:
Fault Tolerant BFS Structures: A Reinforcement-Backup Tradeoff. CoRR abs/1504.04169 (2015) - [i12]Merav Parter:
Dual Failure Resilient BFS Structure. CoRR abs/1505.00692 (2015) - [i11]Keren Censor-Hillel, Erez Kantor, Nancy A. Lynch, Merav Parter:
Computing in Additive Networks with Bounded-Information Codes. CoRR abs/1508.03660 (2015) - 2014
- [i10]Merav Parter:
Bypassing Erdős' Girth Conjecture: Hybrid Stretch and Sourcewise Spanners. CoRR abs/1404.6835 (2014) - [i9]Merav Parter, David Peleg:
Fault Tolerant Approximate BFS Structures. CoRR abs/1406.6169 (2014) - [i8]Merav Parter:
Vertex Fault Tolerant Additive Spanners. CoRR abs/1408.0409 (2014) - 2013
- [i7]Merav Parter, David Peleg:
Sparse Fault-Tolerant BFS Trees. CoRR abs/1302.5401 (2013) - [i6]Michael Dinitz, Merav Parter:
Braess's Paradox in Wireless Networks: The Danger of Improved Technology. CoRR abs/1308.0173 (2013) - [i5]Chen Avin, Michael Borokhovich, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
Generalized Perron-Frobenius Theorem for Nonsquare Matrices. CoRR abs/1308.5915 (2013) - [i4]Chen Avin, Asaf Cohen, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
SINR Diagram with Interference Cancellation. CoRR abs/1309.3193 (2013) - 2012
- [i3]Pierre Fraigniaud, Amos Korman, Merav Parter, David Peleg:
Randomized Distributed Decision. CoRR abs/1207.0252 (2012) - [i2]Shiri Chechik, Matthew P. Johnson, Merav Parter, David Peleg:
Secluded Connectivity Problems. CoRR abs/1212.6176 (2012) - 2011
- [i1]Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
The Topology of Wireless Communication. CoRR abs/1103.4566 (2011)
Coauthor Index
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-26 23:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
