default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJeremy Kun
Person information
- affiliation: University of Illinois at Chicago, Department of Mathematics
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j3]Jeremy Kun, Michael P. O'Brien, Marcin Pilipczuk
, Blair D. Sullivan:
Polynomial Treedepth Bounds in Linear Colorings. Algorithmica 83(1): 361-386 (2021)
2010 – 2019
- 2018
- [c6]Jeremy Kun, Michael P. O'Brien, Blair D. Sullivan:
Treedepth Bounds in Linear Colorings. WG 2018: 331-343 - [i9]Jeremy Kun, Michael P. O'Brien, Blair D. Sullivan:
Treedepth Bounds in Linear Colorings. CoRR abs/1802.09665 (2018) - 2017
- [j2]David Burstein, Franklin Kenter, Jeremy Kun, Feng Shi:
Interception in distance-vector routing networks. J. Complex Networks 5(2): 179-198 (2017) - 2016
- [j1]Alexander Gutfraind, Jeremy Kun, Ádám Dániel Lelkes, Lev Reyzin:
Network installation under convex costs. J. Complex Networks 4(2): 177-186 (2016) - [c5]Benjamin Fish, Jeremy Kun, Ádám Dániel Lelkes:
A Confidence-Based Approach for Balancing Fairness and Accuracy. SDM 2016: 144-152 - [i8]Benjamin Fish, Jeremy Kun, Ádám Dániel Lelkes:
A Confidence-Based Approach for Balancing Fairness and Accuracy. CoRR abs/1601.05764 (2016) - 2015
- [c4]Jeremy Kun, Lev Reyzin:
Open Problem: Learning Quantum Circuits with Queries. COLT 2015: 1767-1769 - [c3]Benjamin Fish, Jeremy Kun, Ádám Dániel Lelkes, Lev Reyzin, György Turán:
On the Computational Complexity of MapReduce. DISC 2015: 1-15 - [i7]David Burstein, Franklin Kenter, Jeremy Kun, Feng Shi:
Information Monitoring in Routing Networks. CoRR abs/1507.05206 (2015) - 2014
- [c2]Jeremy Kun, Lev Reyzin:
On Coloring Resilient Graphs. MFCS (2) 2014: 517-528 - [i6]Rajmonda Caceres, Kevin Carter, Jeremy Kun:
A Boosting Approach to Learning Graph Representations. CoRR abs/1401.3258 (2014) - [i5]Jeremy Kun, Lev Reyzin:
On Coloring Resilient Graphs. CoRR abs/1402.4376 (2014) - [i4]Jeremy Kun, Rajmonda Caceres, Kevin Carter:
Locally Boosted Graph Aggregation for Community Detection. CoRR abs/1405.3210 (2014) - [i3]Benjamin Fish, Jeremy Kun, Ádám Dániel Lelkes, Lev Reyzin, György Turán:
On the Computational Complexity of MapReduce. CoRR abs/1410.0245 (2014) - [i2]Alexander Gutfraind, Jeremy Kun, Ádám Dániel Lelkes, Lev Reyzin:
Network installation and recovery: approximation lower bounds and faster exact formulations. CoRR abs/1411.3640 (2014) - 2013
- [c1]Jeremy Kun, Brian Powers, Lev Reyzin:
Anti-coordination Games and Stable Graph Colorings. SAGT 2013: 122-133 - [i1]Jeremy Kun, Brian Powers, Lev Reyzin:
Anti-Coordination Games and Stable Graph Colorings. CoRR abs/1308.3258 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
