7 citations · 17 across the 21 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.IT2018
Information Distance Revisited
Bruno Bauwens, Alexander Shen
We consider the notion of information distance between two objects x and y introduced by Bennett, Gács, Li, Vitanyi, and Zurek [1] as the minimal length of a program that computes…
cs.IT2018★ 1 cited
Optimal probabilistic polynomial time compression and the Slepian-Wolf theorem: tighter version and simple proofs
Bruno Bauwens
We give simplify the proofs of the 2 results in Marius Zimand's paper "Kolmogorov complexity version of Slepian-Wolf coding, proceedings of STOC 2017, p22--32". The first is a univ…