Michael Dinitz

Citeret af

	Alle	Siden 2019
Henvisninger	1771	1017
h-index	25	19
i10-indeks	38	35

200

100

150

2007200820092010201120122013201420152016201720182019202020212022202320246 10 26 32 57 74 70 71 72 90 107 115 133 159 190 184 178 170

Offentlig adgang

Se alle

30 artikler

0 artikler

tilgængelige

ikke tilgængelige

Baseret på krav i forbindelse med finansiering

Medforfattere

Guy KortsarzProfessor computer scienceVerificeret mail på camden.rutgers.edu
Michael SchapiraProfessor of Computer Science, The Hebrew University of JerusalemVerificeret mail på huji.ac.il
Robert KrauthgamerWeizmann Institute of ScienceVerificeret mail på weizmann.ac.il
Gal ShahafWeizmann institute of ScienceVerificeret mail på mail.huji.ac.il
Asaf ValadarskyHebrew University of JerusalemVerificeret mail på mail.huji.ac.il
Greg BodwinUniversity of MichiganVerificeret mail på umich.edu
Anupam GuptaProfessor of Computer Science at New York UniversityVerificeret mail på nyu.edu
Yasamin NazariAssistant Professor, VU AmsterdamVerificeret mail på jhu.edu
Calvin NewportProfessor of Computer Science, Georgetown UniversityVerificeret mail på georgetown.edu
Benjamin MoseleyCarnegie Mellon UniversityVerificeret mail på andrew.cmu.edu
Sergei VassilvitskiiGoogleVerificeret mail på google.com
Amy BabayUniversity of PittsburghVerificeret mail på pitt.edu
Caleb RobellePhd Student, Massachusetts Institute of TechnologyVerificeret mail på mit.edu
Christian KonradUniversity of BristolVerificeret mail på bristol.ac.uk
George RabancaGraduate Center CUNYVerificeret mail på gradcenter.cuny.edu
Sungjin ImUniversity of California, MercedVerificeret mail på ucmerced.edu
Thomas LavastidaAssistant Professor, Jindal School of Management, University of Texas at DallasVerificeret mail på utdallas.edu
Matthew AndrewsNokia Bell LabsVerificeret mail på nokia-bell-labs.com
Seth GilbertNational University of SingaporeVerificeret mail på comp.nus.edu.sg
Zeev NutovThe Open University of IsraelVerificeret mail på openu.ac.il

Følg

Michael Dinitz

Associate Professor, Johns Hopkins University

Verificeret mail på cs.jhu.edu - Startside

Algorithms networking distributed computing


Titel Sortér efter henvisninger Sortér efter årstal Sortér efter titel	Citeret af Citeret af	Å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	230	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	126	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	110	2009
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	68*	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	63	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	59	2012
Matroid secretary for regular and decomposable matroids M Dinitz, G Kortsarz SIAM Journal on Computing 43 (5), 1807-1830, 2014	57	2014
Spanners with slack THH Chan, M Dinitz, A Gupta European Symposium on Algorithms, 196-207, 2006	54	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	48	2011
Recent advances on the matroid secretary problem M Dinitz ACM SIGACT News 44 (2), 126-142, 2013	44	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	42	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	41	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	35	2020
Packing interdiction and partial covering problems M Dinitz, A Gupta International Conference on Integer Programming and Combinatorial …, 2013	34	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
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	29	2021
Efficient and simple algorithms for fault-tolerant spanners M Dinitz, C Robelle Proceedings of the 39th Symposium on Principles of Distributed Computing …, 2020	29	2020

Systemet kan ikke foretage handlingen nu. Prøv igen senere.

Artikler 1–20

Henvisninger pr. år

Dublerede henvisninger

Flettede henvisninger

Tilføj medforfattereMedforfattere

Følg

Citeret af

Medforfattere