Michael Dinitz

Citée par

	Toutes	Depuis 2020
Citations	1878	994
indice h	25	18
indice i10	39	32

220

110

165

20072008200920102011201220132014201520162017201820192020202120222023202420256 10 26 33 56 75 69 71 72 90 107 115 133 159 191 198 190 206 48

Accès public

Tout afficher

31 articles

0 article

disponibles

non disponibles

Sur la base des exigences liées au financement

Coauteurs

Guy KortsarzProfessor computer scienceAdresse e-mail validée de camden.rutgers.edu
Michael SchapiraProfessor of Computer Science, The Hebrew University of JerusalemAdresse e-mail validée de huji.ac.il
Robert KrauthgamerWeizmann Institute of ScienceAdresse e-mail validée de weizmann.ac.il
Gal ShahafWeizmann institute of ScienceAdresse e-mail validée de mail.huji.ac.il
Asaf ValadarskyHebrew University of JerusalemAdresse e-mail validée de mail.huji.ac.il
Greg BodwinUniversity of MichiganAdresse e-mail validée de umich.edu
Yasamin NazariAssistant Professor, VU AmsterdamAdresse e-mail validée de jhu.edu
Anupam GuptaProfessor of Computer Science at New York UniversityAdresse e-mail validée de nyu.edu
Calvin NewportProfessor of Computer Science, Georgetown UniversityAdresse e-mail validée de georgetown.edu
Benjamin MoseleyCarnegie Mellon UniversityAdresse e-mail validée de andrew.cmu.edu
Sergei VassilvitskiiGoogleAdresse e-mail validée de google.com
Amy BabayUniversity of PittsburghAdresse e-mail validée de pitt.edu
Caleb RobellePhd Student, Massachusetts Institute of TechnologyAdresse e-mail validée de mit.edu
Christian KonradUniversity of BristolAdresse e-mail validée de bristol.ac.uk
George RabancaGraduate Center CUNYAdresse e-mail validée de gradcenter.cuny.edu
Sungjin ImUniversity of California, MercedAdresse e-mail validée de ucmerced.edu
Thomas LavastidaAssistant Professor, Jindal School of Management, University of Texas at DallasAdresse e-mail validée de utdallas.edu
Matthew AndrewsNokia Bell LabsAdresse e-mail validée de nokia-bell-labs.com
Seth GilbertNational University of SingaporeAdresse e-mail validée de comp.nus.edu.sg
Zeev NutovThe Open University of IsraelAdresse e-mail validée de openu.ac.il

Suivre

Michael Dinitz

Associate Professor, Johns Hopkins University

Adresse e-mail validée de cs.jhu.edu - Page d'accueil

Algorithms networking distributed computing


Titre Trier par citations Trier par année Trier par titre	Citée par Citée par	Année
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	130	2016
Fault-tolerant spanners: better and simpler M Dinitz, R Krauthgamer Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of …, 2011	119	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	112	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	93*	2021
Distributed algorithms for approximating wireless network capacity M Dinitz 2010 Proceedings IEEE INFOCOM, 1-9, 2010	87	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	70*	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
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	61	2012
Matroid secretary for regular and decomposable matroids M Dinitz, G Kortsarz SIAM Journal on Computing 43 (5), 1807-1830, 2014	58	2014
Spanners with slack THH Chan, M Dinitz, A Gupta European Symposium on Algorithms, 196-207, 2006	56	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	47	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	43	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	43	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	35	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
Full rank tilings of finite abelian groups M Dinitz SIAM Journal on Discrete Mathematics 20 (1), 160-170, 2006	32	2006
Approximating low-stretch spanners M Dinitz, Z Zhang Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016	31	2016

Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.

Articles 1–20

Nombre de citations par an

Citations en double

Citations fusionnées

Ajouter les coauteursCoauteurs

Suivre

Citée par

Coauteurs