default search action
Younseok Choo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j17]Younseok Choo:
On the Reciprocal Sums of Products of Fibonacci Numbers. J. Integer Seq. 21(3): 18.3.2 (2018) - 2016
- [j16]Younseok Choo:
Necessary Conditions for θ-Stability of Real Polynomials. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(8): 1628-1631 (2016) - 2014
- [j15]Younseok Choo:
On the Robustness of Hurwitz Polynomials under Coefficient Perturbation. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(10): 2079-2082 (2014) - [j14]Younseok Choo:
Improved Optimum Radius for Robust Stability of Schur Polynomials. J. Optim. Theory Appl. 161(2): 553-556 (2014) - 2012
- [j13]Younseok Choo, Young-Ju Kim:
Computing Transformation Matrix for 1-D to 2-D Polynomial Transformation. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 95-A(10): 1780-1783 (2012) - 2011
- [j12]Younseok Choo:
An elementary proof of the Jury test for real polynomials. Autom. 47(1): 249-252 (2011) - [j11]Younseok Choo, Young-Ju Kim:
A Simplified Jury's Table for Complex Polynomials. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(4): 1148-1150 (2011) - [j10]Younseok Choo, GinKyu Choi:
On the Monotonic Condition for Schur Stability of Real Polynomials. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(12): 2886-2888 (2011) - 2010
- [j9]Younseok Choo, Dongmin Kim:
Simple Proof of Jury Test for Complex Polynomials. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(2): 550-552 (2010) - [j8]Younseok Choo:
Further Results on Jury Test for Complex Polynomials. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(10): 1824-1826 (2010)
2000 – 2009
- 2009
- [j7]Younseok Choo, GinKyu Choi:
Successive Computation of Transformation Matrices for Arbitrary Polynomial Transformation. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(4): 1230-1232 (2009) - [j6]Younseok Choo, GinKyu Choi:
On Pascal Matrix for Transforming Lowpass Analog Filter to Bandpass Digital Filter. IEEE Signal Process. Lett. 16(2): 77-80 (2009) - [j5]Younseok Choo, Dongmin Kim:
Computing Transformation Matrices for Arbitrary Polynomial Transformation. IEEE Signal Process. Lett. 16(4): 272-274 (2009) - 2007
- [j4]Younseok Choo:
Computing Transformation Matrix for Bilinear S-Z Transformation. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(4): 872-874 (2007) - [j3]Younseok Choo, GinKyu Choi:
Schur Stability of Convex Combinations of Complex Polynomials. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(11): 2612-2615 (2007) - 2005
- [j2]Younseok Choo:
A Note on Discrete-System Reduction via Impulse Response Gramian. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(2): 599-601 (2005) - [j1]Younseok Choo:
On the Property of a Discrete Impulse Response Gramian with Application to Model Reduction. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(12): 3658-3660 (2005)
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:48 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: