Michael Dinitz

Sitert av

	Alle	Siden 2020
Sitater	1898	1014
h-indeks	25	18
i10-indeks	39	32

220

110

165

20072008200920102011201220132014201520162017201820192020202120222023202420256 10 27 33 56 76 73 70 68 89 107 115 133 159 192 197 186 211 68

Offentlig tilgang

Vis alle

33 artikler

0 artikler

tilgjengelige

ikke tilgjengelige

Basert på finansieringsmandater

Medforfattere

Guy KortsarzProfessor computer scienceVerifisert e-postadresse på camden.rutgers.edu
Michael SchapiraProfessor of Computer Science, The Hebrew University of JerusalemVerifisert e-postadresse på huji.ac.il
Robert KrauthgamerWeizmann Institute of ScienceVerifisert e-postadresse på weizmann.ac.il
Gal ShahafWeizmann institute of ScienceVerifisert e-postadresse på mail.huji.ac.il
Greg BodwinUniversity of MichiganVerifisert e-postadresse på umich.edu
Asaf ValadarskyHebrew University of JerusalemVerifisert e-postadresse på mail.huji.ac.il
Yasamin NazariAssistant Professor, VU AmsterdamVerifisert e-postadresse på jhu.edu
Anupam GuptaProfessor of Computer Science at New York UniversityVerifisert e-postadresse på nyu.edu
Calvin NewportProfessor of Computer Science, Georgetown UniversityVerifisert e-postadresse på georgetown.edu
Benjamin MoseleyCarnegie Mellon UniversityVerifisert e-postadresse på andrew.cmu.edu
Sergei VassilvitskiiGoogleVerifisert e-postadresse på google.com
Amy BabayUniversity of PittsburghVerifisert e-postadresse på pitt.edu
Caleb RobellePhd Student, Massachusetts Institute of TechnologyVerifisert e-postadresse på mit.edu
Christian KonradUniversity of BristolVerifisert e-postadresse på bristol.ac.uk
George RabancaGraduate Center CUNYVerifisert e-postadresse på gradcenter.cuny.edu
Sungjin ImUniversity of California, MercedVerifisert e-postadresse på ucmerced.edu
Thomas LavastidaAssistant Professor, Jindal School of Management, University of Texas at DallasVerifisert e-postadresse på utdallas.edu
Matthew AndrewsNokia Bell LabsVerifisert e-postadresse på nokia-bell-labs.com
Seth GilbertNational University of SingaporeVerifisert e-postadresse på comp.nus.edu.sg
Zeev NutovThe Open University of IsraelVerifisert e-postadresse på openu.ac.il

Følg

Michael Dinitz

Associate Professor, Johns Hopkins University

Verifisert e-postadresse på cs.jhu.edu - Startside

Algorithms networking distributed computing


Tittel Sorter etter sitater Sorter etter år Sorter etter tittel	Sitert av Sitert av	År
Maximizing capacity in arbitrary wireless networks in the SINR model: Complexity and game theory M Andrews, M Dinitz IEEE INFOCOM 2009, 1332-1340, 2009	231	2009
Xpander: Towards optimal-performance datacenters A Valadarsky, G Shahaf, M Dinitz, M Schapira Proceedings of the 12th International on Conference on emerging Networking …, 2016	132	2016
Fault-tolerant spanners: better and simpler M Dinitz, R Krauthgamer Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of …, 2011	121	2011
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	114	2009
Faster matchings via learned duals M Dinitz, S Im, T Lavastida, B Moseley, S Vassilvitskii Advances in neural information processing systems 34, 10393-10406, 2021	95*	2021
Distributed algorithms for approximating wireless network capacity M Dinitz 2010 Proceedings IEEE INFOCOM, 1-9, 2010	88	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	69*	2018
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	64	2017
Matroid secretary for regular and decomposable matroids M Dinitz, G Kortsarz SIAM Journal on Computing 43 (5), 1807-1830, 2014	59	2014
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	59	2012
Spanners with slack THH Chan, M Dinitz, A Gupta European Symposium on Algorithms, 196-207, 2006	57	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	50	2011
Recent advances on the matroid secretary problem M Dinitz ACM SIGACT News 44 (2), 126-142, 2013	48	2013
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	44	2018
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	42	2015
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	37	2020
Packing interdiction and partial covering problems M Dinitz, A Gupta International Conference on Integer Programming and Combinatorial …, 2013	36	2013
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	33	2015
Efficient and simple algorithms for fault-tolerant spanners M Dinitz, C Robelle Proceedings of the 39th Symposium on Principles of Distributed Computing …, 2020	32	2020
Full rank tilings of finite abelian groups M Dinitz SIAM Journal on Discrete Mathematics 20 (1), 160-170, 2006	32	2006

Systemet kan ikke utføre handlingen. Prøv på nytt senere.

Artikler 1–20

Sitater per år

Duplikatsitater

Sammenslåtte sitater

Legg til medforfattereMedforfattere

Følg

Sitert av

Medforfattere