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