2 citations · 3 across the 3 of their papers we have counts for
3 papers
cs.LG2014★ 1 cited
A Fast Quartet Tree Heuristic for Hierarchical Clustering
Rudi L. Cilibrasi, Paul M. B. Vitanyi
The Minimum Quartet Tree Cost problem is to construct an optimal weight tree from the weighted quartet topologies on objects, where optimality means that the s…
cs.IT2008★ 2 cited
Algorithmic information theory
Peter D. Grunwald, Paul M. B. Vitanyi
We introduce algorithmic information theory, also known as the theory of Kolmogorov complexity. We explain the main concepts of this quantitative approach to defining `information'…
cs.CC2008
On Time-Bounded Incompressibility of Compressible Strings and Sequences
E. G. Daylight, W. M. Koolen, P. M. B. Vitanyi
For every total recursive time bound , a constant fraction of all compressible (low Kolmogorov complexity) strings is -bounded incompressible (high time-bounded Kolmogorov co…