Personal information

No personal information available

Activities

Works (8)

Mastermind with a linear number of queries

Combinatorics, Probability and Computing
2024-03 | Journal article
Contributors: Anders Martinsson; Pascal Su
Source: check_circle
Crossref

An O(n) time algorithm for finding Hamilton cycles with high probability

2020-12-04 | Preprint
Source: Self-asserted source
Pascal Su

Mastermind with a Linear Number of Queries

2020-11-11 | Preprint
Source: Self-asserted source
Pascal Su

The Chromatic Number of Dense Random Block Graphs

2020-07-15 | Preprint
Source: Self-asserted source
Pascal Su

$K_r$-Factors in Graphs with Low Independence Number

2019-11-30 | Preprint
Source: Self-asserted source
Pascal Su

Improved bounds on the multicolor Ramsey numbers of paths and even cycles

2018-01-12 | Preprint
Source: Self-asserted source
Pascal Su

Nearest Common Ancestors: Universal Trees and Improved Labeling Schemes

2017-07-27 | Preprint
Source: Self-asserted source
Pascal Su

Bipartite Kneser graphs are Hamiltonian

Combinatorica 37(6):1207-1219, 2017
2015-03-31 | Preprint
Source: Self-asserted source
Pascal Su