|
+
PDF
Chat
|
Almost Tight Bounds for Differentially Private Densest Subgraph
|
2025
|
Michael Dinitz
Satyen Kale
Silvio Lattanzi
Sergei Vassilvitskii
|
|
+
PDF
Chat
|
Binary Search with Distributional Predictions
|
2024
|
Michael Dinitz
Sungjin Im
Thomas Lavastida
Benjamin Moseley
Aidin Niaparast
Sergei Vassilvitskii
|
|
+
PDF
Chat
|
Noise is All You Need: Private Second-Order Convergence of Noisy SGD
|
2024
|
Dmitrii Avdiukhin
Michael Dinitz
Chenglin Fan
Grigory Yaroslavtsev
|
|
+
PDF
Chat
|
Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling
|
2024
|
Laxman Dhulipala
Michael Dinitz
Jakub ĆÄ
cki
Slobodan MitroviÄ
|
|
+
PDF
Chat
|
Approximation Algorithms for Minimizing Congestion in Demand-Aware Networks
|
2024
|
Wenkai Dai
Michael Dinitz
Klaus-Tycho Foerster
Long Luo
Stefan Schmid
|
|
+
PDF
Chat
|
Smoothed Analysis of Information Spreading in Dynamic Networks
|
2024
|
Michael Dinitz
Jeremy T. Fineman
Seth Gilbert
Calvin Newport
|
|
+
PDF
Chat
|
Controlling Tail Risk in Online Ski-Rental
|
2024
|
Michael Dinitz
Sungjin Im
Thomas Lavastida
Benjamin Moseley
Sergei Vassilvitskii
|
|
+
|
Approximation Algorithms for Minimizing Congestion in Demand-Aware Networks
|
2024
|
Wenkai Dai
Michael Dinitz
Klaus-Tycho Foerster
Long Luo
Stefan Schmid
|
|
+
|
Degrees and Network Design: New Problems and Approximations
|
2023
|
Michael Dinitz
Guy Kortsarz
Shi Li
|
|
+
|
Improved Approximations for Relative Survivable Network Design
|
2023
|
Michael Dinitz
Ama Koranteng
Guy Kortsarz
Zeev Nutov
|
|
+
|
Controlling Tail Risk in Online Ski-Rental
|
2023
|
Michael Dinitz
Sungjin Im
Thomas Lavastida
Benjamin Moseley
Sergei Vassilvitskii
|
|
+
|
Improved Differentially Private Densest Subgraph: Local and Purely Additive
|
2023
|
Michael Dinitz
Satyen Kale
Silvio Lattanzi
Sergei Vassilvitskii
|
|
+
PDF
Chat
|
Partially Optimal Edge Fault-Tolerant Spanners
|
2022
|
Greg Bodwin
Michael Dinitz
Caleb Robelle
|
|
+
|
Controlling Epidemic Spread using Probabilistic Diffusion Models on Networks
|
2022
|
Amy Babay
Michael Dinitz
Aravind Srinivasan
Leonidas Tsepenekas
Anil Vullikanti
|
|
+
|
Relative Survivable Network Design
|
2022
|
Michael Dinitz
Ama Koranteng
Guy Kortsarz
|
|
+
|
Smoothed Analysis of Information Spreading in Dynamic Networks
|
2022
|
Michael Dinitz
Jeremy T. Fineman
Seth Gilbert
Calvin Newport
|
|
+
|
Epic Fail: Emulators can tolerate polynomially many edge faults for free
|
2022
|
Greg Bodwin
Michael Dinitz
Yasamin Nazari
|
|
+
|
Algorithms with Prediction Portfolios
|
2022
|
Michael Dinitz
Sungjin Im
Thomas Lavastida
Benjamin Moseley
Sergei Vassilvitskii
|
|
+
|
Fair Disaster Containment via Graph-Cut Problems.
|
2021
|
Amy Babay
Michael Dinitz
Prathyush Sambaturu
Aravind Srinivasan
Leonidas Tsepenekas
Anil Vullikanti
|
|
+
PDF
Chat
|
Optimal Vertex Fault-Tolerant Spanners in Polynomial Time
|
2021
|
Greg Bodwin
Michael Dinitz
Caleb Robelle
|
|
+
PDF
Chat
|
Lasserre Integrality Gaps for Graph Spanners and Related Problems
|
2021
|
Michael Dinitz
Yasamin Nazari
Zeyu Zhang
|
|
+
|
Faster Matchings via Learned Duals
|
2021
|
Michael Dinitz
Sungjin Im
Thomas Lavastida
Benjamin Moseley
Sergei Vassilvitskii
|
|
+
|
Vertex Fault-Tolerant Emulators
|
2021
|
Greg Bodwin
Michael Dinitz
Yasamin Nazari
|
|
+
|
Fair Disaster Containment via Graph-Cut Problems
|
2021
|
Michael Dinitz
Aravind Srinivasan
Leonidas Tsepenekas
Anil Vullikanti
|
|
+
|
Partially Optimal Edge Fault-Tolerant Spanners
|
2021
|
Greg Bodwin
Michael Dinitz
Caleb Robelle
|
|
+
|
Efficient and Simple Algorithms for Fault-Tolerant Spanners
|
2020
|
Michael Dinitz
Caleb Robelle
|
|
+
PDF
Chat
|
Scheduling for Weighted Flow and Completion Times in Reconfigurable Networks
|
2020
|
Michael Dinitz
Benjamin Moseley
|
|
+
|
Optimal Vertex Fault-Tolerant Spanners in Polynomial Time
|
2020
|
Greg Bodwin
Michael Dinitz
Caleb Robelle
|
|
+
|
Efficient and Simple Algorithms for Fault Tolerant Spanners
|
2020
|
Michael Dinitz
Caleb Robelle
|
|
+
|
Scheduling for Weighted Flow and Completion Times in Reconfigurable Networks
|
2020
|
Michael Dinitz
Benjamin Moseley
|
|
+
|
The Norms of Graph Spanners
|
2019
|
Eden ChlamtĂĄÄ
Michael Dinitz
Thomas J. Robinson
|
|
+
|
Lasserre Integrality Gaps for Graph Spanners and Related Problems
|
2019
|
Michael Dinitz
Yasamin Nazari
Zeyu Zhang
|
|
+
|
The Norms of Graph Spanners.
|
2019
|
Eden ChlamtĂĄÄ
Michael Dinitz
Thomas J. Robinson
|
|
+
PDF
Chat
|
Reception Capacity: Definitions, Game Theory and Hardness
|
2019
|
Michael Dinitz
Naomi Ephraim
|
|
+
|
The Capacity of Smartphone Peer-to-Peer Networks
|
2019
|
Michael Dinitz
MagnĂșs M. HalldĂłrsson
Calvin Newport
Alex Weaver
|
|
+
|
The Norms of Graph Spanners
|
2019
|
Eden ChlamtĂĄÄ
Michael Dinitz
Thomas N. Robinson
|
|
+
|
Distributed Approximate Distance Oracles.
|
2018
|
Michael Dinitz
Yasamin Nazari
|
|
+
|
Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner Network
|
2018
|
Amy Babay
Michael Dinitz
Zeyu Zhang
|
|
+
|
Distributed Algorithms for Minimum Degree Spanning Trees
|
2018
|
Michael Dinitz
MagnĂșs M. HalldĂłrsson
Calvin Newport
|
|
+
|
Large Low-Diameter Graphs are Good Expanders
|
2018
|
Michael Dinitz
Michael Schapira
Gal Shahaf
|
|
+
|
Policy Regret in Repeated Games
|
2018
|
Raman Arora
Michael Dinitz
Teodor V. Marinov
Mehryar Mohri
|
|
+
PDF
Chat
|
Optimal Vertex Fault Tolerant Spanners (for fixed stretch)
|
2018
|
Greg Bodwin
Michael Dinitz
Merav Parter
Virginia Vassilevska Williams
|
|
+
PDF
Chat
|
The Densest $k$-Subhypergraph Problem
|
2018
|
Eden ChlamtĂĄÄ
Michael Dinitz
Christian Konrad
Guy Kortsarz
George Rabanca
|
|
+
|
Massively Parallel Approximate Distance Sketches
|
2018
|
Michael Dinitz
Yasamin Nazari
|
|
+
PDF
Chat
|
Smoothed analysis of dynamic networks
|
2017
|
Michael Dinitz
Jeremy T. Fineman
Seth Gilbert
Calvin Newport
|
|
+
|
Approximating k-spanners in the LOCAL model.
|
2017
|
Michael Dinitz
Yasamin Nazari
|
|
+
|
Reception Capacity: Definitions, Game Theory and Hardness.
|
2017
|
Michael Dinitz
Naomi Ephraim
|
|
+
|
Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds
|
2017
|
Eden ChlamtĂĄÄ
Michael Dinitz
Guy Kortsarz
Bundit Laekhanukit
|
|
+
|
Distributed Distance-Bounded Network Design Through Distributed Convex Programming
|
2017
|
Michael Dinitz
Yasamin Nazari
|
|
+
|
Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion
|
2017
|
Eden ChlamtĂĄÄ
Michael Dinitz
Yury Makarychev
|
|
+
|
Optimal Vertex Fault Tolerant Spanners (for fixed stretch)
|
2017
|
Greg Bodwin
Michael Dinitz
Merav Parter
Virginia Vassilevska Williams
|
|
+
|
Reception Capacity: Definitions, Game Theory and Hardness
|
2017
|
Michael Dinitz
Naomi Ephraim
|
|
+
PDF
Chat
|
Explicit Expanding Expanders
|
2016
|
Michael Dinitz
Michael Schapira
Asaf Valadarsky
|
|
+
|
The Densest k-Subhypergraph Problem
|
2016
|
Eden ChlamtĂĄÄ
Michael Dinitz
Christian Konrad
Guy Kortsarz
George Rabanca
|
|
+
|
Computing Approximate PSD Factorizations
|
2016
|
Amitabh Basu
Michael Dinitz
Xin Li
|
|
+
|
Computing approximate PSD factorizations
|
2016
|
Amitabh Basu
Michael Dinitz
Xin Li
|
|
+
|
Large Fixed-Diameter Graphs are Good Expanders
|
2016
|
Michael Dinitz
Michael Schapira
Gal Shahaf
|
|
+
|
Approximating Approximate Distance Oracles
|
2016
|
Michael Dinitz
Zeyu Zhang
|
|
+
|
Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion
|
2016
|
Eden ChlamtĂĄÄ
Michael Dinitz
Yury Makarychev
|
|
+
|
Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds
|
2016
|
Eden ChlamtĂĄÄ
Michael Dinitz
Guy Kortsarz
Bundit Laekhanukit
|
|
+
|
The Densest k-Subhypergraph Problem
|
2016
|
Eden ChlamtĂĄÄ
Michael Dinitz
Christian Konrad
Guy Kortsarz
George Rabanca
|
|
+
PDF
Chat
|
Label Cover Instances with Large Girth and the Hardness of Approximating Basic <i>k</i> -Spanner
|
2015
|
Michael Dinitz
Guy Kortsarz
Ran Raz
|
|
+
|
Smoothed Analysis of Dynamic Networks
|
2015
|
Michael Dinitz
Jeremy T. Fineman
Seth Gilbert
Calvin Newport
|
|
+
|
Towards Resistance Sparsifiers
|
2015
|
Michael Dinitz
Robert Krauthgamer
Tal Wagner
|
|
+
PDF
Chat
|
Explicit Expanding Expanders
|
2015
|
Michael Dinitz
Michael Schapira
Asaf Valadarsky
|
|
+
|
Smoothed Analysis of Dynamic Networks
|
2015
|
Michael Dinitz
Jeremy T. Fineman
Seth Gilbert
Calvin Newport
|
|
+
|
Explicit Expanding Expanders
|
2015
|
Michael Dinitz
Michael Schapira
Asaf Valadarsky
|
|
+
|
Smoothed Analysis of Dynamic Networks
|
2015
|
Michael Dinitz
Jeremy T. Fineman
Seth Gilbert
Calvin Newport
|
|
+
PDF
Chat
|
Matroid Secretary for Regular and Decomposable Matroids
|
2014
|
Michael Dinitz
Guy Kortsarz
|
|
+
|
Braess's Paradox in Wireless Networks: The Danger of Improved Technology
|
2013
|
Michael Dinitz
Merav Parter
|
|
+
|
Matroid secretary for regular and decomposable matroids
|
2013
|
Michael Dinitz
Guy Kortsarz
|
|
+
PDF
Chat
|
Matroid Secretary for Regular and Decomposable Matroids
|
2013
|
Michael Dinitz
Guy Kortsarz
|
|
+
PDF
Chat
|
Braessâs Paradox in Wireless Networks: The Danger of Improved Technology
|
2013
|
Michael Dinitz
Merav Parter
|
|
+
|
Braess's Paradox in Wireless Networks: The Danger of Improved Technology
|
2013
|
Michael Dinitz
Merav Parter
|
|
+
PDF
Chat
|
Everywhere-Sparse Spanners via Dense Subgraphs
|
2012
|
Eden ChlamtĂĄÄ
Michael Dinitz
Robert Krauthgamer
|
|
+
|
Matroid Secretary for Regular and Decomposable Matroids
|
2012
|
Michael Dinitz
Guy Kortsarz
|
|
+
PDF
Chat
|
Efficient computation of distance sketches in distributed networks
|
2012
|
Atish Das Sarma
Michael Dinitz
Gopal Pandurangan
|
|
+
|
Everywhere-Sparse Spanners via Dense Subgraphs
|
2012
|
Eden ChlamtĂĄÄ
Michael Dinitz
Robert Krauthgamer
|
|
+
PDF
Chat
|
iBGP and Constrained Connectivity
|
2012
|
Michael Dinitz
Gordon Wilfong
|
|
+
PDF
Chat
|
Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner
|
2012
|
Michael Dinitz
Guy Kortsarz
Ran Raz
|
|
+
|
Label Cover instances with large girth and the hardness of approximating basic k-spanner
|
2012
|
Michael Dinitz
Guy Kortsarz
Ran Raz
|
|
+
|
Matroid Secretary for Regular and Decomposable Matroids
|
2012
|
Michael Dinitz
Guy Kortsarz
|
|
+
|
Everywhere-Sparse Spanners via Dense Subgraphs
|
2012
|
Eden ChlamtĂĄÄ
Michael Dinitz
Robert Krauthgamer
|
|
+
|
Efficient Computation of Distance Sketches in Distributed Networks
|
2011
|
Atish Das Sarma
Michael Dinitz
Gopal Pandurangan
|
|
+
|
iBGP and Constrained Connectivity
|
2011
|
Michael Dinitz
Gordon Wilfong
|
|
+
|
Directed spanners via flow-based linear programs
|
2011
|
Michael Dinitz
Robert Krauthgamer
|
|
+
|
Fault-Tolerant Spanners: Better and Simpler
|
2011
|
Michael Dinitz
Robert Krauthgamer
|
|
+
|
Efficient Computation of Distance Sketches in Distributed Networks
|
2011
|
Atish Das Sarma
Michael Dinitz
Gopal Pandurangan
|
|
+
|
iBGP and Constrained Connectivity
|
2011
|
Michael Dinitz
Gordon Wilfong
|
|
+
|
Directed Spanners via Flow-Based Linear Programs
|
2010
|
Michael Dinitz
Robert Krauthgamer
|
|
+
|
Directed Spanners via Flow-Based Linear Programs
|
2010
|
Michael Dinitz
Robert Krauthgamer
|
|
+
|
Online and dynamic embeddings of approximate ultrametrics
|
2008
|
Michael Dinitz
|