default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKwan Woo Ryu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
[j9]Dae-Hyun Jeong, Kwan Woo Ryu:
A Linear Time Algorithm for Collision Response of Articulated Rigid Bodies. IEICE Trans. Inf. Syst. 90-D(9): 1478-1481 (2007)- [c8]Nam-Kyung Lee, Nakhoon Baek, Kwan Woo Ryu:
Real-Time Simulation of Surface Gravity Ocean Waves Based on the TMA Spectrum. International Conference on Computational Science (2) 2007: 122-129 - 2006
- [c7]Nam-Kyung Lee, Nakhoon Baek, Kwan Woo Ryu:
Simulation of Artificial Winds Using a Hardware Illumination Technique. ISVC (2) 2006: 49-58 - 2002
- [c6]Hee-Jung Bae, Kwan Woo Ryu, Byung-Tae Jang:
Procedural Approach to Generate Real Time Motions of Cloth. Shape Modeling International 2002: 213-218 - 2001
- [j8]Dongkyoo Lee, Hee-Jung Bae, Chang Tae Kim, Dong-Chun Lee, Dae-Hyun Jung, Nam-Kyung Lee, Kyoo-Ho Lee, Nakhoon Baek
, Jong Won Lee, Kwan Woo Ryu, James K. Hahn:
Reproducing works of Calder. Comput. Animat. Virtual Worlds 12(2): 81-91 (2001)
1990 – 1999
- 1996
- [j7]Joseph F. JáJá, Kwan Woo Ryu:
An Optimal Randomized Parallel Algorithm for the Single Function Coarsest Partition Problem. Parallel Process. Lett. 6(2): 187-193 (1996) - [j6]Joseph F. JáJá, Kwan Woo Ryu, Uzi Vishkin:
Sorting Strings and Constructing Digital Search Trees in Parallel. Theor. Comput. Sci. 154(2): 225-245 (1996) - [j5]Joseph F. JáJá, Kwan Woo Ryu:
The Block Distributed Memory Model. IEEE Trans. Parallel Distributed Syst. 7(8): 830-840 (1996) - 1994
- [j4]Joseph F. JáJá, Kwan Woo Ryu:
An Efficient Parallel Algorithm for the Single Function Coarsest Partition Problem. Theor. Comput. Sci. 129(2): 293-307 (1994) - [c5]Joseph F. JáJá, Kwan Woo Ryu, Uzi Vishkin:
Sorting Strings and Constructing Digital Search Trees in Parallel. IPPS 1994: 349-356 - [c4]Joseph F. JáJá, Kwan Woo Ryu:
The Block Distributed Memory Model for Shared Memory Multiprocessors. IPPS 1994: 752-756 - 1993
- [j3]Joseph F. JáJá, Kwan Woo Ryu:
Optimal Algorithms on the Pipelined Hypercube and Related Networks. IEEE Trans. Parallel Distributed Syst. 4(5): 582-591 (1993) - [c3]Joseph F. JáJá, Kwan Woo Ryu:
An Efficient Parallel Algorithm for the Single Function Coarsest Partition Problem. SPAA 1993: 230-239 - 1992
- [j2]Joseph F. JáJá, Kwan Woo Ryu:
Load Balancing and Routing on the Hypercube and Related Networks. J. Parallel Distributed Comput. 14(4): 431-435 (1992) - 1990
- [j1]Kwan Woo Ryu, Joseph F. JáJá:
Efficient Algorithms for List Ranking and for Solving Graph Problems on the Hypercube. IEEE Trans. Parallel Distributed Syst. 1(1): 83-90 (1990) - [c2]Joseph F. JáJá, Kwan Woo Ryu:
Load Balancing on the Hypercube and Related Networks. ICPP (1) 1990: 203-210
1980 – 1989
- 1989
- [c1]Kwan Woo Ryu, Joseph F. JáJá:
List Ranking on the Hypercube. ICPP (3) 1989: 20-23
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-25 05:42 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:
