BB
Bruno Bauwens
cs.ITmath.ITcs.CCmath.LOcs.DSAlgorithmsAmino Acid Sequencecs.DMcs.NImath.ST
On Valency
published · living versionsW_2tdgu2e3·v1 · currentpublished
Stepsize modulation for cross entropy from local quadratic optimization
with Viacheslav Krivodub, Bingyu Zhang
1 version
Preprints & journals
32 papers in the corpus · 2009–2026Solomonoff induction of selected bits and online classification2610.18632v1 · Bruno Bauwens, German Kuznetsov2026 · 0 citationsarXiv
Online matching games in bipartite expanders: applications to bitprobes and dictionaries with non-adaptive probing2609.14559v1 · Bruno Bauwens, Marius Zimand2026 · 0 citationsarXiv
Explicit unbalanced 1-expanders with small degree and right size2609.14587v1 · Bruno Bauwens, Marius Zimand2026 · 0 citationsarXiv
All Kolmogorov complexity functions are optimal, but are some more optimal?2506.16180v1 · Bruno Bauwens, Alexander Kozachinskiy, Alexander Shen2025 · 0 citationsarXiv
Key-agreement exists if and only if the "interactive vs non interactive Kolmogorov problem" is not in ioBPP: a short proof2504.16311v1 · Bruno Bauwens, Bruno Loff2025 · 0 citationsarXiv
Space-bounded online Kolmogorov complexity is additive2502.02777v4 · Bruno Bauwens, Maria Marchenko2025 · 0 citationsarXiv
Efficient Mixed Integer Linear Programming Approaches to Dynamic Path Restoration2406.10110v1 · Alexander Rubtsov, Bruno Bauwens, Dmitri Shmelkin et al.2024 · 0 citationsarXiv
Online matching games in bipartite expanders: Hall-type results and applications to non-blocking connectors2204.01936v9 · Bruno Bauwens, Marius Zimand2022 · 0 citationsarXiv
Inequalities for space-bounded Kolmogorov complexity2010.10221v4 · Bruno Bauwens, Peter G'acs, Andrei Romashchenko et al.2020 · 2 citationsarXiv
Precise Expression for the Algorithmic Information Distance2009.00469v1 · Bruno Bauwens2020 · 0 citationsarXiv
Universal codes in the shared-randomness model for channels with general distortion capabilities2007.02330v5 · Bruno Bauwens, Marius Zimand2020 · 1 citationarXiv
The normalized algorithmic information distance can not be approximated2002.06683v1 · Bruno Bauwens, Ilya Blinnikov2020 · 3 citationsarXiv
Universal almost optimal compression and Slepian-Wolf coding in probabilistic polynomial time1911.04268v1 · Bruno Bauwens, Marius Zimand2019 · 4 citationsarXiv
LZW-Kernel: fast kernel utilizing variable length code blocks from LZW compressors for protein sequence classification.29741583 · Filatov, Gleb, Bauwens, Bruno, Kertész-Farkas, Attila2019 · 9 citationsBioinformatics (Oxford, England). 2018;34(19):3281-3288
Information Distance Revisited1807.11087v2 · Bruno Bauwens, Alexander Shen2018 · 1 citationarXiv
Optimal probabilistic polynomial time compression and the Slepian-Wolf theorem: tighter version and simple proofs1802.00750v1 · Bruno Bauwens2018 · 1 citationarXiv
Conditional probabilities and van Lambalgen theorem revisited1607.04240v1 · Bruno Bauwens, Alexander Shen, Hayato Takahashi2016 · 7 citationsarXiv
Uniform van Lambalgen's theorem fails for computable randomness1510.00554v3 · Bruno Bauwens2015 · 4 citationsarXiv
Van Lambalgen's theorem fails for some computable measure1509.02884v5 · Bruno Bauwens2015 · 1 citationarXiv
Upper semicomputable sumtests for lower semicomputable semimeasures1312.1718v1 · Bruno Bauwens2013 · 2 citationsarXiv
Linear list-approximation for short programs (or the power of a few random bits)1311.7278v2 · Bruno Bauwens, Marius Zimand2013 · 15 citationsarXiv
Relating and contrasting plain and prefix Kolmogorov complexity1311.2092v2 · Bruno Bauwens2013 · 2 citationsarXiv
Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs1310.5230v1 · Bruno Bauwens2013 · 3 citationsarXiv
Asymmetry of the Kolmogorov complexity of online predicting odd and even bits1307.4007v3 · Bruno Bauwens2013 · 1 citationarXiv
Sophistication vs Logical Depth1304.8046v3 · Lu'is Antunes, Bruno Bauwens, Andre Souto et al.2013 · 1 citationarXiv
Short lists with short programs in short time1301.1547v3 · Bruno Bauwens, Anton Makhlin, Nikolay Vereshchagin et al.2013 · 17 citationsarXiv
Complexity of complexity and strings with maximal plain and prefix Kolmogorov complexity1202.6668v2 · Bruno Bauwens, Alexander Shen2012 · 12 citationsarXiv
An additivity theorem for plain Kolmogorov complexity1111.4372v2 · Bruno Bauwens, Alexander Shen2011 · 1 citationarXiv
m-sophistication1001.4687v1 · Bruno Bauwens2010 · 0 citationsarXiv
Influence tests I: ideal composite hypothesis tests, and causal semimeasures0912.2688v1 · Bruno Bauwens2009 · 0 citationsarXiv
On the equivalence between minimal sufficient statistics, minimal typical models and initial segments of the Halting sequence0911.4521v1 · Bruno Bauwens2009 · 2 citationsarXiv
Additivity of on-line decision complexity is violated by a linear term in the length of a binary string0908.4457v1 · Bruno Bauwens2009 · 1 citationarXiv
Career total: 57 works. 32 are in this corpus.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.