Jeremy Kun

Citeras av

	Alla	Sedan 2019
Citat	428	326
h-index	6	5
i10-index	5	5

201420152016201720182019202020212022202320244 5 18 33 38 39 65 55 54 67 45

Offentlig åtkomst

Visa alla

2 artiklar

1 artikel

tillgänglig

inte tillgänglig

Enligt krav från finansiärer

Medförfattare

Adam D. LelkesGoogle DeepMindVerifierad e-postadress på google.com
Benjamin FishAssistant Professor, University of MichiganVerifierad e-postadress på umich.edu
Lev ReyzinProfessor of Mathematics, Statistics, and Computer Science; University of Illinois at ChicagoVerifierad e-postadress på uic.edu
Dr. Brian PowersInstructorVerifierad e-postadress på asu.edu
Gyorgy Turan University of Illinois at Chicago, and Hungarian Academy of SciencesVerifierad e-postadress på uic.edu
Kevin M. CarterMicrosoftVerifierad e-postadress på microsoft.com
David BursteinAssistant Professor, Icahn School of Medicine at Mount SinaiVerifierad e-postadress på mssm.edu
Prof. Alexander GutfraindAmazon, Loyola University ChicagoVerifierad e-postadress på cornell.edu
Franklin KenterUnited States Naval AcademyVerifierad e-postadress på usna.edu
Bill ShiApplied ScientistVerifierad e-postadress på email.unc.edu

Följ

Jeremy Kun

Google, Inc.

Verifierad e-postadress på google.com - Startsida

Theoretical Computer Science Learning Theory Complexity Theory


Titel Sortera efter citat Sortera efter år Sortera efter titel	Citeras av Citeras av	År
A confidence-based approach for balancing fairness and accuracy B Fish, J Kun, ÁD Lelkes Proceedings of the 2016 SIAM international conference on data mining, 144-152, 2016	281	2016
Anti-coordination games and stable graph colorings J Kun, B Powers, L Reyzin Algorithmic Game Theory: 6th International Symposium, SAGT 2013, Aachen …, 2013	46	2013
Fair boosting: a case study B Fish, J Kun, AD Lelkes Workshop on Fairness, Accountability, and Transparency in Machine Learning, 5, 2015	35	2015
On the computational complexity of mapreduce B Fish, J Kun, AD Lelkes, L Reyzin, G Turán Distributed Computing: 29th International Symposium, DISC 2015, Tokyo, Japan …, 2015	32	2015
Polynomial treedepth bounds in linear colorings J Kun, MP O’Brien, M Pilipczuk, BD Sullivan Algorithmica 83 (1), 361-386, 2021	10	2021
Treedepth bounds in linear colorings J Kun, MP O’Brien, BD Sullivan Graph-Theoretic Concepts in Computer Science: 44th International Workshop …, 2018	6	2018
Locally boosted graph aggregation for community detection J Kun, R Caceres, K Carter arXiv preprint arXiv:1405.3210, 2014	5	2014
On coloring resilient graphs J Kun, L Reyzin International Symposium on Mathematical Foundations of Computer Science, 517-528, 2014	4	2014
Interception in distance-vector routing networks D Burstein, F Kenter, J Kun, F Shi Journal of Complex Networks 5 (2), 179-198, 2017	2	2017
Network installation under convex costs A Gutfraind, J Kun, ÁD Lelkes, L Reyzin Journal of Complex Networks 4 (2), 177-186, 2016	2	2016
Open problem: Learning quantum circuits with queries J Kun, L Reyzin Conference on Learning Theory, 1767-1769, 2015	2	2015
A boosting approach to learning graph representations R Caceres, K Carter, J Kun arXiv preprint arXiv:1401.3258, 2014	2	2014
Graphs, New Models, and Complexity J Kun University of Illinois at Chicago, 2016	1	2016
Information Monitoring in Routing Networks D Burstein, F Kenter, J Kun, F Shi arXiv preprint arXiv:1507.05206, 2015		2015

Systemet kan inte utföra åtgärden just nu. Försök igen senare.

Artiklar 1–14

Citat per år

Dubblettcitat

Sammanfogade citat

Lägg till medförfattareMedförfattare

Följ

Citeras av

Medförfattare