default search action
Sung Min Cho
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
- [j11]Sunghyun Jin, Sung Min Cho, HeeSeok Kim, Seokhie Hong:
Enhanced Side-Channel Analysis on ECDSA Employing Fixed-Base Comb Method. IEEE Trans. Computers 71(9): 2341-2350 (2022) - 2021
- [j10]Sunghyun Jin, Sangyub Lee, Sung Min Cho, HeeSeok Kim, Seokhie Hong:
Novel Key Recovery Attack on Secure ECDSA Implementation by Exploiting Collisions between Unknown Entries. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2021(4): 1-26 (2021) - [j9]Dong-won Park, Seokhie Hong, Nam Su Chang, Sung Min Cho:
Efficient implementation of modular multiplication over 192-bit NIST prime for 8-bit AVR-based sensor node. J. Supercomput. 77(5): 4852-4870 (2021) - 2020
- [j8]Sangyub Lee, Sung Min Cho, Heeseok Kim, Seokhie Hong:
A Combined Single Trace Attack on Global Shuffling Long Integer Multiplication and its Novel Countermeasure. IEEE Access 8: 5244-5255 (2020) - 2019
- [j7]Sangyub Lee, Sung Min Cho, Heeseok Kim, Seokhie Hong:
A Practical Collision-Based Power Analysis on RSA Prime Generation and Its Countermeasure. IEEE Access 7: 47582-47592 (2019) - 2018
- [j6]Sung Jin Kim, Jong Hoon Choi, Hyung Tae Kim, Hee Nam Chae, Sung Min Cho:
Advanced Top-Down Fabrication Process of A-IGZO TFT for Roll-to-Roll Backplane. IEICE Trans. Electron. 101-C(11): 874-879 (2018) - 2017
- [j5]Kae Won Choi, Young Su Cho, Aneta, Ji Wun Lee, Sung Min Cho, Jaehyuk Choi:
Optimal load balancing scheduler for MPTCP-based bandwidth aggregation in heterogeneous wireless environments. Comput. Commun. 112: 116-130 (2017) - 2016
- [j4]Sung Min Cho, Seung Gyu Gwak, Chang Han Kim, Seokhie Hong:
Faster elliptic curve arithmetic for triple-base chain by reordering sequences of field operations. Multim. Tools Appl. 75(22): 14819-14831 (2016) - 2014
- [j3]Eun Joung Cho, Kwan Min Lee, Sung Min Cho, Yang Hyun Choi:
Effects of stereoscopic movies: The positions of stereoscopic objects and the viewing conditions. Displays 35(2): 59-65 (2014) - 2013
- [j2]Sung Min Cho, Seog Chung Seo, Tae Hyun Kim, Young-Ho Park, Seokhie Hong:
Extended elliptic curve Montgomery ladder algorithm over binary fields with resistance to simple power analysis. Inf. Sci. 245: 304-312 (2013) - 2008
- [j1]Dong-Hyun Lee, J. S. Choi, H. Chae, Chan-Hwa Chung, Sung Min Cho:
Highly efficient phosphorescent polymer OLEDs fabricated by screen printing. Displays 29(5): 436-439 (2008)
Conference and Workshop Papers
- 2022
- [c2]Wondo Rhee, Sung Min Cho, Bongwon Suh:
Countering Popularity Bias by Regularizing Score Differences. RecSys 2022: 145-155 - 2020
- [c1]Sung Min Cho, Eunhyeok Park, Sungjoo Yoo:
MEANTIME: Mixture of Attention Mechanisms with Multi-temporal Embeddings for Sequential Recommendation. RecSys 2020: 515-520
Informal and Other Publications
- 2021
- [i2]Sung Min Cho, Hongjun Lim, Keunchan Park, Sungjoo Yoo, Eunhyeok Park:
On the Overlooked Significance of Underutilized Contextual Features in Recent News Recommendation Models. CoRR abs/2112.14370 (2021) - 2020
- [i1]Sung Min Cho, Eunhyeok Park, Sungjoo Yoo:
MEANTIME: Mixture of Attention Mechanisms with Multi-temporal Embeddings for Sequential Recommendation. CoRR abs/2008.08273 (2020)
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 23:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint