Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSunghyun Kim 0001
Person information
- affiliation: Massachusetts Institute of Technology, Cambridge, MA, USA
- affiliation: Electronics and Telecommunications Research Institute, ETRI, Daejeon, South Korea
- affiliation: Korea Advanced Institute of Science and Technology, Department of Electrical Engineering, Korea
Other persons with the same name
- Sunghyun Kim — disambiguation page
- Sunghyun Kim 0002
![[0000-0001-5072-6801]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0001-5072-6801")
— Imperial College London, Department of Materials, UK (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j3]Sunghyun Kim, Soheil Mohajer, Changho Suh:
On the Sum Capacity of Dual-Class Parallel Packet-Erasure Broadcast Channels. IEEE Trans. Commun. 69(4): 2271-2289 (2021)- [c7]Sunghyun Kim, Minje Jang, Changho Suh:
Group Match Prediction via Neural Networks (Long paper). KaRS/ComplexRec@RecSys 2021
2010 – 2019
- 2018
- [j2]Minje Jang, Sunghyun Kim, Changho Suh:
Top-K Rank Aggregation From M-Wise Comparisons. IEEE J. Sel. Top. Signal Process. 12(5): 989-1004 (2018) - [j1]Sunghyun Kim, I-Hsiang Wang, Changho Suh:
A Relay Can Increase Degrees of Freedom in Bursty Interference Networks. IEEE Trans. Inf. Theory 64(6): 4581-4593 (2018) - [c6]Jong Gyu Jang, Hyun Jong Yang, Sunghyun Kim:
Learning-Based Distributed Resource Allocation in Asynchronous Multicell Networks. ICTC 2018: 910-913 - 2017
- [c5]Sunghyun Kim, Soheil Mohajer, Changho Suh:
Coding across heterogeneous parallel erasure broadcast channels is useful. ISIT 2017: 1883-1887 - [c4]Minje Jang, Sunghyun Kim, Changho Suh, Sewoong Oh:
Optimal Sample Complexity of M-wise Data for Top-K Ranking. NIPS 2017: 1686-1696 - 2016
- [c3]Sunghyun Kim, Soheil Mohajer, Changho Suh:
Role of a relay in bursty networks with correlated transmissions. ISIT 2016: 2639-2643 - [i3]Minje Jang, Sunghyun Kim, Changho Suh, Sewoong Oh:
Top-K Ranking from Pairwise Comparisons: When Spectral Ranking is Optimal. CoRR abs/1603.04153 (2016) - [i2]Sunghyun Kim, Soheil Mohajer, Changho Suh:
Role of a Relay in Bursty Multiple Access Channels. CoRR abs/1604.04961 (2016) - 2015
- [c2]Sunghyun Kim, Changho Suh:
Degrees of freedom of bursty multiple access channels with a relay. Allerton 2015: 322-328 - [c1]Sunghyun Kim, I-Hsiang Wang, Changho Suh:
A relay can increase degrees of freedom in bursty mimo interference networks. ISIT 2015: 1059-1063 - [i1]Sunghyun Kim, I-Hsiang Wang, Changho Suh:
A Relay Can Increase Degrees of Freedom in Bursty Interference Networks. CoRR abs/1505.04679 (2015)
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-06-27 23:23 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:
