Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Bruno Bauwens
Observed names:
B. BAUWENS,
B. Bauwens,
Bauwens, B.,
Bauwens, Bruno,
Bruno Bauwens*
Institution:
National Research University Higher School of Economics
Observed institutions:
National Research University Higher School of Economics,
Universidade do Porto,
Ghent University,
Instituto de Telecomunicações,
Laboratoire Lorrain de Recherche en Informatique et ses Applications,
Université de Lorraine
show all 6
ORCID:
0000-0002-6138-0591
Observed ORCID:
0000-0002-6138-0591
OpenAlex ID:
A5040564003
Works
55
Awards
1
Mapping of horizontal refrigerant two-phase flow patterns based on clustering of capacitive sensor signals
2010
·
H. Canière
, B. Bauwens
, et al.
·
International Journal of Heat and Mass Transfer
·
43
PDF
Probabilistic mapping of adiabatic horizontal two-phase flow by capacitance signal feature clustering
2009
·
H. Canière
, B. Bauwens
, et al.
·
International Journal of Multiphase Flow
·
35
Short Lists with Short Programs in Short Time
2013
·
Bruno Bauwens
, Anton Makhlin
, et al.
·
IEEE Conference on Computational Complexity (CCC)
·
23
From circular ordinal regression to multilabel classification
2010
·
Dieter Devlaminck
, Willem Waegeman
, et al.
·
Ghent University Academic Bibliography (Ghent University)
·
20
Linear List-Approximation for Short Programs (or the Power of a Few Random Bits)
2014
·
Bruno Bauwens
, Marius Zimand
·
IEEE Conference on Computational Complexity (CCC)
·
18
Computability in statistical hypotheses testing, and characterizations of independence and directed influences in time series using Kolmogorov complexity
2010
·
Bruno Bauwens
·
Ghent University Academic Bibliography (Ghent University)
·
17
PDF
Sophistication vs Logical Depth
2016
·
Luís Antunes
, Bruno Bauwens
, et al.
·
Theory of Computing Systems
·
14
PDF
Complexity of Complexity and Strings With Maximal Plain and Prefix Kolmogorov Complexity
2014
·
B. BAUWENS
, A. SHEN
·
Journal of Symbolic Logic
·
14
PDF
Short lists with short programs in short time
2017
·
Bruno Bauwens
, Anton Makhlin
, et al.
·
Computational Complexity
·
13
PDF
LZW-Kernel: fast kernel utilizing variable length code blocks from LZW compressors for protein sequence classification
2018
·
Gleb Filatov
, Bruno Bauwens
, et al.
·
Bioinformatics
·
10
PDF
Conditional Probabilities and van Lambalgen’s Theorem Revisited
2017
·
Bruno Bauwens
, Alexander Shen
, et al.
·
Theory of Computing Systems
·
10
PDF
Universal almost Optimal Compression and Slepian-wolf Coding in Probabilistic Polynomial Time
2022
·
Bruno Bauwens*
, Marius Zimand
·
Journal of the ACM
·
8
PDF
Complexity of Complexity and Maximal Plain versus Prefix-Free Kolmogorov Complexity
2012
·
Bruno Bauwens
·
Lecture notes in computer science
·
8
Notes on Sum-Tests and Independence Tests
2009
·
Bruno Bauwens
, Sebastiaan A. Terwijn
·
Theory of Computing Systems
·
7
PDF
On the equivalence between minimal sufficient statistics, minimal typical models and initial segments of the Halting sequence
2009
·
Bauwens, Bruno
·
arXiv (Cornell University)
·
6
PDF
Uniform van Lambalgen's theorem fails for computable randomness
2019
·
Bruno Bauwens
·
Information and Computation
·
5
PDF
Conditional Measure and the Violation of Van Lambalgen’s Theorem for Martin-Löf Randomness
2016
·
Bruno Bauwens
·
Theory of Computing Systems
·
5
PDF
Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs
2015
·
Bruno Bauwens
·
Archive for Mathematical Logic
·
5
PDF
Inequalities for space-bounded Kolmogorov complexity
2022
·
Bruno Bauwens
, Peter Gács
, et al.
·
Computability
·
3
PDF
The Normalized Algorithmic Information Distance Can Not Be Approximated
2020
·
Bruno Bauwens
, Ilya Blinnikov
·
Lecture notes in computer science
·
3
PDF
Information Distance Revisited
2018
·
Bauwens, Bruno
, Shen, Alexander
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
3
PDF
Optimal probabilistic polynomial time compression and the Slepian-Wolf theorem: tighter version and simple proofs
2018
·
Bauwens, Bruno
·
arXiv (Cornell University)
·
3
PDF
Relating and Contrasting Plain and Prefix Kolmogorov Complexity
2015
·
Bruno Bauwens
·
Theory of Computing Systems
·
3
PDF
An Additivity Theorem for Plain Kolmogorov Complexity
2012
·
Bruno Bauwens
, Alexander Shen
·
Theory of Computing Systems
·
3
PDF
Ideal hypothesis testing and algorithmic information transfer
2009
·
Bruno Bauwens
·
Ghent University Academic Bibliography (Ghent University)
·
3
PDF
Show more works
View as search
Works count:
55
Citation count:
306
H-index:
10
I10-index:
11
Year
Topic
Type