Merav Parter

About Merav Parter

Merav Parter, With an exceptional h-index of 24 and a recent h-index of 21 (since 2020), a distinguished researcher at Weizmann Institute of Science, specializes in the field of Theoretical Computer Science.

His recent articles reflect a diverse array of research interests and contributions to the field:

2024 Symposium on Simplicity in Algorithms (SOSA)

Fault-Tolerant Spanners against Bounded-Degree Edge Failures: Linearly More Faults, Almost For Free

Secure Computation Meets Distributed Universal Optimality

Restorable shortest path tiebreaking for edge-faulty graphs

Near-optimal distributed computation of small vertex cuts

Connectivity Labeling and Routing with Multiple Vertex Failures

Connectivity Labeling for Multiple Vertex Failures

Distributed CONGEST Algorithms against Mobile Adversaries

Merav Parter Information

University

Position

___

Citations(all)

2001

Citations(since 2020)

1279

Cited By

1242

hIndex(all)

24

hIndex(since 2020)

21

i10Index(all)

55

i10Index(since 2020)

50

Email

University Profile Page

Google Scholar

Merav Parter Skills & Research Interests

Theoretical Computer Science

Top articles of Merav Parter

2024 Symposium on Simplicity in Algorithms (SOSA)

2024

Merav Parter
Merav Parter

H-Index: 17

Seth Pettie
Seth Pettie

H-Index: 26

Fault-Tolerant Spanners against Bounded-Degree Edge Failures: Linearly More Faults, Almost For Free

2024

Secure Computation Meets Distributed Universal Optimality

2023/11/6

Merav Parter
Merav Parter

H-Index: 17

Restorable shortest path tiebreaking for edge-faulty graphs

Journal of the ACM

2023/10/12

Greg Bodwin
Greg Bodwin

H-Index: 11

Merav Parter
Merav Parter

H-Index: 17

Near-optimal distributed computation of small vertex cuts

Distributed Computing

2023/7/14

Merav Parter
Merav Parter

H-Index: 17

Connectivity Labeling and Routing with Multiple Vertex Failures

arXiv. org

2023/7/12

Merav Parter
Merav Parter

H-Index: 17

Seth Pettie
Seth Pettie

H-Index: 26

Connectivity Labeling for Multiple Vertex Failures

arXiv preprint arXiv:2307.06276

2023/7/12

Merav Parter
Merav Parter

H-Index: 17

Seth Pettie
Seth Pettie

H-Index: 26

Distributed CONGEST Algorithms against Mobile Adversaries

2023/6/19

Merav Parter
Merav Parter

H-Index: 17

Towards Bypassing Lower Bounds for Graph Shortcuts

2023

Shimon Kogan
Shimon Kogan

H-Index: 3

Merav Parter
Merav Parter

H-Index: 17

New additive emulators

2023

Shimon Kogan
Shimon Kogan

H-Index: 3

Merav Parter
Merav Parter

H-Index: 17

Secure distributed network optimization against eavesdroppers

2023

Merav Parter
Merav Parter

H-Index: 17

Faster and unified algorithms for diameter reducing shortcuts and minimum chain covers

2023

Shimon Kogan
Shimon Kogan

H-Index: 3

Merav Parter
Merav Parter

H-Index: 17

Having hope in hops: New spanners, preservers and lower bounds for hopsets

2022/10/31

Shimon Kogan
Shimon Kogan

H-Index: 3

Merav Parter
Merav Parter

H-Index: 17

\~{O} ptimal Vertex Fault-Tolerant Spanners in\~{O} ptimal Time: Sequential, Distributed and Parallel

arXiv preprint arXiv:2209.02990

2022/9/7

Merav Parter
Merav Parter

H-Index: 17

Exponentially faster shortest paths in the congested clique

ACM Journal of the ACM (JACM)

2022/8/31

Merav Parter
Merav Parter

H-Index: 17

\~{O} ptimal Dual Vertex Failure Connectivity Labels

arXiv preprint arXiv:2208.10168

2022/8/22

Merav Parter
Merav Parter

H-Index: 17

A Graph Theoretic Approach for Resilient Distributed Algorithms

2022/7/20

Merav Parter
Merav Parter

H-Index: 17

Nearly optimal vertex fault-tolerant spanners in optimal time: sequential, distributed, and parallel

2022/6/9

Merav Parter
Merav Parter

H-Index: 17

Broadcast CONGEST algorithms against eavesdroppers

2022

Merav Parter
Merav Parter

H-Index: 17

Beating Matrix Multiplication for n^{1/3}-Directed Shortcuts

2022

Shimon Kogan
Shimon Kogan

H-Index: 3

Merav Parter
Merav Parter

H-Index: 17

See List of Professors in Merav Parter University(Weizmann Institute of Science)

Co-Authors

academic-engine