default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEunseuk Oh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2005
[c11]Hyeong-Ok Lee, Jong-Seok Kim, Kyoung-Wook Park, Jeonghyun Seo, Eunseuk Oh:
Matrix-Star Graphs: A New Interconnection Network Based on Matrix Operations. Asia-Pacific Computer Systems Architecture Conference 2005: 478-487- [c10]Eunseuk Oh, Hongsik Choi, David Primeaux:
An All-Reduce Operation in Star Networks Using All-to-All Broadcast Communication Pattern. International Conference on Computational Science (1) 2005: 419-426 - [c9]Ju Yong Lee, Eunseuk Oh, Hongsik Choi:
Hardness on IP-subnet Aware Routing in WDM Network. ICOIN 2005: 541-550 - 2004
- [b1]Eunseuk Oh:
On strong fault tolerance (or strong Menger-connectivity) of multicomputer networks. Texas A&M University, College Station, USA, 2004 - [c8]Eunseuk Oh, Hongsik Choi, Jong-Seok Kim:
Double-Link Failure Recovery in WDM Optical Torus Networks. ICOIN 2004: 708-717 - 2003
- [j2]Eunseuk Oh, Jianer Chen:
On strong Menger-connectivity of star graphs. Discret. Appl. Math. 129(2-3): 499-511 (2003) - [j1]Eunseuk Oh, Jianer Chen:
Strong Fault-Tolerance: Parallel Routing in Star Networks with Faults. J. Interconnect. Networks 4(1): 113-126 (2003) - [c7]Eunseuk Oh, Jong-Seok Kim, Hyeong-Ok Lee:
Fault-Tolerant Routing in Mesh-Connected 2D Tori. International Conference on Computational Science 2003: 527-536 - [c6]Jong-Seok Kim, Eunseuk Oh, Hyeong-Ok Lee, Yeong-Nam Heo:
Topological and Communication Aspects of Hyper-Star Graphs. ISCIS 2003: 51-58 - 2002
- [c5]Hyeong-Ok Lee, Jong-Seok Kim, Eunseuk Oh, Hyeong-Seok Lim:
Hyper-Star Graph: A New Interconnection Network Improving the Network Cost of the Hypercube. EurAsia-ICT 2002: 858-865 - [c4]Eunseuk Oh, Iyad A. Kanj:
Efficient All-to-All Broadcast Schemes in Distributed-Memory Parallel Computers. HPCS 2002: 71-76 - 2001
- [c3]Jianer Chen, Eunseuk Oh:
Strong Fault-Tolerance: Parallel Routing in Networks with Faults. International Conference on Computational Science (2) 2001: 609-618 - [c2]Eunseuk Oh, Jianer Chen:
Parallel Routing in Hypercube Networks with Faulty Nodes. ICPADS 2001: 338-345 - [c1]Eunseuk Oh, Jianer Chen:
On Strong Menger-Connectivity of Star Graphs. WG 2001: 272-283
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 2025-01-09 13:05 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:
