Följ
Jeremy Kun
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
2562016
Anti-coordination games and stable graph colorings
J Kun, B Powers, L Reyzin
Algorithmic Game Theory: 6th International Symposium, SAGT 2013, Aachen …, 2013
432013
Fair boosting: a case study
B Fish, J Kun, AD Lelkes
Workshop on Fairness, Accountability, and Transparency in Machine Learning, 5, 2015
312015
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
312015
Polynomial treedepth bounds in linear colorings
J Kun, MP O’Brien, M Pilipczuk, BD Sullivan
Algorithmica 83 (1), 361-386, 2021
82021
Treedepth bounds in linear colorings
J Kun, MP O’Brien, BD Sullivan
Graph-Theoretic Concepts in Computer Science: 44th International Workshop …, 2018
52018
Locally boosted graph aggregation for community detection
J Kun, R Caceres, K Carter
arXiv preprint arXiv:1405.3210, 2014
52014
On coloring resilient graphs
J Kun, L Reyzin
International Symposium on Mathematical Foundations of Computer Science, 517-528, 2014
42014
Interception in distance-vector routing networks
D Burstein, F Kenter, J Kun, F Shi
Journal of Complex Networks 5 (2), 179-198, 2017
22017
Network installation under convex costs
A Gutfraind, J Kun, ÁD Lelkes, L Reyzin
Journal of Complex Networks 4 (2), 177-186, 2016
22016
Open problem: Learning quantum circuits with queries
J Kun, L Reyzin
Conference on Learning Theory, 1767-1769, 2015
22015
A boosting approach to learning graph representations
R Caceres, K Carter, J Kun
arXiv preprint arXiv:1401.3258, 2014
22014
Graphs, New Models, and Complexity
J Kun
University of Illinois at Chicago, 2016
12016
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