Upper semi-lattice of binary strings with the relation "x is simple conditional to y"
Theoretical Computer Science
Combinatorial interpretation of Kolmogorov complexity
Theoretical Computer Science
A Random Oracle Does Not Help Extract the Mutual Information
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Violating the Ingleton inequality with finite groups
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Stability of properties of Kolmogorov complexity under relativization
Problems of Information Transmission
New inequalities for subspace arrangements
Journal of Combinatorial Theory Series A
Ideal secret sharing schemes for useful multipartite access structures
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
Kolmogorov complexity as a language
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Shannon entropy vs. kolmogorov complexity
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Multisource algorithmic information theory
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
| Hi-index | 0.00 |