Michael Dinitz

Citirano

	Sve	Od 2018.
Citati	1573	939
H-indeks	22	19
i10-indeks	36	33

200

100

150

200720082009201020112012201320142015201620172018201920202021202220236 10 26 32 57 75 68 71 71 90 107 112 132 161 194 175 165

Javni pristup

Prikaži sve

29 članaka

0 članaka

dostupno

nije dostupno

Na temelju uvjeta financiranja

Suautori

Guy KortsarzProfessor computer sciencePotvrđena adresa e-pošte na camden.rutgers.edu
Michael SchapiraProfessor of Computer Science, The Hebrew University of JerusalemPotvrđena adresa e-pošte na huji.ac.il
Robert KrauthgamerWeizmann Institute of SciencePotvrđena adresa e-pošte na weizmann.ac.il
Gal ShahafWeizmann institute of SciencePotvrđena adresa e-pošte na mail.huji.ac.il
Asaf ValadarskyHebrew University of JerusalemPotvrđena adresa e-pošte na mail.huji.ac.il
Anupam GuptaProfessor of Computer Science at Carnegie Mellon UniversityPotvrđena adresa e-pošte na cs.cmu.edu
Greg BodwinUniversity of MichiganPotvrđena adresa e-pošte na umich.edu
Calvin NewportGeorgetown UniversityPotvrđena adresa e-pošte na cs.georgetown.edu
Yasamin NazariAssistant Professor, VU AmsterdamPotvrđena adresa e-pošte na jhu.edu
Amy BabayUniversity of PittsburghPotvrđena adresa e-pošte na pitt.edu
Benjamin MoseleyCarnegie Mellon UniversityPotvrđena adresa e-pošte na andrew.cmu.edu
Christian KonradUniversity of BristolPotvrđena adresa e-pošte na bristol.ac.uk
George RabancaGraduate Center CUNYPotvrđena adresa e-pošte na gradcenter.cuny.edu
Matthew AndrewsNokia Bell LabsPotvrđena adresa e-pošte na nokia-bell-labs.com
Caleb RobellePhd Student, Massachusetts Institute of TechnologyPotvrđena adresa e-pošte na mit.edu
Seth GilbertNational University of SingaporePotvrđena adresa e-pošte na comp.nus.edu.sg
Sergei VassilvitskiiGooglePotvrđena adresa e-pošte na google.com
Kunal TalwarApple IncPotvrđena adresa e-pošte na apple.com
Moshe BabaioffHebrew University of JerusalemPotvrđena adresa e-pošte na mail.huji.ac.il
Nicole ImmorlicaMicrosoft ResearchPotvrđena adresa e-pošte na microsoft.com

Prati

Michael Dinitz

Associate Professor, Johns Hopkins University

Potvrđena adresa e-pošte na cs.jhu.edu - Početna stranica

Algorithms networking distributed computing


Naslov Poredaj po navodima Poredaj po godini Poredaj po naslovu	Citirano Citirano	Godina
Maximizing capacity in arbitrary wireless networks in the SINR model: Complexity and game theory M Andrews, M Dinitz IEEE INFOCOM 2009, 1332-1340, 2009	224	2009
Fault-tolerant spanners: better and simpler M Dinitz, R Krauthgamer Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of …, 2011	110	2011
Xpander: Towards optimal-performance datacenters A Valadarsky, G Shahaf, M Dinitz, M Schapira Proceedings of the 12th International on Conference on emerging Networking …, 2016	108	2016
Secretary problems: weights and discounts M Babaioff, M Dinitz, A Gupta, N Immorlica, K Talwar Proceedings of the twentieth annual ACM-SIAM Symposium on Discrete …, 2009	104	2009
Distributed algorithms for approximating wireless network capacity M Dinitz 2010 Proceedings IEEE INFOCOM, 1-9, 2010	86	2010
The Densest -Subhypergraph Problem E Chlamtác, M Dinitz, C Konrad, G Kortsarz, G Rabanca SIAM Journal on Discrete Mathematics 32 (2), 1458-1477, 2018	61*	2018
Everywhere-sparse spanners via dense subgraphs E Chlamtac, M Dinitz, R Krauthgamer 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 758-767, 2012	56	2012
Minimizing the union: Tight approximations for small set bipartite vertex expansion E Chlamtáč, M Dinitz, Y Makarychev Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017	53	2017
Matroid secretary for regular and decomposable matroids M Dinitz, G Kortsarz SIAM Journal on Computing 43 (5), 1807-1830, 2014	51	2014
Spanners with slack THH Chan, M Dinitz, A Gupta European Symposium on Algorithms, 196-207, 2006	50	2006
Directed spanners via flow-based linear programs M Dinitz, R Krauthgamer Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011	44	2011
Recent advances on the matroid secretary problem M Dinitz ACM SIGACT News 44 (2), 126-142, 2013	40	2013
Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner M Dinitz, G Kortsarz, R Raz ACM Transactions on Algorithms (TALG) 12 (2), 1-16, 2015	38	2015
Optimal vertex fault tolerant spanners (for fixed stretch) G Bodwin, M Dinitz, M Parter, VV Williams Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018	32	2018
Xpander: Unveiling the secrets of high-performance datacenters A Valadarsky, M Dinitz, M Schapira Proceedings of the 14th ACM Workshop on Hot Topics in Networks, 1-7, 2015	32	2015
Full rank tilings of finite abelian groups M Dinitz SIAM Journal on Discrete Mathematics 20 (1), 160-170, 2006	31	2006
Approximating spanners and directed steiner forest: Upper and lower bounds E Chlamtáč, M Dinitz, G Kortsarz, B Laekhanukit ACM Transactions on Algorithms (TALG) 16 (3), 1-31, 2020	29	2020
Packing interdiction and partial covering problems M Dinitz, A Gupta International Conference on Integer Programming and Combinatorial …, 2013	29	2013
Timely, reliable, and cost-effective internet transport service using dissemination graphs A Babay, E Wagner, M Dinitz, Y Amir 2017 IEEE 37th International Conference on Distributed Computing Systems …, 2017	26	2017
Approximating low-stretch spanners M Dinitz, Z Zhang Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016	26	2016

Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.

Članci 1–20

Godišnji broj citata

Dvostruki navodi

Spojeni navodi

Dodavanje suautoraSuautori

Prati

Citirano

Suautori