default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTai-Ching Tuan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i1]Mucong Ding, Yuancheng Xu, Tahseen Rabbani, Xiaoyu Liu, Brian J. Gravelle, Teresa M. Ranadive, Tai-Ching Tuan, Furong Huang:
Calibrated Dataset Condensation for Faster Hyperparameter Search. CoRR abs/2405.17535 (2024)- 2022
- [j12]Jiahao Su, Jingling Li, Xiaoyu Liu, Teresa M. Ranadive, Christopher J. Coley, Tai-Ching Tuan, Furong Huang:
Compact Neural Architecture Designs by Tensor Representations. Frontiers Artif. Intell. 5: 728761 (2022)
2010 – 2019
- 2019
- [c3]James R. Ezick, Ben Parsons, William Glodek, Tom Henretty, Muthu Manikandan Baskaran, Richard Lethin, John Feo, Tai-Ching Tuan, Christopher J. Coley, Leslie Leonard, Rajeev Agrawal:
Combining Tensor Decompositions and Graph Analytics to Provide Cyber Situational Awareness at HPC Scale. HPEC 2019: 1-7 - 2016
- [c2]Daniele Buono, Fabrizio Petrini, Fabio Checconi, Xing Liu, Xinyu Que, Chris Long, Tai-Ching Tuan:
Optimizing Sparse Matrix-Vector Multiplication for Large-Scale Data Analytics. ICS 2016: 37:1-37:12 - 2015
- [j11]Daniele Buono, John A. Gunnels, Xinyu Que, Fabio Checconi, Fabrizio Petrini, Tai-Ching Tuan, Chris Long:
Optimizing Sparse Linear Algebra for Large-Scale Graph Analytics. Computer 48(8): 26-34 (2015)
1990 – 1999
- 1999
- [j10]Jung-Sing Jwo, Tai-Ching Tuan:
Uni-directional Alternating Group Graphs. J. Inf. Sci. Eng. 15(3): 419-427 (1999) - 1998
- [j9]Jung-Sing Jwo, Tai-Ching Tuan:
On container length and connectivity in unidirectional hypercubes. Networks 32(4): 307-317 (1998) - 1995
- [c1]Shyh-Chain Chern, Tai-Ching Tuan, Jung-Sing Jwo
:
Uni-directional Alternating Group Graphs. COCOON 1995: 490-495 - 1994
- [j8]Jung-Sing Jwo, Tai-Ching Tuan:
On Transmitting Delay in a Distance-Transitive Strongly Antipodal Graph. Inf. Process. Lett. 51(5): 233-235 (1994) - 1992
- [j7]Kim-Heng Teo, Tai-Ching Tuan:
An Efficient One-Side Height Minimization Algorithm for Routing Around a Rectangle. Inf. Process. Lett. 44(2): 101-105 (1992) - [j6]Tai-Ching Tuan:
On Optimal Single Jog River Routing. IEEE Trans. Computers 41(3): 366-369 (1992) - 1991
- [j5]Kim-Heng Teo, Tai-Ching Tuan:
A Tight Upper Bound for the Number of Intersections Between two Rectangular Paths. BIT 31(4): 598-606 (1991) - [j4]Kim-Heng Teo, Tai-Ching Tuan:
An Improved Upper Bound on the Number of Intersections Between Two Rectangular Paths. Inf. Process. Lett. 37(6): 305-309 (1991) - [j3]Tai-Ching Tuan, Kim-Heng Teo:
On river routing with minimum number of jogs. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 10(2): 271-273 (1991) - 1990
- [j2]Kim-Heng Teo, Tai-Ching Tuan:
Performance Analysis of Greedy Heuristic to Find a Minimum Total-Jogs Layout for River Routing. Inf. Process. Lett. 36(3): 167-170 (1990) - [j1]Tai-Ching Tuan, S. Louis Hakimi:
River Routing with a Small Number of Jogs. SIAM J. Discret. Math. 3(4): 585-597 (1990)
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-30 21:41 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:
