default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYoung Kun-Ko
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[i12]Young Kun-Ko:
Efficient Linearization Implies the Multiphase Conjecture. Electron. Colloquium Comput. Complex. TR22 (2022)- 2020
- [c8]Young Kun-Ko, Omri Weinstein:
An Adaptive Step Toward the Multiphase Conjecture. FOCS 2020: 752-761 - [i11]Young Kun-Ko, Min Jae Song:
Hardness of Approximate Nearest Neighbor Search under L-infinity. CoRR abs/2011.06135 (2020)
2010 – 2019
- 2019
- [i10]Young Kun-Ko, Omri Weinstein:
An Adaptive Step Toward the Multiphase Conjecture. CoRR abs/1910.13543 (2019) - 2018
- [b1]Young Kun-Ko:
Hardness Amplification in Two Prover Game and Communication Complexity. Princeton University, USA, 2018 - [j1]Mark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette:
Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness. SIAM J. Comput. 47(6): 2277-2314 (2018) - [c7]Mark Braverman, Young Kun-Ko:
Semi-Direct Sum Theorem and Nearest Neighbor under l_infty. APPROX-RANDOM 2018: 6:1-6:17 - [c6]Mark Braverman, Young Kun-Ko:
Information Value of Two-Prover Games. ITCS 2018: 12:1-12:15 - [i9]Young Kun-Ko:
On Symmetric Parallel Repetition : Towards Equivalence of MAX-CUT and UG. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c5]Mark Braverman, Young Kun-Ko, Aviad Rubinstein, Omri Weinstein:
ETH Hardness for Densest-k-Subgraph with Perfect Completeness. SODA 2017: 1326-1341 - [i8]Mark Braverman, Young Kun-Ko:
Information Value of Two-Prover Games. Electron. Colloquium Comput. Complex. TR17 (2017) - [i7]Young Kun-Ko, Ariel Schvartzman:
Bounds for the Communication Complexity of Two-Player Approximate Correlated Equilibria. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [c4]Umang Bhaskar, Yu Cheng
, Young Kun-Ko, Chaitanya Swamy:
Hardness Results for Signaling in Bayesian Zero-Sum and Network Routing Games. EC 2016: 479-496 - 2015
- [c3]Mark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette:
Near-Optimal Bounds on Bounded-Round Quantum Communication Complexity of Disjointness. FOCS 2015: 773-791 - [c2]Mark Braverman, Young Kun-Ko, Omri Weinstein:
Approximating the best Nash Equilibrium in no(log n)-time breaks the Exponential Time Hypothesis. SODA 2015: 970-982 - [i6]Mark Braverman, Young Kun-Ko, Aviad Rubinstein, Omri Weinstein:
ETH Hardness for Densest-$k$-Subgraph with Perfect Completeness. CoRR abs/1504.08352 (2015) - [i5]Mark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette:
Near-optimal bounds on bounded-round quantum communication complexity of disjointness. CoRR abs/1505.03110 (2015) - [i4]Umang Bhaskar, Yu Cheng, Young Kun-Ko, Chaitanya Swamy:
Near-Optimal Hardness Results for Signaling in Bayesian Games. CoRR abs/1512.03543 (2015) - [i3]Mark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette:
Near-optimal bounds on bounded-round quantum communication complexity of disjointness. Electron. Colloquium Comput. Complex. TR15 (2015) - [i2]Mark Braverman, Young Kun-Ko, Aviad Rubinstein, Omri Weinstein:
ETH Hardness for Densest-k-Subgraph with Perfect Completeness. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [c1]Zachary Friggstad, Jochen Könemann, Young Kun-Ko, Anand Louis, Mohammad Shadravan, Madhur Tulsiani:
Linear Programming Hierarchies Suffice for Directed Steiner Tree. IPCO 2014: 285-296 - [i1]Mark Braverman, Young Kun-Ko, Omri Weinstein:
Approximating the best Nash Equilibrium in no(log n)-time breaks the Exponential Time Hypothesis. Electron. Colloquium Comput. Complex. TR14 (2014)
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-08-20 20:31 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:
