Michael Dinitz

Michael Dinitz

Johns Hopkins University

H-index: 22

North America-United States

About Michael Dinitz

Michael Dinitz, With an exceptional h-index of 22 and a recent h-index of 18 (since 2020), a distinguished researcher at Johns Hopkins University, specializes in the field of Algorithms, networking, distributed computing.

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

Approximation Algorithms for Minimizing Congestion in Demand-Aware Networks

Controlling Tail Risk in Online Ski-Rental

Improved Approximations for Relative Survivable Network Design

Improved Differentially Private Densest Subgraph: Local and Purely Additive

Degrees and Network Design: New Problems and Approximations

Algorithms with prediction portfolios

Improved Approximation for Fault-Tolerant 2-Spanner

Smoothed analysis of information spreading in dynamic networks

Michael Dinitz Information

University

Position

Associate Professor

Citations(all)

1600

Citations(since 2020)

853

Cited By

1115

hIndex(all)

22

hIndex(since 2020)

18

i10Index(all)

36

i10Index(since 2020)

32

Email

University Profile Page

Google Scholar

Michael Dinitz Skills & Research Interests

Algorithms

networking

distributed computing

Top articles of Michael Dinitz

Approximation Algorithms for Minimizing Congestion in Demand-Aware Networks

arXiv preprint arXiv:2401.04638

2024/1/9

Controlling Tail Risk in Online Ski-Rental

2024

Improved Approximations for Relative Survivable Network Design

2023/9/7

Michael Dinitz
Michael Dinitz

H-Index: 16

Improved Differentially Private Densest Subgraph: Local and Purely Additive

arXiv preprint arXiv:2308.10316

2023/8/20

Michael Dinitz
Michael Dinitz

H-Index: 16

Degrees and Network Design: New Problems and Approximations

arXiv preprint arXiv:2302.11475

2023/2/22

Michael Dinitz
Michael Dinitz

H-Index: 16

Shi Li
Shi Li

H-Index: 12

Algorithms with prediction portfolios

Advances in neural information processing systems

2022/12/6

Improved Approximation for Fault-Tolerant 2-Spanner

2022/11/28

Michael Dinitz
Michael Dinitz

H-Index: 16

Yang Xiao
Yang Xiao

H-Index: 4

Smoothed analysis of information spreading in dynamic networks

arXiv preprint arXiv:2208.05998

2022/8/11

Epic fail: emulators can tolerate polynomially many edge faults for free

arXiv preprint arXiv:2209.03675

2022/9/8

Relative survivable network design

arXiv preprint arXiv:2206.12245

2022/6/24

Michael Dinitz
Michael Dinitz

H-Index: 16

Controlling epidemic spread using probabilistic diffusion models on networks

2022/5/3

Michael Dinitz
Michael Dinitz

H-Index: 16

Aravind Srinivasan
Aravind Srinivasan

H-Index: 35

Fair disaster containment via graph-cut problems

arXiv preprint arXiv:2106.05424

2021/6/9

Brief announcement: Minimizing congestion in hybrid demand-aware network topologies

2022

Partially optimal edge fault-tolerant spanners

2022

Greg Bodwin
Greg Bodwin

H-Index: 11

Michael Dinitz
Michael Dinitz

H-Index: 16

Faster matchings via learned duals

Advances in neural information processing systems

2021/12/6

Vertex fault-tolerant emulators

arXiv preprint arXiv:2109.08042

2021/9/16

Optimal vertex fault-tolerant spanners in polynomial time

2021

Greg Bodwin
Greg Bodwin

H-Index: 11

Michael Dinitz
Michael Dinitz

H-Index: 16

Lasserre integrality gaps for graph spanners and related problems

2021

Scheduling for weighted flow and completion times in reconfigurable networks

2020/7/6

Michael Dinitz
Michael Dinitz

H-Index: 16

Benjamin Moseley
Benjamin Moseley

H-Index: 18

Approximating spanners and directed steiner forest: Upper and lower bounds

ACM Transactions on Algorithms (TALG)

2020/6/12

Michael Dinitz
Michael Dinitz

H-Index: 16

See List of Professors in Michael Dinitz University(Johns Hopkins University)

Co-Authors

academic-engine