Bruno Bauwens

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 19

Top Topics

Kolmogorov Complexity

Top Venues

Theory Comput. Syst.

Publications

Alexander A. Rubtsov, Bruno Bauwens, Dmitri Shmelkin, Elizaveta Rudenko, Alexey Lavrov
Efficient Mixed Integer Linear Programming Approaches to Dynamic Path Restoration. CoRR (2024)
Bruno Bauwens, Marius Zimand
Universal almost Optimal Compression and Slepian-wolf Coding in Probabilistic Polynomial Time. J. ACM 70 (2) (2023)
Bruno Bauwens, Péter Gács, Andrei E. Romashchenko, Alexander Shen
Inequalities for space-bounded Kolmogorov complexity. Comput. 11 (3-4) (2022)
Bruno Bauwens, Marius Zimand
Hall-type theorems for fast almost dynamic matching and applications. CoRR (2022)
Bruno Bauwens
Precise Expression for the Algorithmic Information Distance. CoRR (2020)
Bruno Bauwens, Marius Zimand
Universal codes in the shared-randomness model for channels with general distortion capabilities. CoRR (2020)
Bruno Bauwens, Ilya Blinnikov
The Normalized Algorithmic Information Distance Can Not Be Approximated. CSR (2020)
Bruno Bauwens, Ilya Blinnikov
The normalized algorithmic information distance can not be approximated. CoRR (2020)
Bruno Bauwens
Uniform van Lambalgen's theorem fails for computable randomness. Inf. Comput. 271 (2020)
Bruno Bauwens
Information Distance Revisited. STACS (2020)
Bruno Bauwens, Marius Zimand
Universal almost optimal compression and Slepian-Wolf coding in probabilistic polynomial time. CoRR (2019)
Bruno Bauwens
Optimal probabilistic polynomial time compression and the Slepian-Wolf theorem: tighter version and simple proofs. CoRR (2018)
Gleb Filatov, Bruno Bauwens, Attila Kertész-Farkas
LZW-Kernel: fast kernel utilizing variable length code blocks from LZW compressors for protein sequence classification. Bioinform. 34 (19) (2018)
Bruno Bauwens, Anton Makhlin, Nikolai K. Vereshchagin, Marius Zimand
Short lists with short programs in short time. Comput. Complex. 27 (1) (2018)
Bruno Bauwens, Alexander Shen
Information Distance Revisited. CoRR (2018)
Bruno Bauwens
Conditional Measure and the Violation of Van Lambalgen's Theorem for Martin-Löf Randomness. Theory Comput. Syst. 60 (2) (2017)
Bruno Bauwens, Alexander Shen, Hayato Takahashi
Conditional Probabilities and van Lambalgen's Theorem Revisited. Theory Comput. Syst. 61 (4) (2017)
Luis Filipe Coelho Antunes, Bruno Bauwens, André Souto, Andreia Teixeira
Sophistication vs Logical Depth. Theory Comput. Syst. 60 (2) (2017)
Bruno Bauwens
Relating and Contrasting Plain and Prefix Kolmogorov Complexity. Theory Comput. Syst. 58 (3) (2016)
Bruno Bauwens
Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs. Arch. Math. Log. 54 (5-6) (2015)
Bruno Bauwens, Marius Zimand
Linear list-approximation for short programs (or the power of a few random bits). Electron. Colloquium Comput. Complex. 22 (2015)
Bruno Bauwens, Marius Zimand
Linear List-Approximation for Short Programs (or the Power of a Few Random Bits). Computational Complexity Conference (2014)
Bruno Bauwens
Asymmetry of the Kolmogorov complexity of online predicting odd and even bits. STACS (2014)
Bruno Bauwens, Alexander Shen
Complexity of Complexity and Strings with Maximal Plain and Prefix Kolmogorov Complexity. J. Symb. Log. 79 (2) (2014)
Bruno Bauwens, Alexander Shen
An Additivity Theorem for Plain Kolmogorov Complexity. Theory Comput. Syst. 52 (2) (2013)
Bruno Bauwens, Anton Makhlin, Nikolay K. Vereshchagin, Marius Zimand
Short lists with short programs in short time CoRR (2013)
Bruno Bauwens
Relating and contrasting plain and prefix Kolmogorov complexity. CoRR (2013)
Bruno Bauwens
Upper semicomputable sumtests for lower semicomputable semimeasures. CoRR (2013)
Bruno Bauwens, Anton Makhlin, Nikolay K. Vereshchagin, Marius Zimand
Short lists with short programs in short time. Electron. Colloquium Comput. Complex. 20 (2013)
Bruno Bauwens, Anton Makhlin, Nikolay K. Vereshchagin, Marius Zimand
Short Lists with Short Programs in Short Time. Computational Complexity Conference (2013)
Bruno Bauwens
Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs. CoRR (2013)
Bruno Bauwens, Marius Zimand
Linear list-approximation for short programs (or the power of a few random bits). CoRR (2013)
Luis Filipe Coelho Antunes, Bruno Bauwens, Andre Souto, Andreia Teixeira
Sophistication vs Logical Depth CoRR (2013)
Bruno Bauwens
Asymmetry of the Kolmogorov complexity of online predicting odd and even bits. CoRR (2013)
Bruno Bauwens
Complexity of complexity and maximal plain versus prefix-free Kolmogorov complexity CoRR (2012)
Bruno Bauwens
Complexity of Complexity and Maximal Plain versus Prefix-Free Kolmogorov Complexity. ICALP (1) (2012)
Bruno Bauwens, Sebastiaan A. Terwijn
Notes on Sum-Tests and Independence Tests. Theory Comput. Syst. 48 (2) (2011)
Bruno Bauwens, Alexander Shen
An additivity theorem for plain complexity CoRR (2011)
Bruno Bauwens
m-sophistication CoRR (2010)
Dieter Devlaminck, Willem Waegeman, Bruno Bauwens, Bart Wyns, Georges Otte, Luc Boullart, Patrick Santens
Directional predictions for 4-class BCI data. ESANN (2010)
Bruno Bauwens
On the equivalence between minimal sufficient statistics, minimal typical models and initial segments of the Halting sequence CoRR (2009)
Bruno Bauwens
Additivity of on-line decision complexity is violated by a linear term in the length of a binary string CoRR (2009)
Bruno Bauwens, Bart Wyns, Dieter Devlaminck, Georges Otte, Luc Boullart, Patrick Santens
Mutual information and algorithmic information transfer as ideal undirected and directed independence tests. FCS (2007)