Centrum Wiskunde & Informatica

Language compression and pseudorandom generators Article

Computational Complexity, 247-274.

H.M. Buhrman (Harry), T. J. Lee (Troy) and D. van Melkebeek

January 2005
Clustering by compression Article

IEEE Transactions on Information Theory, 51(4), 1523-1545.

R.L. Cilibrasi (Rudi) and P.M.B. Vitányi (Paul)

January 2005
Proceedings NUMDIFF 10 Proceedings

January 2005
The statistical strength of nonlocality proofs Article

IEEE Transactions on Information Theory, 51(8), 2812-2835.

W. van Dam (Wim), R.D. Gill (Richard) and P.D. Grünwald (Peter)

January 2005
Asymptotic log-loss of prequential maximum likelihood codes In Proceedings

P.D. Grünwald (Peter) and S. de Rooij (Steven)

January 2005
Advances in Minimum Description Length: Theory and Applications Book

January 2005
The quantum adversary method and classical formula size lower bounds Article

Complexity, 76-90.

S. Laplante, T. J. Lee (Troy) and M. Szegedy (Mario)

January 2005
Quantum Fanout is Powerful Article

Theory of Computing, 1(5), 83-101.

P. Høyer (Peter) and R. Spalek (Robert)

January 2005

Previous

Next