The following pages link to Wai Hong Chan (Q268587):
Displaying 49 items.
- Blowup of regular solutions for the relativistic Euler-Poisson equations (Q268589) (← links)
- Complete forcing numbers of primitive coronoids (Q328729) (← links)
- Efficient arbitrated quantum signature and its proof of security (Q356871) (← links)
- (Q424241) (redirect page) (← links)
- On the impossibility of non-static quantum bit commitment between two parties (Q424242) (← links)
- On the adjacent vertex-distinguishing acyclic edge coloring of some graphs (Q453364) (← links)
- On the Laplacian spectral radii of bipartite graphs (Q551348) (← links)
- Sharing a quantum secret without a trusted party (Q632212) (← links)
- Graphs whose critical groups have larger rank (Q644604) (← links)
- The game chromatic index of some trees with maximum degree four and adjacent degree-four vertices (Q724727) (← links)
- Application of blind quantum computation to two-party quantum computation (Q726068) (← links)
- On the spectral radius of graphs with connectivity at most \(k\) (Q839379) (← links)
- Upper bounds on the paired-domination number (Q1003575) (← links)
- Some results on the Laplacian eigenvalues of unicyclic graphs (Q1014473) (← links)
- The Laplacian spectral radius of some graphs (Q1019636) (← links)
- A map of the \(P\)-positions in `NIM with a pass' played on heap sizes of at most four (Q1752585) (← links)
- Triangle-free graphs with large independent domination number (Q1952508) (← links)
- Limited resource semiquantum secret sharing (Q1994733) (← links)
- The edge coloring game on trees with the number of colors greater than the game chromatic index (Q2424821) (← links)
- On the existence of quantum signature for quantum messages (Q2436471) (← links)
- The game chromatic index of some trees of maximum degree 4 (Q2449078) (← links)
- (Q2716531) (← links)
- (Q2883286) (← links)
- (Q2936714) (← links)
- (Q2975370) (← links)
- (Q3094526) (← links)
- Computing the inverse sort transform in linear time (Q3189009) (← links)
- Higher-Order Rogue Wave Pairs in the Coupled Cubic-Quintic Nonlinear Schrödinger Equations (Q3387002) (← links)
- ENTANGLEMENT ENHANCES THE SECURITY OF ARBITRATED QUANTUM SIGNATURE (Q3401876) (← links)
- Computing Inverse ST in Linear Complexity (Q3506952) (← links)
- (Q3581896) (← links)
- (Q3615949) (← links)
- Linear Time Suffix Array Construction Using D-Critical Substrings (Q3637104) (← links)
- Checking Big Suffix and LCP Arrays by Probabilistic Methods (Q4567209) (← links)
- Measurement-device-independent semiquantum key distribution (Q4584400) (← links)
- Fast In-Place Suffix Sorting on a Multicore Computer (Q4626965) (← links)
- On the security of arbitrated quantum signature schemes (Q4900395) (← links)
- (Q4903439) (← links)
- Some results on matching and total domination in graphs (Q4907273) (← links)
- (Q4991638) (← links)
- Notes on the combinatorial game: graph Nim (Q5006589) (← links)
- Building and Checking Suffix Array Simultaneously by Induced Sorting Method (Q5094978) (← links)
- (Q5206399) (← links)
- (Q5262051) (← links)
- (Q5279140) (← links)
- Two Efficient Algorithms for Linear Time Suffix Array Construction (Q5280510) (← links)
- (Q5393534) (← links)
- (Q5405478) (← links)
- (Q5443193) (← links)
