Follow
Bruno Bauwens
Title
Cited by
Cited by
Year
Mapping of horizontal refrigerant two-phase flow patterns based on clustering of capacitive sensor signals
H Canière, B Bauwens, C T’Joen, M De Paepe
International Journal of Heat and Mass Transfer 53 (23-24), 5298-5307, 2010
522010
Probabilistic mapping of adiabatic horizontal two-phase flow by capacitance signal feature clustering
H Canière, B Bauwens, C T’Joen, M De Paepe
International Journal of Multiphase Flow 35 (7), 650-660, 2009
412009
Short lists with short programs in short time
B Bauwens, A Makhlin, N Vereshchagin, M Zimand
2013 IEEE Conference on Computational Complexity, 98-108, 2013
37*2013
Linear list-approximation for short programs (or the power of a few random bits)
B Bauwens, M Zimand
2014 IEEE 29th Conference on Computational Complexity (CCC), 241-247, 2014
222014
Complexity of complexity and strings with maximal plain and prefix Kolmogorov complexity
B Bauwens, A Shen
The Journal of Symbolic Logic 79 (2), 620-632, 2014
222014
From circular ordinal regression to multilabel classification
D Devlaminck, W Waegeman, B Bauwens, B Wyns, P Santens, G Otte
Preference Learning (PL-10): ECML/PKDD-10 tutorial and workshop, 2010
192010
Computability in statistical hypotheses testing, and characterizations of independence and directed influences in time series using Kolmogorov complexity
B Bauwens
Ghent University, 2010
182010
Conditional probabilities and van Lambalgen’s theorem revisited
B Bauwens, A Shen, H Takahashi
Theory of Computing Systems 61, 1315-1336, 2017
112017
LZW-Kernel: fast kernel utilizing variable length code blocks from LZW compressors for protein sequence classification
G Filatov, B Bauwens, A Kertész-Farkas
Bioinformatics 34 (19), 3281-3288, 2018
92018
Sophistication vs logical depth
L Antunes, B Bauwens, A Souto, A Teixeira
Theory of Computing Systems 60, 280-298, 2017
92017
Notes on sum-tests and independence tests
B Bauwens, SA Terwijn
Theory of Computing Systems 48 (2), 247-268, 2011
92011
Conditional measure and the violation of van Lambalgen’s theorem for Martin-Löf randomness
B Bauwens
Theory of Computing Systems 60 (2), 314-323, 2017
82017
Universal almost optimal compression and Slepian-Wolf coding in probabilistic polynomial time
B Bauwens, M Zimand
arXiv preprint arXiv:1911.04268, 2019
7*2019
Uniform van Lambalgen's theorem fails for computable randomness
B Bauwens
arXiv preprint arXiv:1510.00554, 2015
6*2015
Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs
B Bauwens
Archive for Mathematical Logic 54, 615-629, 2015
52015
An additivity theorem for plain Kolmogorov complexity
B Bauwens, A Shen
Theory of Computing Systems 52 (2), 297-302, 2013
5*2013
Information distance revisited
B Bauwens, A Shen
arXiv preprint arXiv:1807.11087, 2018
42018
Relating and contrasting plain and prefix Kolmogorov complexity
B Bauwens
Theory of Computing Systems 58, 482-501, 2016
32016
On the equivalence between minimal sufficient statistics, minimal typical models and initial segments of the Halting sequence
B Bauwens
arXiv preprint arXiv:0911.4521, 2009
32009
Additivity of on-line decision complexity is violated by a linear term in the length of a binary string
B Bauwens
arXiv preprint arXiv:0908.4457, 2009
32009
The system can't perform the operation now. Try again later.
Articles 1–20