 | 2012 |
| 16 |  | Michael Dinitz,
Guy Kortsarz,
Ran Raz:
Label Cover instances with large girth and the hardness of approximating basic k-spanner
CoRR abs/1203.0224: (2012) |
| 2011 |
| 15 |  | Michael Dinitz,
Robert Krauthgamer:
Fault-tolerant spanners: better and simpler.
PODC 2011: 169-178 |
| 14 |  | Michael Dinitz,
Robert Krauthgamer:
Directed spanners via flow-based linear programs.
STOC 2011: 323-332 |
| 13 |  | Michael Dinitz,
Robert Krauthgamer:
Fault-Tolerant Spanners: Better and Simpler
CoRR abs/1101.5753: (2011) |
| 12 |  | Michael Dinitz,
Gordon T. Wilfong:
iBGP and Constrained Connectivity
CoRR abs/1107.2299: (2011) |
| 11 |  | Atish Das Sarma,
Michael Dinitz,
Gopal Pandurangan:
Efficient Computation of Distance Sketches in Distributed Networks
CoRR abs/1112.1210: (2011) |
| 2010 |
| 10 |  | Michael Dinitz:
Distributed Algorithms for Approximating Wireless Network Capacity.
INFOCOM 2010: 1397-1405 |
| 9 |  | Michael Dinitz,
Robert Krauthgamer:
Directed Spanners via Flow-Based Linear Programs
CoRR abs/1011.3701: (2010) |
| 2009 |
| 8 |  | Matthew Andrews,
Michael Dinitz:
Maximizing Capacity in Arbitrary Wireless Networks in the SINR Model: Complexity and Game Theory.
INFOCOM 2009: 1332-1340 |
| 7 |  | Michael Dinitz:
Brief announcement: distributed algorithms for approximating wireless network capacity.
PODC 2009: 328-329 |
| 6 |  | Moshe Babaioff,
Michael Dinitz,
Anupam Gupta,
Nicole Immorlica,
Kunal Talwar:
Secretary problems: weights and discounts.
SODA 2009: 1245-1254 |
| 2008 |
| 5 |  | Michael Dinitz:
Online, Dynamic, and Distributed Embeddings of Approximate Ultrametrics.
DISC 2008: 152-166 |
| 4 |  | Michael Dinitz:
Online and dynamic embeddings of approximate ultrametrics.
PODC 2008: 416 |
| 2007 |
| 3 |  | Michael Dinitz:
Compact routing with slack.
PODC 2007: 81-88 |
| 2006 |
| 2 |  | Hubert T.-H. Chan,
Michael Dinitz,
Anupam Gupta:
Spanners with Slack.
ESA 2006: 196-207 |
| 1 |  | Michael Dinitz:
Full Rank Tilings of Finite Abelian Groups.
SIAM J. Discrete Math. 20(1): 160-170 (2006) |