Mutual information and algorithmic information transfer as ideal undirected and directed independence tests. - Bruno Bauwens; Bart Wyns; Dieter Devlaminck; Georges Otte; Luc Boullart; Patrick Santens (FCS, 2007)

Additivity of on-line decision complexity is violated by a linear term in the length of a binary string - Bruno Bauwens (CoRR, 2009)

On the equivalence between minimal sufficient statistics, minimal typical models and initial segments of the Halting sequence - Bruno Bauwens (CoRR, 2009)

Directional predictions for 4-class BCI data. - Dieter Devlaminck; Willem Waegeman; Bruno Bauwens; Bart Wyns; Georges Otte; Luc Boullart; Patrick Santens (ESANN, 2010)

m-sophistication - Bruno Bauwens (CoRR, 2010)

An additivity theorem for plain complexity - Bruno Bauwens; Alexander Shen 001 (CoRR, 2011)

Notes on Sum-Tests and Independence Tests. - Bruno Bauwens; Sebastiaan A. Terwijn (Theory Comput. Syst., 2011)

Complexity of Complexity and Maximal Plain versus Prefix-Free Kolmogorov Complexity. - Bruno Bauwens (ICALP (1), 2012)

Upper semicomputable sumtests for lower semicomputable semimeasures. - Bruno Bauwens (CoRR, 2013)

An Additivity Theorem for Plain Kolmogorov Complexity. - Bruno Bauwens; Alexander Shen 001 (Theory Comput. Syst., 2013)

Asymmetry of the Kolmogorov complexity of online predicting odd and even bits. - Bruno Bauwens (STACS, 2014)

Complexity of Complexity and Strings with Maximal Plain and Prefix Kolmogorov Complexity. - Bruno Bauwens; Alexander Shen 001 (J. Symb. Log., 2014)

Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs. - Bruno Bauwens (Arch. Math. Log., 2015)

Linear list-approximation for short programs (or the power of a few random bits). - Bruno Bauwens; Marius Zimand (Electron. Colloquium Comput. Complex., 2015)

Relating and Contrasting Plain and Prefix Kolmogorov Complexity. - Bruno Bauwens (Theory Comput. Syst., 2016)

Sophistication vs Logical Depth. - Luis Filipe Coelho Antunes; Bruno Bauwens; André Souto; Andreia Teixeira (Theory Comput. Syst., 2017)

Conditional Measure and the Violation of Van Lambalgen's Theorem for Martin-Löf Randomness. - Bruno Bauwens (Theory Comput. Syst., 2017)

Conditional Probabilities and van Lambalgen's Theorem Revisited. - Bruno Bauwens; Alexander Shen 001; Hayato Takahashi 001 (Theory Comput. Syst., 2017)

LZW-Kernel: fast kernel utilizing variable length code blocks from LZW compressors for protein sequence classification. - Gleb Filatov; Bruno Bauwens; Attila Kertész-Farkas (Bioinform., 2018)

Short lists with short programs in short time. - Bruno Bauwens; Anton Makhlin; Nikolai K. Vereshchagin; Marius Zimand (Comput. Complex., 2018)

Optimal probabilistic polynomial time compression and the Slepian-Wolf theorem: tighter version and simple proofs. - Bruno Bauwens (CoRR, 2018)

Information Distance Revisited. - Bruno Bauwens; Alexander Shen 001 (CoRR, 2018)

The Normalized Algorithmic Information Distance Can Not Be Approximated. - Bruno Bauwens; Ilya Blinnikov (CSR, 2020)

Information Distance Revisited. - Bruno Bauwens (STACS, 2020)

Universal codes in the shared-randomness model for channels with general distortion capabilities. - Bruno Bauwens; Marius Zimand (CoRR, 2020)

Precise Expression for the Algorithmic Information Distance. - Bruno Bauwens (CoRR, 2020)

Uniform van Lambalgen's theorem fails for computable randomness. - Bruno Bauwens (Inf. Comput., 2020)

Inequalities for space-bounded Kolmogorov complexity. - Bruno Bauwens; Péter Gács; Andrei E. Romashchenko; Alexander Shen 001 (Comput., 2022)

Hall-type theorems for fast almost dynamic matching and applications. - Bruno Bauwens; Marius Zimand (CoRR, 2022)

Universal almost Optimal Compression and Slepian-wolf Coding in Probabilistic Polynomial Time. - Bruno Bauwens; Marius Zimand (J. ACM, 2023)

Efficient Mixed Integer Linear Programming Approaches to Dynamic Path Restoration. - Alexander A. Rubtsov; Bruno Bauwens; Dmitri Shmelkin; Elizaveta Rudenko; Alexey Lavrov (BlackSeaCom, 2024)

Space-Bounded Online Kolmogorov Complexity is Additive. - Bruno Bauwens; Maria Marchenko (CiE, 2025)

Symmetry of information for space-bounded online Kolmogorov complexity. - Bruno Bauwens; Maria Marchenko (CoRR, 2025)

Key-agreement exists if and only if the "interactive vs non interactive Kolmogorov problem" is not in ioBPP: a short proof. - Bruno Bauwens; Bruno Loff (CoRR, 2025)

All Kolmogorov complexity functions are optimal, but are some more optimal? - Bruno Bauwens; Alexander Kozachinskiy; Alexander Shen 001 (CoRR, 2025)