Jeremy Kun

According to our database, Jeremy Kun authored at least 19 papers between 2013 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Adapting AlphaEvolve to Optimize Fully Homomorphic Encryption on TPUs.

Shruthi Gorantala, Jianming Tong, Asra Ali, Baiyu Li, Jonathan Katz, Jeremy Kun, Thomas Steinke, Abhradeep Thakurta, Julian Walker, Amir Yazdanbakhsh

CoRR, May, 2026

Enabling AI ASICs for Zero Knowledge Proof.

Jianming Tong, Jingtian Dang, Simon Langowski, Tianhao Huang, Asra Ali, Jeremy Kun, Jevin Jiang, Srinivas Devadas, Tushar Krishna

CoRR, April, 2026

Leveraging ASIC AI Chips for Homomorphic Encryption.

Jianming Tong, Tianhao Huang, Jingtian Dang, Leo de Castro, Anirudh Itagi, Anupam Golder, Asra Ali, Jeremy Kun, Jevin Jiang, Arvind, G. Edward Suh, Tushar Krishna

Proceedings of the IEEE International Symposium on High Performance Computer Architecture, 2026

2025

Leveraging ASIC AI Chips for Homomorphic Encryption.

Jianming Tong, Tianhao Huang, Jingtian Dang, Leo de Castro, Anirudh Itagi, Asra Ali, Jeremy Kun, Jevin Jiang, Arvind, Anupam Golder, G. Edward Suh, Tushar Krishna

Dataset, December, 2025

Leveraging ASIC AI Chips for Homomorphic Encryption.

Jianming Tong, Tianhao Huang, Jingtian Dang, Leo de Castro, Anirudh Itagi, Asra Ali, Jeremy Kun, Jevin Jiang, Arvind, Anupam Golder, Gookwon Edward Suh, Tushar Krishna

Dataset, December, 2025

HEIR: A Universal Compiler for Homomorphic Encryption.

Asra Ali, Jaeho Choi, Bryant Gipson, Shruthi Gorantala, Jeremy Kun, Wouter Legiest, Lawrence Lim, Alexander Viand, Meron Zerihun Demissie, Hongren Zheng

CoRR, August, 2025

2021

Polynomial Treedepth Bounds in Linear Colorings.

Jeremy Kun, Michael P. O'Brien, Marcin Pilipczuk, Blair D. Sullivan

Algorithmica, 2021

2018

Treedepth Bounds in Linear Colorings.

Jeremy Kun, Michael P. O'Brien, Blair D. Sullivan

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

2017

Interception in distance-vector routing networks.

David Burstein, Franklin Kenter, Jeremy Kun, Feng Shi

J. Complex Networks, 2017

2016

Network installation under convex costs.

Alexander Gutfraind, Jeremy Kun, Ádám Dániel Lelkes, Lev Reyzin

J. Complex Networks, 2016

A Confidence-Based Approach for Balancing Fairness and Accuracy.

Benjamin Fish, Jeremy Kun, Ádám Dániel Lelkes

Proceedings of the 2016 SIAM International Conference on Data Mining, 2016

2015

Information Monitoring in Routing Networks.

David Burstein, Franklin Kenter, Jeremy Kun, Feng Shi

CoRR, 2015

On the Computational Complexity of MapReduce.

Benjamin Fish, Jeremy Kun, Ádám Dániel Lelkes, Lev Reyzin, György Turán

Proceedings of the Distributed Computing - 29th International Symposium, 2015

Open Problem: Learning Quantum Circuits with Queries.

Jeremy Kun, Lev Reyzin

Proceedings of The 28th Conference on Learning Theory, 2015

2014

Locally Boosted Graph Aggregation for Community Detection.

Jeremy Kun, Rajmonda Caceres, Kevin Carter

CoRR, 2014

Network installation and recovery: approximation lower bounds and faster exact formulations.

Alexander Gutfraind, Jeremy Kun, Ádám Dániel Lelkes, Lev Reyzin

CoRR, 2014

A Boosting Approach to Learning Graph Representations.

Rajmonda Caceres, Kevin Carter, Jeremy Kun

CoRR, 2014

On Coloring Resilient Graphs.

Jeremy Kun, Lev Reyzin

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2013

Anti-coordination Games and Stable Graph Colorings.

Jeremy Kun, Brian Powers, Lev Reyzin

Proceedings of the Algorithmic Game Theory - 6th International Symposium, 2013