default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDS. M. Kang
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
2000 – 2009
- 2009
[j8]S. M. Kang, T. I. Shin, Duc V. Dinh
, J. H. Yang, Sang-Woo Kim, D. H. Yoon:
Synthesis of GaN nanowires and nanorods via self-growth mode control. Microelectron. J. 40(2): 373-376 (2009)- 2000
- [j7]Y. J. Cho, N. J. Huang, S. M. Kang:
Nonlinear equations for fuzzy mappings in probabilistic normed spaces. Fuzzy Sets Syst. 110(1): 115-122 (2000) - [j6]J. S. Jung, Y. J. Cho, S. M. Kang, B. S. Lee, Y. K. Choi:
Coincidence point theorems in generating spaces of quasi-metric family. Fuzzy Sets Syst. 116(3): 471-479 (2000)
1990 – 1999
- 1999
- [j5]J. S. Jung, S. S. Chang, Y. J. Cho, B. S. Lee, S. M. Kang:
Common fixed point theorems and variational principle in generating spaces of quasi-metric family. Fuzzy Sets Syst. 102(2): 315-325 (1999) - [c10]U. Ekambaram, S. M. Kang, R. A. Saleh:
Behavioral-level envelope-following using Broyden's method. ICECS 1999: 1437-1440 - 1998
- [j4]Y. J. Cho, H. K. Pathak, S. M. Kang, J. S. Jung:
Common fixed points of compatible maps of type (β) on fuzzy metric spaces. Fuzzy Sets Syst. 93(1): 99-111 (1998) - 1997
- [j3]S. S. Chang, Y. J. Cho, B. S. Lee, J. S. Jung, S. M. Kang:
Coincidence point theorems and minimization theorems in fuzzy metric spaces. Fuzzy Sets Syst. 88(1): 119-127 (1997) - [c9]A. Dharchoudhuri, S. M. Kang:
Analytical Fast Timing Simulation of MOS Circuits Driving RC Interconnects. VLSI Design 1997: 111-117 - 1993
- [c8]Dae-Hyung Cho, S. M. Kang:
An Accurate AC Characteristic Table Look-up Model for VLSI Analog Circuits Simulation Applications. ISCAS 1993: 1531-1534 - [p1]S. M. Kang, M. Sriram:
Binary formulations for Placement and Routing Problems. Algorithmic Aspects of VLSI Layout 1993: 25-68 - 1992
- [c7]Abhijit Dharchoudhury, S. M. Kang:
Identification of Correlated Device Model Parameter Values for Worst-Case Circuit Performance Analysis. VLSI Design 1992: 339-340 - 1991
- [c6]Philippe Duchene, Michel J. Declercq, S. M. Kang:
An integrated layout system for sea-of-gates module generation. EURO-DAC 1991: 237-241 - 1990
- [j2]P. Gee, Min-You Wu, S. M. Kang, Ibrahim N. Hajj:
A metal - metal matrix cell generator for multi-level metal MOS technology. Integr. 9(1): 25-47 (1990)
1980 – 1989
- 1989
- [c5]Andrew T. Yang, S. M. Kang:
iSMILE: A Novel Circuit Simulation Program with Emphasis on New Device Model Development. DAC 1989: 630-633 - [c4]Y.-H. Shih, S. M. Kang:
Fast MOS circuit simulation with a direct equation solver. ICCD 1989: 276-279 - 1988
- [j1]Wei Shu, Min-You Wu, S. M. Kang:
Improved net merging method for gate matrix layout. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 7(9): 947-951 (1988) - [c3]D. Zhou, Franco P. Preparata, S. M. Kang:
Interconnection delay in very high-speed VLSI. ICCD 1988: 52-55 - [c2]Andrew T. Yang, D. S. Gao, S. M. Kang:
Computer-aided simulation of optical interconnects for high-speed digital systems. ICCD 1988: 87-90 - 1986
- [c1]R. D. Freeman, S. M. Kang, C. G. Lin-Hendel, M. L. Newby:
Automated extraction of SPICE circuit models from symbolic gate matrix layout with pruning. DAC 1986: 418-424
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-11-14 00:55 CET 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:
