The following pages link to Shi-Chun Tsai (Q294798):
Displaying 38 items.
- Exact solution of a minimal recurrence (Q294799) (← links)
- Computing the ball size of frequency permutations under Chebyshev distance (Q417597) (← links)
- Complexity of hard-core set proofs (Q451110) (← links)
- On the inapproximability of maximum intersection problems (Q456103) (← links)
- More on the Magnus-Derek game (Q620945) (← links)
- Decoding permutation arrays with ternary vectors (Q634128) (← links)
- More on the one-dimensional sliding-coin puzzle (Q741715) (← links)
- On the construction of permutation arrays via mappings from binary vectors to permutations (Q851743) (← links)
- Improved hardness amplification in NP (Q868960) (← links)
- Jug measuring: algorithms and complexity (Q924133) (← links)
- A note on unscrambling address lines (Q1007522) (← links)
- On the bottleneck counting argument (Q1566741) (← links)
- Two results on the bit extraction problem (Q1962063) (← links)
- Arranging numbers on circles to reach maximum total variations (Q2372892) (← links)
- On the fairness and complexity of generalized \(k\)-in-a-row games (Q2456362) (← links)
- The complexity of comparing optimal solutions (Q2671811) (← links)
- A Note on Iterating an $\alpha$-ary Gray Code (Q2719165) (← links)
- Online Prediction Problems with Variation (Q2920444) (← links)
- Inapproximability Results for the Weight Problems of Subgroup Permutation Codes (Q2989707) (← links)
- Computational Randomness from Generalized Hardcore Sets (Q3088271) (← links)
- Extracting Randomness from Multiple Independent Sources (Q3547226) (← links)
- On the Jensen–Shannon Divergence and Variational Distance (Q3547722) (← links)
- Simple Distance-Preserving Mappings From Ternary Vectors to Permutations (Q3604695) (← links)
- On the Complexity of Hardness Amplification (Q3604852) (← links)
- Deterministic Extractors for Independent-Symbol Sources (Q3613751) (← links)
- Distance-preserving mappings from binary vectors to permutations (Q4680074) (← links)
- JGAP: a Java-based graph algorithms platform (Q4791104) (← links)
- RECYCLING RANDOM BITS IN PARALLEL (Q4820146) (← links)
- Lower Bounds on Representing Boolean Functions as Polynomials in $Z_m $ (Q4875435) (← links)
- A dichotomy result for cyclic-order traversing games (Q5091020) (← links)
- Extracting Computational Entropy and Learning Noisy Linear Functions (Q5273500) (← links)
- Deterministic Extractors for Independent-Symbol Sources (Q5281198) (← links)
- Decoding Frequency Permutation Arrays Under Chebyshev Distance (Q5281224) (← links)
- Permutation Arrays Under the Chebyshev Distance (Q5281440) (← links)
- Extracting Computational Entropy and Learning Noisy Linear Functions (Q5323082) (← links)
- An Optimal Data Hiding Scheme With Tree-Based Parity Check (Q5370013) (← links)
- On the Complexity of Hard-Core Set Constructions (Q5428808) (← links)
- Impossibility Results on Weakly Black-Box Hardness Amplification (Q5444979) (← links)
