default search action
Hung-Chi Su
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
- [j1]Edward T. Hammerand, Hung-Chi Su:
Reduced split/merge propagation in a modified B-link tree design. J. Comput. Methods Sci. Eng. 11(Supplement-1): 29-40 (2011) - 2010
- [c19]Edward T. Hammerand, Hung-Chi Su:
Modifieed Concurrent Access to the B-Link Tree. CATA 2010: 49-54 - [c18]Edward T. Hammerand, Hung-Chi Su:
Top-Down Approach on Concurrent Access to the B-Link Tree. SEDE 2010: 243-248
2000 – 2009
- 2008
- [c17]Ruipeng Li, Hai Jiang, Hung-Chi Su, Bin Zhang, Jeff Jenness:
Adaptive and Fault Tolerant Simulation of Relativistic Particle Transport with Data-Level Checkpointing. CSE 2008: 345-352 - [c16]Chin-Chih Chang, Hung-Chi Su:
A Context-Aware English Learning System based on Web Services. CSREA EEE 2008: 533-539 - [c15]Ruipeng Li, Hai Jiang, Hung-Chi Su, Bin Zhang, Jeff Jenness:
Parallel and Distributed Particle Collision Simulation with Decentralized Control. GPC 2008: 244-255 - [c14]Ruipeng Li, Hai Jiang, Hung-Chi Su, Jeff Jenness, Bin Zhang:
On Load Balancing Distributed Simulation of Relativistic Particle Transport. PDPTA 2008: 261-269 - [c13]Ruipeng Li, Hai Jiang, Hung-Chi Su:
Coordination schemes in distributed simulation of relativistic particle transport. SAC 2008: 44-45 - [c12]H. K. Dai, Kyu-Young Whang, Hung-Chi Su:
Locality of Corner Transformation for Multidimensional Spatial Access Methods. FICS 2008: 133-148 - 2007
- [c11]Hung-Chi Su, Hai Jiang, Bin Zhang:
Flexible Speculative Parallelization of Many-Particle Collision Simulation. CAINE 2007: 145-150 - [c10]Hung-Chi Su, Hai Jiang, Bin Zhang:
An Empirical Study on Many-Particle Collision Algorithms. CATA 2007: 12-17 - [c9]Hai Jiang, Hung-Chi Su, Bin Zhang:
Toward Optimizing Particle-Simulation Systems. International Conference on Computational Science (1) 2007: 286-293 - [c8]Ruipeng Li, Hai Jiang, Hung-Chi Su, Bin Zhang, Jeff Jenness:
Speculative and distributed simulation of many-particle collision systems. ICPADS 2007: 1-8 - [c7]Ruipeng Li, Hai Jiang, Hung-Chi Su, Jeff Jenness, Bin Zhang:
Speculative Parallelization of Many-Particle Collision Simulations. PDPTA 2007: 128-136 - 2006
- [c6]Ho-Kwok Dai, Hung-Chi Su:
A Parallel Algorithm for Finding All Successive Minimal Maximum Subsequences. LATIN 2006: 337-348 - 2004
- [c5]H. K. Dai, Hung-Chi Su:
On p-Norm Based Locality Measures of Space-Filling Curves. ISAAC 2004: 364-376 - [c4]H. K. Dai, Z. Li, Hung-Chi Su:
An Empirical Study of Bounded Delay Constrained Bandwidth Routing. PDPTA 2004: 973-979 - 2003
- [c3]Ho-Kwok Dai, Hung-Chi Su:
Approximation and Analytical Studies of Inter-clustering Performances of Space-Filling Curves. DRW 2003: 53-68 - [c2]H. K. Dai, Hung-Chi Su:
On the Locality Properties of Space-Filling Curves. ISAAC 2003: 385-394 - [c1]H. K. Dai, Hung-Chi Su:
An Empirical Study of p-Norm Based Locality Measures of Space-Filling Curves. PDPTA 2003: 1434-1440
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 12:54 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint