Merav Parter

From MaRDI portal
Person:831781

Available identifiers

zbMath Open parter.meravMaRDI QIDQ831781

List of research outcomes

PublicationDate of PublicationType
Component stability in low-space massively parallel computation2024-04-09Paper
Low-Congestion Shortcuts in Constant Diameter Graphs2024-03-26Paper
Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs2024-03-26Paper
Fault-Tolerant Labeling and Compact Routing Schemes2024-03-26Paper
Improved Deterministic (Δ+1) Coloring in Low-Space MPC2024-03-26Paper
Component Stability in Low-Space Massively Parallel Computation2024-03-26Paper
A Graph Theoretic Approach for Resilient Distributed Algorithms2024-03-26Paper
Distributed CONGEST Algorithms against Mobile Adversaries2024-03-26Paper
https://portal.mardi4nfdi.de/entity/Q61472932024-01-15Paper
https://portal.mardi4nfdi.de/entity/Q60833872023-12-08Paper
https://portal.mardi4nfdi.de/entity/Q60833882023-12-08Paper
Nearly optimal vertex fault-tolerant spanners in optimal time: sequential, distributed, and parallel2023-12-08Paper
The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication2023-10-23Paper
Exponentially Faster Shortest Paths in the Congested Clique2023-04-27Paper
https://portal.mardi4nfdi.de/entity/Q58757172023-02-03Paper
https://portal.mardi4nfdi.de/entity/Q58757502023-02-03Paper
https://portal.mardi4nfdi.de/entity/Q50909322022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50909332022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50912492022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50904372022-07-18Paper
https://portal.mardi4nfdi.de/entity/Q50758022022-05-11Paper
Invited talk: Resilient distributed algorithms2022-03-24Paper
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space2022-02-16Paper
Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC2021-11-19Paper
https://portal.mardi4nfdi.de/entity/Q50028502021-07-28Paper
Nonuniform SINR+Voronoi diagrams are effectively uniform2021-07-22Paper
Exponentially Faster Shortest Paths in the Congested Clique2021-03-15Paper
Simple, Deterministic, Constant-Round Coloring in the Congested Clique2021-03-15Paper
The Power of Distributed Verifiers in Interactive Proofs2021-02-02Paper
New (α, β) Spanners and Hopsets2021-02-02Paper
Secure Distributed Computing Made (Nearly) Optimal2021-01-20Paper
Fault tolerant approximate BFS structures with additive stretch2020-11-11Paper
https://portal.mardi4nfdi.de/entity/Q33041072020-08-05Paper
Derandomizing local distributed algorithms under bandwidth restrictions2020-06-15Paper
https://portal.mardi4nfdi.de/entity/Q51114042020-05-27Paper
Planar diameter via metric compression2020-01-30Paper
Low Congestion Cycle Covers and Their Applications2019-10-15Paper
Distributed Algorithms Made Secure: A Graph Theoretic Approach2019-10-15Paper
https://portal.mardi4nfdi.de/entity/Q49672052019-07-03Paper
Fault Tolerant Approximate BFS Structures2019-06-20Paper
Generalized Perron–Frobenius Theorem for Multiple Choice Matrices, and Applications2019-05-15Paper
https://portal.mardi4nfdi.de/entity/Q57434162019-05-10Paper
Fault-Tolerant Approximate BFS Structures2018-11-12Paper
Sparse Fault-Tolerant BFS Structures2018-11-05Paper
Computing in additive networks with bounded-information codes2018-08-24Paper
Nonuniform SINR+Voroni diagrams are effectively uniform2018-08-24Paper
The Topology of Wireless Communication2018-08-02Paper
Local-on-Average Distributed Tasks2018-07-16Paper
https://portal.mardi4nfdi.de/entity/Q46380642018-05-03Paper
Optimal Vertex Fault Tolerant Spanners (for fixed stretch)2018-03-15Paper
The topology of wireless communication on a line2018-02-16Paper
Vertex fault tolerant additive spanners2018-01-17Paper
Secluded connectivity problems2017-11-09Paper
MST in Log-Star Rounds of Congested Clique2017-09-29Paper
A Polylogarithmic Gossip Algorithm for Plurality Consensus2017-09-29Paper
Dual Failure Resilient BFS Structure2016-03-23Paper
Randomized distributed decision2015-02-23Paper
Vertex fault tolerant additive spanners2015-02-10Paper
Testing the irreducibility of nonsquare Perron-Frobenius systems2014-08-28Paper
Bypassing Erdős’ Girth Conjecture: Hybrid Stretch and Sourcewise Spanners2014-07-01Paper
The topology of wireless communication2014-06-05Paper
Secluded connectivity problems2013-09-17Paper
Sparse Fault-Tolerant BFS Trees2013-09-17Paper
Randomized distributed decision2013-03-13Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Merav Parter