default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKung-Jui Pai
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j42]Wen-Han Zhu, Rong-Xia Hao
, Kung-Jui Pai, Eddie Cheng:
Reliability analysis of exchanged hypercubes based on the path connectivity. Discret. Appl. Math. 358: 404-416 (2024)- [j41]Hsin-Jung Lin, Shyue-Ming Tang, Kung-Jui Pai, Jou-Ming Chang:
A Recursive Algorithm for Constructing Dual-CISTs in Hierarchical Folded Cubic Networks. Int. J. Found. Comput. Sci. 35(5): 535-550 (2024) - [j40]Meirun Chen, Xiao-Yan Li, Cheng-Kuan Lin, Kung-Jui Pai:
A New Tree Structure for Local Diagnosis. J. Inf. Sci. Eng. 40(2): 231-244 (2024) - [j39]Meirun Chen, Cheng-Kuan Lin, Kung-Jui Pai:
A tree structure for local diagnosis in multiprocessor systems under the comparison model. Theor. Comput. Sci. 992: 114444 (2024) - 2023
- [j38]Mei-Mei Gu, Kung-Jui Pai, Jou-Ming Chang:
Subversion analyses of hierarchical networks based on (edge) neighbor connectivity. J. Parallel Distributed Comput. 171: 54-65 (2023) - [j37]Kung-Jui Pai, Ro-Yu Wu, Sheng-Lung Peng, Jou-Ming Chang:
Three edge-disjoint Hamiltonian cycles in crossed cubes with applications to fault-tolerant data broadcasting. J. Supercomput. 79(4): 4126-4145 (2023) - 2022
- [j36]Yu-Han Chen, Kung-Jui Pai, Hsin-Jung Lin, Jou-Ming Chang:
Constructing tri-CISTs in shuffle-cubes. J. Comb. Optim. 44(5): 3194-3211 (2022) - [j35]Kung-Jui Pai, Jinn-Shyong Yang, Guan-Yu Chen, Jou-Ming Chang:
Configuring Protection Routing via Completely Independent Spanning Trees in Dense Gaussian On-Chip Networks. IEEE Trans. Netw. Sci. Eng. 9(2): 932-946 (2022) - [j34]Xiao-Yan Li, Wanling Lin, Ximeng Liu, Cheng-Kuan Lin, Kung-Jui Pai, Jou-Ming Chang:
Completely Independent Spanning Trees on BCCC Data Center Networks With an Application to Fault-Tolerant Routing. IEEE Trans. Parallel Distributed Syst. 33(8): 1939-1952 (2022) - [c16]Meirun Chen, Cheng-Kuan Lin, Kung-Jui Pai:
A Tree Structure for Local Diagnosis in Multiprocessor Systems Under Comparison Model. ICS 2022: 49-60 - 2021
- [j33]Yu-Huei Chang, Kung-Jui Pai, Chiun-Chieh Hsu, Jinn-Shyong Yang, Jou-Ming Chang:
Constructing dual-CISTs of folded divide-and-swap cubes. Theor. Comput. Sci. 856: 75-87 (2021) - [j32]Yu-Han Chen, Shyue-Ming Tang, Kung-Jui Pai, Jou-Ming Chang:
Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes. Theor. Comput. Sci. 878-879: 102-112 (2021) - [j31]Kung-Jui Pai, Ruay-Shiung Chang, Jou-Ming Chang:
Constructing dual-CISTs of pancake graphs and performance assessment of protection routings on some Cayley networks. J. Supercomput. 77(1): 990-1014 (2021) - [c15]Yu-Han Chen, Kung-Jui Pai, Hsin-Jung Lin, Jou-Ming Chang:
Constructing Tri-CISTs in Shuffle-Cubes. COCOON 2021: 330-342 - [c14]Kung-Jui Pai:
Embedding Three Edge-Disjoint Hamiltonian Cycles into Locally Twisted Cubes. COCOON 2021: 367-374 - [c13]Kung-Jui Pai, Ro-Yu Wu, Sheng-Lung Peng, Jou-Ming Chang:
Three Edge-Disjoint Hamiltonian Cycles in Crossed Cubes with Applications to Fault-Tolerant Data Broadcasting. HPCC/DSS/SmartCity/DependSys 2021: 377-383 - 2020
- [j30]Xiao-Wen Qin, Rong-Xia Hao, Kung-Jui Pai, Jou-Ming Chang:
Comments on "A Hamilton sufficient condition for completely independent spanning tree". Discret. Appl. Math. 283: 730-733 (2020) - [j29]Kung-Jui Pai, Ruay-Shiung Chang, Jou-Ming Chang:
A well-equalized 3-CIST partition of alternating group graphs. Inf. Process. Lett. 155 (2020) - [j28]Kung-Jui Pai, Ruay-Shiung Chang, Ro-Yu Wu, Jou-Ming Chang:
Three completely independent spanning trees of crossed cubes with application to secure-protection routing. Inf. Sci. 541: 516-530 (2020) - [j27]Kung-Jui Pai, Ruay-Shiung Chang, Jou-Ming Chang:
A protection routing with secure mechanism in Möbius cubes. J. Parallel Distributed Comput. 140: 1-12 (2020) - [c12]Kung-Jui Pai:
A Parallel Algorithm for Constructing Two Edge-Disjoint Hamiltonian Cycles in Crossed Cubes. AAIM 2020: 448-455 - [c11]Shun-Yu Li, Jou-Ming Chang, Kung-Jui Pai:
A Parallel Algorithm for Constructing Two Edge-disjoint Hamiltonian Cycles in Locally Twisted Cubes. ICS 2020: 116-119
2010 – 2019
- 2019
- [j26]Kung-Jui Pai, Jou-Ming Chang, Ro-Yu Wu, Shun-Chieh Chang:
Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order. Discret. Appl. Math. 268: 223-236 (2019) - [j25]Yi-Xian Yang, Kung-Jui Pai, Ruay-Shiung Chang, Jou-Ming Chang:
Constructing Two Completely Independent Spanning Trees in Balanced Hypercubes. IEICE Trans. Inf. Syst. 102-D(12): 2409-2412 (2019) - [j24]Kung-Jui Pai, Jou-Ming Chang:
Improving the diameters of completely independent spanning trees in locally twisted cubes. Inf. Process. Lett. 141: 22-24 (2019) - [j23]Shih-Shun Kao, Kung-Jui Pai, Sun-Yuan Hsieh, Ro-Yu Wu, Jou-Ming Chang:
Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks. J. Comb. Optim. 38(3): 972-986 (2019) - [j22]Jou-Ming Chang, Kung-Jui Pai, Ro-Yu Wu, Jinn-Shyong Yang:
The 4-component connectivity of alternating group networks. Theor. Comput. Sci. 766: 38-45 (2019) - [j21]Kung-Jui Pai, Ruay-Shiung Chang, Ro-Yu Wu, Jou-Ming Chang:
A two-stages tree-searching algorithm for finding three completely independent spanning trees. Theor. Comput. Sci. 784: 65-74 (2019) - [j20]Kung-Jui Pai, Jou-Ming Chang:
Dual-CISTs: Configuring a Protection Routing on Some Cayley Networks. IEEE/ACM Trans. Netw. 27(3): 1112-1123 (2019) - [c10]Kung-Jui Pai, Ruay-Shiung Chang, Jou-Ming Chang, Ro-Yu Wu:
Constructing Three Completely Independent Spanning Trees in Locally Twisted Cubes. FAW 2019: 88-99 - [c9]Kung-Jui Pai, Ruay-Shiung Chang, Ro-Yu Wu, Jou-Ming Chang:
Three Completely Independent Spanning Trees of Crossed Cubes with Application to Secure-Protection Routing. HPCC/SmartCity/DSS 2019: 1358-1365 - 2018
- [j19]Jou-Ming Chang, Jinn-Shyong Yang, Shyue-Ming Tang, Kung-Jui Pai:
The Wide Diameters of Regular Hyper-Stars and Folded Hyper-Stars. Comput. J. 61(1): 121-128 (2018) - [c8]Shih-Shun Kao, Jou-Ming Chang, Kung-Jui Pai, Ro-Yu Wu:
Constructing Independent Spanning Trees on Bubble-Sort Networks. COCOON 2018: 1-13 - [c7]Jou-Ming Chang, Kung-Jui Pai, Jinn-Shyong Yang, Ro-Yu Wu:
Two Kinds of Generalized 3-Connectivities of Alternating Group Networks. FAW 2018: 3-14 - [c6]Kung-Jui Pai:
Designing an Algorithm to Improve the Diameters of Completely Independent Spanning Trees in Crossed Cubes. ICS 2018: 433-439 - [i2]Jou-Ming Chang, Kung-Jui Pai, Ro-Yu Wu, Jinn-Shyong Yang:
The 4-Component Connectivity of Alternating Group Networks. CoRR abs/1808.06160 (2018) - 2017
- [j18]Jou-Ming Chang, Hung-Yi Chang, Hung-Lung Wang, Kung-Jui Pai, Jinn-Shyong Yang:
Completely Independent Spanning Trees on 4-Regular Chordal Rings. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(9): 1932-1935 (2017) - [j17]Hon-Chan Chen, Yun-Hao Zou, Yue-Li Wang, Kung-Jui Pai:
A note on path embedding in crossed cubes with faulty vertices. Inf. Process. Lett. 121: 34-38 (2017) - [c5]Shih-Shun Kao, Jou-Ming Chang, Kung-Jui Pai, Jinn-Shyong Yang, Shyue-Ming Tang, Ro-Yu Wu:
A Parallel Construction of Vertex-Disjoint Spanning Trees with Optimal Heights in Star Networks. COCOA (1) 2017: 41-55 - [c4]Kung-Jui Pai, Jou-Ming Chang, Ro-Yu Wu:
A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order. FAW 2017: 221-232 - [i1]Tzong-Huei Shiau, Yue-Li Wang, Kung-Jui Pai:
On the Orbits of Crossed Cubes. CoRR abs/1707.06763 (2017) - 2016
- [j16]Kung-Jui Pai, Jou-Ming Chang, Jinn-Shyong Yang:
Vertex-transitivity on folded crossed cubes. Inf. Process. Lett. 116(11): 689-693 (2016) - [j15]Kung-Jui Pai, Jou-Ming Chang, Jinn-Shyong Yang, Ro-Yu Wu:
Corrigendum to "Incidence coloring on hypercubes" [Theoret. Comput. Sci. 557 (2014) 59-65]. Theor. Comput. Sci. 651: 87-88 (2016) - [j14]Kung-Jui Pai, Jou-Ming Chang:
Constructing two completely independent spanning trees in hypercube-variant networks. Theor. Comput. Sci. 652: 28-37 (2016) - [c3]Kung-Jui Pai, Ro-Yu Wu, Jou-Ming Chang, Shun-Chieh Chang:
Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order. COCOA 2016: 505-518 - 2015
- [j13]Jinn-Shyong Yang, Jou-Ming Chang, Kung-Jui Pai, Hung-Chang Chan:
Parallel Construction of Independent Spanning Trees on Enhanced Hypercubes. IEEE Trans. Parallel Distributed Syst. 26(11): 3090-3098 (2015) - 2014
- [j12]Kung-Jui Pai, Jou-Ming Chang, Yue-Li Wang, Ro-Yu Wu:
Queue Layouts of Toroidal Grids. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(6): 1180-1186 (2014) - [j11]Kung-Jui Pai, Jinn-Shyong Yang, Sing-Chen Yao, Shyue-Ming Tang, Jou-Ming Chang:
Completely Independent Spanning Trees on Some Interconnection Networks. IEICE Trans. Inf. Syst. 97-D(9): 2514-2517 (2014) - [j10]Jou-Ming Chang, Jhen-Ding Wang, Jinn-Shyong Yang, Kung-Jui Pai:
A comment on "Independent spanning trees in crossed cubes". Inf. Process. Lett. 114(12): 734-739 (2014) - [j9]Ro-Yu Wu, Jou-Ming Chang, Hung-Chang Chan, Kung-Jui Pai:
A loopless algorithm for generating multiple binary tree sequences simultaneously. Theor. Comput. Sci. 556: 25-33 (2014) - [j8]Kung-Jui Pai, Jou-Ming Chang, Jinn-Shyong Yang, Ro-Yu Wu:
Incidence coloring on hypercubes. Theor. Comput. Sci. 557: 59-65 (2014) - [c2]Kun-Fu Ding, Kung-Jui Pai, Jou-Ming Chang, Rueiher Tsaur:
Some Results of Incidence Coloring on Generalized Petersen Graphs. ICS 2014: 85-91 - 2013
- [c1]Ro-Yu Wu, Jou-Ming Chang, Hung-Chang Chan, Kung-Jui Pai:
A Loopless Algorithm for Generating Multiple Binary Tree Sequences Simultaneously. COCOA 2013: 340-350 - 2011
- [j7]Ro-Yu Wu, Jou-Ming Chang, Kung-Jui Pai, Yue-Li Wang:
Amortized efficiency of generating planar paths in convex position. Theor. Comput. Sci. 412(35): 4504-4512 (2011) - 2010
- [j6]Kung-Jui Pai, Jou-Ming Chang, Yue-Li Wang:
Restricted power domination and fault-tolerant power domination on grids. Discret. Appl. Math. 158(10): 1079-1089 (2010) - [j5]Kung-Jui Pai, Jou-Ming Chang, Yue-Li Wang:
A new upper bound on the queuenumber of hypercubes. Discret. Math. 310(4): 935-939 (2010) - [j4]Kung-Jui Pai, Jou-Ming Chang, Yue-Li Wang:
Erratum to "A new upper bound on the queuenumber of hypercubes" [Discrete Mathematics 310 (2010) 935-939]. Discret. Math. 310(13-14): 2059 (2010)
2000 – 2009
- 2009
- [j3]Kung-Jui Pai, Jou-Ming Chang, Yue-Li Wang:
Upper bounds on the queuenumber of k-ary n-cubes. Inf. Process. Lett. 110(2): 50-56 (2009) - 2008
- [j2]Kung-Jui Pai, Jou-Ming Chang, Yue-Li Wang:
A Note on "An improved upper bound on the queuenumber of the hypercube". Inf. Process. Lett. 108(3): 107-109 (2008) - 2000
- [j1]Ruay Shiung Chang, Kung-Joi Pai, Chin-Ling Chen:
Design of a multiple leaky buckets shaper. Comput. Commun. 23(13): 1307-1318 (2000)
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-21 00:13 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:
