Michael Dinitz

ORCID

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 81

Top Venues

Publications

Rishi Chandra, Michael Dinitz, Chenglin Fan, Zongrui Zou
Differentially Private Multiway and k-Cut. CoRR (2024)
Michael Dinitz, Jeremy T. Fineman, Seth Gilbert, Calvin Newport
Smoothed Analysis of Information Spreading in Dynamic Networks. J. ACM 71 (3) (2024)
Michael Dinitz, Sungjin Im, Thomas Lavastida, Benjamin Moseley, Sergei Vassilvitskii
Controlling Tail Risk in Online Ski-Rental. SODA (2024)
Wenkai Dai, Michael Dinitz, Klaus-Tycho Foerster, Long Luo, Stefan Schmid
Approximation Algorithms for Minimizing Congestion in Demand-Aware Networks. CoRR (2024)
Wenkai Dai, Michael Dinitz, Klaus-Tycho Foerster, Long Luo, Stefan Schmid
Approximation Algorithms for Minimizing Congestion in Demand-Aware Networks. INFOCOM (2024)
Greg Bodwin, Michael Dinitz, Yasamin Nazari
Epic Fail: Emulators Can Tolerate Polynomially Many Edge Faults for Free. ITCS (2023)
Michael Dinitz, Satyen Kale, Silvio Lattanzi, Sergei Vassilvitskii
Improved Differentially Private Densest Subgraph: Local and Purely Additive. CoRR (2023)
Michael Dinitz, Sungjin Im, Thomas Lavastida, Benjamin Moseley, Sergei Vassilvitskii
Controlling Tail Risk in Online Ski-Rental. CoRR (2023)
Michael Dinitz, Guy Kortsarz, Shi Li
Degrees and Network Design: New Problems and Approximations. CoRR (2023)
Michael Dinitz, Ama Koranteng, Guy Kortsarz, Zeev Nutov
Improved Approximations for Relative Survivable Network Design. CoRR (2023)
Michael Dinitz, Ama Koranteng, Guy Kortsarz, Zeev Nutov
Improved Approximations for Relative Survivable Network Design. WAOA (2023)
Michael Dinitz, Jeremy T. Fineman, Seth Gilbert, Calvin Newport
Smoothed Analysis of Information Spreading in Dynamic Networks. CoRR (2022)
Michael Dinitz, Jeremy T. Fineman, Seth Gilbert, Calvin Newport
Smoothed Analysis of Information Spreading in Dynamic Networks. DISC (2022)
Michael Dinitz, Ama Koranteng, Guy Kortsarz
Relative Survivable Network Design. CoRR (2022)
Amy Babay, Michael Dinitz, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti
Controlling Epidemic Spread using Probabilistic Diffusion Models on Networks. CoRR (2022)
Greg Bodwin, Michael Dinitz, Yasamin Nazari
Epic Fail: Emulators can tolerate polynomially many edge faults for free. CoRR (2022)
Michael Dinitz, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti
Fair Disaster Containment via Graph-Cut Problems. AISTATS (2022)
Michael Dinitz, Sungjin Im, Thomas Lavastida, Benjamin Moseley, Sergei Vassilvitskii
Algorithms with Prediction Portfolios. CoRR (2022)
Michael Dinitz, Sungjin Im, Thomas Lavastida, Benjamin Moseley, Sergei Vassilvitskii
Algorithms with Prediction Portfolios. NeurIPS (2022)
Wenkai Dai, Michael Dinitz, Klaus-Tycho Foerster, Stefan Schmid
Brief Announcement: Minimizing Congestion in Hybrid Demand-Aware Network Topologies. DISC (2022)
Michael Dinitz, Ama Koranteng, Guy Kortsarz
Relative Survivable Network Design. APPROX/RANDOM (2022)
Greg Bodwin, Michael Dinitz, Yasamin Nazari
Vertex Fault-Tolerant Emulators. ITCS (2022)
Amy E. Babay, Michael Dinitz, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti
Controlling Epidemic Spread using Probabilistic Diffusion Models on Networks. AISTATS (2022)
Greg Bodwin, Michael Dinitz, Caleb Robelle
Partially Optimal Edge Fault-Tolerant Spanners. SODA (2022)
Michael Dinitz, Sungjin Im, Thomas Lavastida, Benjamin Moseley, Sergei Vassilvitskii
Faster Matchings via Learned Duals. CoRR (2021)
Michael Dinitz, Sungjin Im, Thomas Lavastida, Benjamin Moseley, Sergei Vassilvitskii
Faster Matchings via Learned Duals. NeurIPS (2021)
Greg Bodwin, Michael Dinitz, Caleb Robelle
Partially Optimal Edge Fault-Tolerant Spanners. CoRR (2021)
Amy Babay, Michael Dinitz, Prathyush Sambaturu, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti
Fair Disaster Containment via Graph-Cut Problems. CoRR (2021)
Greg Bodwin, Michael Dinitz, Yasamin Nazari
Vertex Fault-Tolerant Emulators. CoRR (2021)
Greg Bodwin, Michael Dinitz, Caleb Robelle
Optimal Vertex Fault-Tolerant Spanners in Polynomial Time. SODA (2021)
Michael Dinitz, Caleb Robelle
Efficient and Simple Algorithms for Fault Tolerant Spanners. CoRR (2020)
Eden Chlamtác, Michael Dinitz, Guy Kortsarz, Bundit Laekhanukit
Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds. ACM Trans. Algorithms 16 (3) (2020)
Michael Dinitz, Michael Schapira, Gal Shahaf
Approximate Moore Graphs are good expanders. J. Comb. Theory, Ser. B 141 (2020)
Michael Dinitz, Benjamin Moseley
Scheduling for Weighted Flow and Completion Times in Reconfigurable Networks. INFOCOM (2020)
Michael Dinitz, Caleb Robelle
Efficient and Simple Algorithms for Fault-Tolerant Spanners. PODC (2020)
Michael Dinitz, Yasamin Nazari, Zeyu Zhang
Lasserre Integrality Gaps for Graph Spanners and Related Problems. WAOA (2020)
Greg Bodwin, Michael Dinitz, Caleb Robelle
Optimal Vertex Fault-Tolerant Spanners in Polynomial Time. CoRR (2020)
Michael Dinitz, Benjamin Moseley
Scheduling for Weighted Flow and Completion Times in Reconfigurable Networks. CoRR (2020)
Eden Chlamtác, Michael Dinitz, Thomas Robinson
The Norms of Graph Spanners. CoRR (2019)
Eden Chlamtác, Michael Dinitz, Thomas Robinson
The Norms of Graph Spanners. ICALP (2019)
Michael Dinitz, Yasamin Nazari
Massively Parallel Approximate Distance Sketches. OPODIS (2019)
Michael Dinitz, Magnús M. Halldórsson, Taisuke Izumi, Calvin Newport
Distributed Minimum Degree Spanning Trees. PODC (2019)
Eden Chlamtác, Michael Dinitz, Thomas Robinson
Approximating the Norms of Graph Spanners. APPROX-RANDOM (2019)
Michael Dinitz, Yasamin Nazari
Brief Announcement: Massively Parallel Approximate Distance Sketches. DISC (2019)
Michael Dinitz, Naomi Ephraim
Reception Capacity: Definitions, Game Theory and Hardness. ALGOSENSORS (2019)
Michael Dinitz, Magnús M. Halldórsson, Calvin Newport, Alex Weaver
The Capacity of Smartphone Peer-To-Peer Networks. DISC (2019)
Michael Dinitz, Magnús M. Halldórsson, Calvin Newport, Alex Weaver
The Capacity of Smartphone Peer-to-Peer Networks. CoRR (2019)
Michael Dinitz, Yasamin Nazari, Zeyu Zhang
Lasserre Integrality Gaps for Graph Spanners and Related Problems. CoRR (2019)
Amy Babay, Michael Dinitz, Zeyu Zhang
Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner Network. CoRR (2018)
Michael Dinitz, Yasamin Nazari
Distributed Approximate Distance Oracles. CoRR (2018)
Michael Dinitz, Michael Schapira, Gal Shahaf
Large Low-Diameter Graphs are Good Expanders. ESA (2018)
Amy Babay, Michael Dinitz, Zeyu Zhang
Brief Announcement: Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner Network. ICALP (2018)
Raman Arora, Michael Dinitz, Teodor Vanislavov Marinov, Mehryar Mohri
Policy Regret in Repeated Games. NeurIPS (2018)
Eden Chlamtác, Michael Dinitz, Christian Konrad, Guy Kortsarz, George Rabanca
The Densest k-Subhypergraph Problem. SIAM J. Discret. Math. 32 (2) (2018)
Michael Dinitz, Jeremy T. Fineman, Seth Gilbert, Calvin Newport
Smoothed analysis of dynamic networks. Distributed Comput. 31 (4) (2018)
Michael Dinitz, Magnús M. Halldórsson, Calvin Newport
Distributed Algorithms for Minimum Degree Spanning Trees. CoRR (2018)
Raman Arora, Michael Dinitz, Teodor V. Marinov, Mehryar Mohri
Policy Regret in Repeated Games. CoRR (2018)
Greg Bodwin, Michael Dinitz, Merav Parter, Virginia Vassilevska Williams
Optimal Vertex Fault Tolerant Spanners (for fixed stretch). SODA (2018)
Amy Babay, Michael Dinitz, Zeyu Zhang
Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner Network. FSTTCS (2018)
Michael Dinitz, Michael Schapira, Asaf Valadarsky
Explicit Expanding Expanders. Algorithmica 78 (4) (2017)
Michael Dinitz, Yasamin Nazari
Distributed Distance-Bounded Network Design Through Distributed Convex Programming. OPODIS (2017)
Greg Bodwin, Michael Dinitz, Merav Parter, Virginia Vassilevska Williams
Optimal Vertex Fault Tolerant Spanners (for fixed stretch). CoRR (2017)
Michael Dinitz, Yasamin Nazari
Approximating k-spanners in the LOCAL model. CoRR (2017)
Michael Dinitz, Jeremy T. Fineman, Seth Gilbert, Calvin Newport
Load balancing with bounded convergence in dynamic networks. INFOCOM (2017)
Eden Chlamtác, Michael Dinitz, Guy Kortsarz, Bundit Laekhanukit
Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds. SODA (2017)
Michael Dinitz, Naomi Ephraim
Multicast Capacity Through Perfect Domination. CoRR (2017)
Amy Babay, Emily Wagner, Michael Dinitz, Yair Amir
Timely, Reliable, and Cost-Effective Internet Transport Service Using Dissemination Graphs. ICDCS (2017)
Michael Dinitz, Zeyu Zhang
Approximating Approximate Distance Oracles. ITCS (2017)
Eden Chlamtác, Michael Dinitz, Yury Makarychev
Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion. SODA (2017)
Michael Dinitz, Guy Kortsarz, Zeev Nutov
-Forest with Nearly Uniform Weights. ACM Trans. Algorithms 13 (3) (2017)
Michael Dinitz, Guy Kortsarz, Ran Raz
-Spanner. ACM Trans. Algorithms 12 (2) (2016)
Eden Chlamtác, Michael Dinitz, Christian Konrad, Guy Kortsarz, George Rabanca
The Densest k-Subhypergraph Problem. CoRR (2016)
Eden Chlamtác, Michael Dinitz, Yury Makarychev
Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion. CoRR (2016)
Amitabh Basu, Michael Dinitz, Xin Li
Computing approximate PSD factorizations. CoRR (2016)
Eden Chlamtác, Michael Dinitz
Lowest-Degree k-Spanner: Approximation and Hardness. Theory Comput. 12 (1) (2016)
Eden Chlamtác, Michael Dinitz, Guy Kortsarz, Bundit Laekhanukit
Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds. CoRR (2016)
Eden Chlamtác, Michael Dinitz, Christian Konrad, Guy Kortsarz, George Rabanca
The Densest k-Subhypergraph Problem. APPROX-RANDOM (2016)
Amitabh Basu, Michael Dinitz, Xin Li
Computing Approximate PSD Factorizations. APPROX-RANDOM (2016)
Asaf Valadarsky, Gal Shahaf, Michael Dinitz, Michael Schapira
Xpander: Towards Optimal-Performance Datacenters. CoNEXT (2016)
Michael Dinitz, Zeyu Zhang
Approximating Approximate Distance Oracles. CoRR (2016)
Michael Dinitz, Zeyu Zhang
Approximating Low-Stretch Spanners. SODA (2016)
Michael Dinitz, Michael Schapira, Asaf Valadarsky
Explicit Expanding Expanders. CoRR (2015)
Michael Dinitz, Torsten Hoefler
Introduction to the Special Issue on SPAA 2013. ACM Trans. Parallel Comput. 2 (3) (2015)
Atish Das Sarma, Michael Dinitz, Gopal Pandurangan
Efficient distributed computation of distance sketches in networks. Distributed Comput. 28 (5) (2015)
Michael Dinitz, Michael Schapira, Asaf Valadarsky
Explicit Expanding Expanders. ESA (2015)
Michael Dinitz, Jeremy T. Fineman, Seth Gilbert, Calvin C. Newport
Smoothed Analysis of Dynamic Networks. DISC (2015)
Michael Dinitz, Robert Krauthgamer, Tal Wagner
Towards Resistance Sparsifiers. APPROX-RANDOM (2015)
Asaf Valadarsky, Michael Dinitz, Michael Schapira
Xpander: Unveiling the Secrets of High-Performance Datacenters. HotNets (2015)
Michael Dinitz, Jeremy T. Fineman, Seth Gilbert, Calvin Newport
Smoothed Analysis of Dynamic Networks. CoRR (2015)
Michael Dinitz, Robert Krauthgamer, Tal Wagner
Towards Resistance Sparsifiers. CoRR (2015)
Eden Chlamtác, Michael Dinitz
Lowest Degree k-Spanner: Approximation and Hardness. APPROX-RANDOM (2014)
Michael Dinitz, Guy Kortsarz, Zeev Nutov
Improved Approximation Algorithm for Steiner k-Forest with Nearly Uniform Weights. APPROX-RANDOM (2014)
Michael Dinitz, Guy Kortsarz
Matroid Secretary for Regular and Decomposable Matroids. SIAM J. Comput. 43 (5) (2014)
Michael Dinitz, Merav Parter
Braess's Paradox in Wireless Networks: The Danger of Improved Technology. CoRR (2013)
Michael Dinitz, Anupam Gupta
Packing Interdiction and Partial Covering Problems. IPCO (2013)
Michael Dinitz, Merav Parter
Braess's Paradox in Wireless Networks: The Danger of Improved Technology. DISC (2013)
Michael Dinitz, Guy Kortsarz
Matroid Secretary for Regular and Decomposable Matroids. SODA (2013)
Michael Dinitz
Recent advances on the matroid secretary problem. SIGACT News 44 (2) (2013)
Eden Chlamtac, Michael Dinitz, Robert Krauthgamer
Everywhere-Sparse Spanners via Dense Subgraphs CoRR (2012)
Michael Dinitz, Gordon T. Wilfong
iBGP and Constrained Connectivity. APPROX-RANDOM (2012)

Michael Dinitz.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Michael Dinitz