Pascal Su

Orcid: 0000-0001-5614-962X

According to our database1, Pascal Su authored at least 8 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Mastermind with a linear number of queries.
Comb. Probab. Comput., March, 2024

2021
Properties of Randomness in Graph Theory and Algorithms.
PhD thesis, 2021

<i>K</i><sub><i>r</i></sub>-factors in graphs with low independence number.
J. Comb. Theory, Ser. B, 2021

An O(N) Time Algorithm for Finding Hamilton Cycles with High Probability.
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

2019
Improved Bounds on the Multicolor Ramsey Numbers of Paths and Even Cycles.
Electron. J. Comb., 2019

2018
Labeling Schemes for Nearest Common Ancestors through Minor-Universal Trees.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017
Nearest Common Ancestors: Universal Trees and Improved Labeling Schemes.
CoRR, 2017

2015
Bipartite Kneser graphs are Hamiltonian.
Electron. Notes Discret. Math., 2015


  Loading...