| Publication | Date of Publication | Type |
|---|
| Dependent \(k\)-set packing on polynomoids | 2024-12-03 | Paper |
| A note on the \(k\)-restriction problem | 2024-09-11 | Paper |
| A dichotomy result for cyclic-order traversing games | 2022-07-21 | Paper |
| The complexity of comparing optimal solutions | 2022-06-03 | Paper |
| An Optimal Data Hiding Scheme With Tree-Based Parity Check | 2017-10-19 | Paper |
| Deterministic Extractors for Independent-Symbol Sources | 2017-07-27 | Paper |
| Decoding Frequency Permutation Arrays Under Chebyshev Distance | 2017-07-27 | Paper |
| Permutation Arrays Under the Chebyshev Distance | 2017-07-27 | Paper |
| Extracting Computational Entropy and Learning Noisy Linear Functions | 2017-07-12 | Paper |
| Inapproximability Results for the Weight Problems of Subgroup Permutation Codes | 2017-06-08 | Paper |
| Exact solution of a minimal recurrence | 2016-06-16 | Paper |
| Online Prediction Problems with Variation | 2014-09-26 | Paper |
| More on the one-dimensional sliding-coin puzzle | 2014-09-12 | Paper |
| On the inapproximability of maximum intersection problems | 2012-10-23 | Paper |
| Complexity of hard-core set proofs | 2012-09-21 | Paper |
| Computing the ball size of frequency permutations under Chebyshev distance | 2012-05-14 | Paper |
| Computational Randomness from Generalized Hardcore Sets | 2011-08-19 | Paper |
| Decoding permutation arrays with ternary vectors | 2011-08-02 | Paper |
| More on the Magnus-Derek game | 2011-02-02 | Paper |
| Extracting Computational Entropy and Learning Noisy Linear Functions | 2009-07-23 | Paper |
| A note on unscrambling address lines | 2009-03-23 | Paper |
| Deterministic Extractors for Independent-Symbol Sources | 2009-03-12 | Paper |
| Simple Distance-Preserving Mappings From Ternary Vectors to Permutations | 2009-02-24 | Paper |
| On the Complexity of Hardness Amplification | 2009-02-24 | Paper |
| Extracting Randomness from Multiple Independent Sources | 2008-12-21 | Paper |
| On the Jensen–Shannon Divergence and Variational Distance | 2008-12-21 | Paper |
| Jug measuring: algorithms and complexity | 2008-05-28 | Paper |
| Impossibility Results on Weakly Black-Box Hardness Amplification | 2008-02-26 | Paper |
| On the Complexity of Hard-Core Set Constructions | 2007-11-28 | Paper |
| On the fairness and complexity of generalized \(k\)-in-a-row games | 2007-10-18 | Paper |
| Arranging numbers on circles to reach maximum total variations | 2007-07-16 | Paper |
| Improved hardness amplification in NP | 2007-02-26 | Paper |
| On the construction of permutation arrays via mappings from binary vectors to permutations | 2006-11-22 | Paper |
| Distance-preserving mappings from binary vectors to permutations | 2005-06-01 | Paper |
| RECYCLING RANDOM BITS IN PARALLEL | 2004-10-06 | Paper |
| JGAP: a Java-based graph algorithms platform | 2003-02-04 | Paper |
| Two results on the bit extraction problem | 2002-06-13 | Paper |
| A Note on Iterating an $\alpha$-ary Gray Code | 2001-06-21 | Paper |
| On the bottleneck counting argument | 2000-06-04 | Paper |
| Lower Bounds on Representing Boolean Functions as Polynomials in $Z_m $ | 1996-07-02 | Paper |
