default search action
C. Y. Lee
This is just a disambiguation page, and is not intended to be the bibliography of an actual person. Any publication listed on this page has not been assigned to an actual author yet. If you know the true author of one of the publications listed below, you are welcome to contact us.
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c8]S. Ko, J. H. Park, J. H. Bak, H. Jung, J. Shim, D. S. Kim, W. Lim, D.-E. Jeong, J. H. Lee, K. Lee, J.-H. Park, Y. Kim, C. Kim, J. H. Jeong, C. Y. Lee, S. H. Han, Y. Ji, S. H. Hwang, Hye Ji Shin, K. Lee, Y. J. Song, Yu-Gyun Shin, J. H. Song:
Highly Reliable and Manufacturable MRAM embedded in 14nm FinFET node. VLSI Technology and Circuits 2023: 1-2 - 2022
- [c7]Sung Joo Park, H. Kim, K.-S. Kim, J. So, J. Ahn, W.-J. Lee, D. Kim, Young-Ju Kim, J. Seok, J.-G. Lee, H.-Y. Ryu, C. Y. Lee, J. Prout, K.-C. Ryoo, S.-J. Han, M.-K. Kook, J. S. Choi, J. Gim, Y. S. Ki, S. Ryu, C. Park, D.-G. Lee, J. Cho, H. Song, Jin-Yup Lee:
Scaling of Memory Performance and Capacity with CXL Memory Expander. HCS 2022: 1-27
2010 – 2019
- 2011
- [j8]Chao-Lin Liu, Min-Hua Lai, Kan-Wen Tien, Yi-Hsuan Chuang, Shih-Hung Wu, C.-Y. Lee:
Visually and Phonologically Similar Characters in Incorrect Chinese Words: Analyses, Identification, and Applications. ACM Trans. Asian Lang. Inf. Process. 10(2): 10:1-10:39 (2011) - [c6]N. J. Shih, C. Y. Lee, T. Y. Chan:
3D scans of as-built street scenes for virtual environments. SpringSim (SimAUD) 2011: 46-51 - 2010
- [c5]C. Y. Lee, S. W. Lin, K. C. Ying, M. R. Yang:
An advanced approach for vehicle routing problem with time windows. NCM 2010: 408-411 - [c4]C. Y. Lee, M. R. Yang, L. Y. Chang, Z. J. Lee:
A hybrid algorithm applied to classify unbalanced data. NCM 2010: 618-621
2000 – 2009
- 2001
- [j7]C.-Y. Lee, V. J. Leon:
Machine scheduling with a rate-modifying activity. Eur. J. Oper. Res. 128(1): 119-128 (2001) - 2000
- [c3]C.-Y. Lee, E. K. Antonsson:
Variable Length Genomes for Evolutionary Algorithms. GECCO 2000: 806
1990 – 1999
- 1995
- [j6]C. Y. Lee:
Application of a Cross Decomposition Algorithm to a Location and Allocation Problem in Distributed Systems. Comput. Commun. 18(5): 367-377 (1995) - 1994
- [j5]C. Y. Lee, Jia-Shung Wang, Richard C. T. Lee:
Characteristics of the Hopfield associative memory utilizing isomorphism relations. IEEE Trans. Neural Networks 5(3): 523-526 (1994) - 1990
- [c2]C. Y. Lee, Jia-Shung Wang, Richard C. T. Lee:
On the state transition graph of Hopfield net model. IJCNN 1990: 821-826
1960 – 1969
- 1962
- [j4]C. Y. Lee:
A Note on the nth Shortest Path Problem. IRE Trans. Electron. Comput. 11(4): 572-573 (1962) - [c1]C. Y. Lee:
Intercommunicating cells, basis for a distributed logic computer. AFIPS Fall Joint Computing Conference 1962: 130-136 - 1961
- [j3]C. Y. Lee:
Categorizing Automata by W-Machine Programs. J. ACM 8(3): 384-399 (1961) - [j2]C. Y. Lee:
An Algorithm for Path Connections and Its Applications. IRE Trans. Electron. Comput. 10(3): 346-365 (1961)
1950 – 1959
- 1958
- [j1]C. Y. Lee:
Some properties of nonbinary error-correcting codes. IRE Trans. Inf. Theory 4(2): 77-82 (1958)
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-07-09 21:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint