Bruno Bauwens - RankMe

49 papers A 4B 1C 1Misc 1Journal 38Unranked 3

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