Randomness conservation inequalities; information and independence in mathematical theories
Information and Control
Unbiased bits from sources of weak randomness and probabilistic communication complexity
SIAM Journal on Computing - Special issue on cryptography
Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
SIAM Journal on Discrete Mathematics
Independent minimum length programs to translate between given strings
Theoretical Computer Science
Extracting Randomness Using Few Independent Sources
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Extractors with weak random seeds
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
How to Get More Mileage from Randomness Extractors
CCC '06 Proceedings of the 21st Annual IEEE Conference on Computational Complexity
Visualization 2001 Conference (Acm
Visualization 2001 Conference (Acm
A 2-Source Almost-Extractor for Linear Entropy
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Dimension Extractors and Optimal Decompression
Theory of Computing Systems
Constructive Dimension and Turing Degrees
Theory of Computing Systems - Special Issue: Computation and Logic in the Real World; Guest Editors: S. Barry Cooper, Elvira Mayordomo and Andrea Sorbi
Algorithmically independent sequences
Information and Computation
2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Two Sources Are Better than One for Increasing the Kolmogorov Complexity of Infinite Sequences
Theory of Computing Systems - Special Issue: Symposium on Computer Science; Guest Editors: Sergei Artemov, Volker Diekert and Alexander Razborov
Counting dependent and independent strings
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Impossibility of independence amplification in Kolmogorov complexity theory
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Extracting kolmogorov complexity with applications to dimension zero-one laws
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Increasing kolmogorov complexity
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
| Hi-index | 0.00 |