default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSun-Mi Park
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j23]Sun-Mi Park
, Ku-Young Chang, Dowon Hong, Changho Seo:
Space Efficient $GF(2^m)$ Multiplier for Special Pentanomials Based on $n$ -Term Karatsuba Algorithm. IEEE Access 8: 27342-27360 (2020)- [j22]Sun-Mi Park, Ku-Young Chang, Dowon Hong, Changho Seo:
Efficient Bit-Parallel Multiplier for All Trinomials Based on n-Term Karatsuba Algorithm. IEEE Access 8: 173491-173507 (2020)
2010 – 2019
- 2019
- [j21]Sun-Mi Park, Ku-Young Chang, Dowon Hong, Changho Seo:
Low Space Complexity $GF(2^m)$ Multiplier for Trinomials Using $n$ -Term Karatsuba Algorithm. IEEE Access 7: 27047-27064 (2019) - 2018
- [j20]Sun-Mi Park, Ku-Young Chang, Dowon Hong, Changho Seo:
Efficient Three-Way Split Formulas for Binary Polynomial Multiplication and Toeplitz Matrix Vector Product. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(1): 239-248 (2018) - [j19]Ku-Young Chang, Sun-Mi Park, Dowon Hong, Changho Seo:
Efficient multiplier based on hybrid approach for Toeplitz matrix-vector product. Inf. Process. Lett. 131: 33-38 (2018) - [j18]Sun-Mi Park, Ku-Young Chang, Dowon Hong, Changho Seo:
Subquadratic Space Complexity Multiplier Using Even Type GNB Based on Efficient Toeplitz Matrix-Vector Product. IEEE Trans. Computers 67(12): 1794-1805 (2018) - 2017
- [j17]Sun-Mi Park, Ku-Young Chang, Dowon Hong, Changho Seo:
New Block Recombination for Subquadratic Space Complexity Polynomial Multiplication Based on Overlap-Free Approach. IEEE Trans. Computers 66(8): 1396-1406 (2017) - 2016
- [j16]Sun-Mi Park, Ku-Young Chang, Dowon Hong, Changho Seo:
Efficient Multiplication Based on Dickson Bases over Any Finite Fields. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(11): 2060-2074 (2016) - [j15]Sun-Mi Park, Ku-Young Chang, Dowon Hong, Changho Seo:
Explicit formulae for Mastrovito matrix and its corresponding Toeplitz matrix for all irreducible pentanomials using shifted polynomial basis. Integr. 53: 27-38 (2016) - [j14]Sun-Mi Park, Ku-Young Chang, Dowon Hong, Changho Seo:
Comments on "Multiway Splitting Method for Toeplitz Matrix Vector Product". IEEE Trans. Computers 65(1): 332-333 (2016) - 2015
- [j13]Sun-Mi Park, Ku-Young Chang, Dowon Hong, Changho Seo:
Generalization to Any Field of Toeplitz Matrix Vector Product Based on Multi-Way Splitting Method and Its Application. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(1): 378-383 (2015) - [j12]Sun-Mi Park, Ku-Young Chang, Dowon Hong, Changho Seo:
Low Complexity Multiplier Based on Dickson Basis Using Efficient Toeplitz Matrix-Vector Product. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(11): 2283-2290 (2015) - 2014
- [j11]Sun-Mi Park, Ku-Young Chang, Dowon Hong, Changho Seo:
Bit-Parallel Cubing Computation over GF(3m) for Irreducible Trinomials. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(1): 347-353 (2014) - [j10]Sun-Mi Park, Ku-Young Chang, Dowon Hong, Changho Seo:
New efficient bit-parallel polynomial basis multiplier for special pentanomials. Integr. 47(1): 130-139 (2014) - [j9]Sun-Mi Park, Ku-Young Chang, Dowon Hong, Changho Seo:
Comments on "On the Polynomial Multiplication in Chebyshev Form". IEEE Trans. Computers 63(12): 3162-3163 (2014) - 2013
- [j8]Sun-Mi Park, Ku-Young Chang, Dowon Hong, Changho Seo:
Fast Bit-Parallel Polynomial Basis Multiplier for GF(2m) Defined by Pentanomials Using Weakly Dual Basis. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 96-A(1): 322-331 (2013) - [j7]Sun-Mi Park, Ku-Young Chang, Dowon Hong:
Parallel GF(3m) multiplier for trinomials. Inf. Process. Lett. 113(4): 111-115 (2013) - 2012
- [j6]Sun-Mi Park, Ku-Jin Kim:
Color recognition with compact color features. Int. J. Commun. Syst. 25(6): 749-762 (2012) - [j5]Sun-Mi Park:
Explicit formulae of polynomial basis squarer for pentanomials using weakly dual basis. Integr. 45(2): 205-210 (2012) - 2011
- [j4]Sun-Mi Park, Ku-Young Chang:
Fast Bit-Parallel Shifted Polynomial Basis Multiplier Using Weakly Dual Basis Over GF(2m). IEEE Trans. Very Large Scale Integr. Syst. 19(12): 2317-2321 (2011) - [c7]Sun-Mi Park, Seong Oun Hwang:
Improved Security Proofs of Delerablée's Identity-Based Broadcast Encryption Scheme. ICHIT (1) 2011: 472-481 - 2010
- [j3]Sung-Jin Baek, Sun-Mi Park, Su-Hyun Yang, Eun-Ha Song, Young-Sik Jeong:
Efficient Server Virtualization using Grid Service Infrastructure. J. Inf. Process. Syst. 6(4): 553-562 (2010)
2000 – 2009
- 2008
- [c6]Ku-Jin Kim, Sun-Mi Park, Yoo-Joo Choi:
Deciding the Number of Color Histogram Bins for Vehicle Color Recognition. APSCC 2008: 134-138 - [c5]Ku-Jin Kim, Sun-Mi Park, Yoo-Joo Choi:
Clothing Identification Based on Edge Information. APSCC 2008: 876-880 - [c4]Won-Hee Han, Sung-Won Kim, Sun-Mi Park, Chang-Wu Lee, Jong Hyuk Park, Young-Sik Jeong:
Large-Scale USN Middleware Based on Context-Aware. EUC (2) 2008: 625-631 - 2007
- [c3]Nakhoon Baek, Sun-Mi Park, Ku-Jin Kim, Seong-Bae Park:
Vehicle Color Classification Based on the Support Vector Machine Method. ICIC (3) 2007: 1133-1139 - [c2]Ku-Jin Kim, Sun-Mi Park, Nakhoon Baek:
A Texture-Based Algorithm for Vehicle Area Segmentation Using the Support Vector Machine Method. RSFDGrC 2007: 542-549 - 2006
- [j2]Sun-Mi Park, Ku-Young Chang:
Low Complexity Bit-Parallel Squarer for GF(2n) Defined by Irreducible Trinomials. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(9): 2451-2452 (2006) - [j1]Sun-Mi Park, Ku-Young Chang, Dowon Hong:
Efficient Bit-Parallel Multiplier for Irreducible Pentanomials Using a Shifted Polynomial Basis. IEEE Trans. Computers 55(9): 1211-1215 (2006) - 2003
- [c1]Sun-Mi Park, Il-dong Jung, Dong-joo Song, Young-sung Sun, Kyongsok Kim:
Magic Square: Scalable Peer-to-Peer Lookup Protocol Considering Peer's Characteristics. Communications in Computing 2003: 153-156
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:47 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:
