default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBruno Bauwens
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j13]Bruno Bauwens
, Marius Zimand:
Universal almost Optimal Compression and Slepian-wolf Coding in Probabilistic Polynomial Time. J. ACM 70(2): 9:1-9:33 (2023)- 2022
- [j12]Bruno Bauwens, Péter Gács, Andrei E. Romashchenko, Alexander Shen:
Inequalities for space-bounded Kolmogorov complexity. Comput. 11(3-4): 165-185 (2022) - 2020
- [j11]Bruno Bauwens:
Uniform van Lambalgen's theorem fails for computable randomness. Inf. Comput. 271: 104486 (2020) - 2018
- [j10]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): 3281-3288 (2018) - [j9]Bruno Bauwens, Anton Makhlin, Nikolai K. Vereshchagin, Marius Zimand:
Short lists with short programs in short time. Comput. Complex. 27(1): 31-61 (2018) - 2017
- [j8]Luis Filipe Coelho Antunes, Bruno Bauwens, André Souto, Andreia Teixeira:
Sophistication vs Logical Depth. Theory Comput. Syst. 60(2): 280-298 (2017) - [j7]Bruno Bauwens:
Conditional Measure and the Violation of Van Lambalgen's Theorem for Martin-Löf Randomness. Theory Comput. Syst. 60(2): 314-323 (2017) - [j6]Bruno Bauwens, Alexander Shen, Hayato Takahashi:
Conditional Probabilities and van Lambalgen's Theorem Revisited. Theory Comput. Syst. 61(4): 1315-1336 (2017) - 2016
- [j5]Bruno Bauwens:
Relating and Contrasting Plain and Prefix Kolmogorov Complexity. Theory Comput. Syst. 58(3): 482-501 (2016) - 2015
- [j4]Bruno Bauwens:
Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs. Arch. Math. Log. 54(5-6): 615-629 (2015) - 2014
- [j3]Bruno Bauwens, Alexander Shen:
Complexity of Complexity and Strings with Maximal Plain and Prefix Kolmogorov Complexity. J. Symb. Log. 79(2): 620-632 (2014) - 2013
- [j2]Bruno Bauwens, Alexander Shen:
An Additivity Theorem for Plain Kolmogorov Complexity. Theory Comput. Syst. 52(2): 297-302 (2013) - 2011
- [j1]Bruno Bauwens, Sebastiaan A. Terwijn:
Notes on Sum-Tests and Independence Tests. Theory Comput. Syst. 48(2): 247-268 (2011)
Conference and Workshop Papers
- 2024
- [c9]Alexander A. Rubtsov, Bruno Bauwens, Dmitri Shmelkin, Elizaveta Rudenko, Alexey Lavrov:
Efficient Mixed Integer Linear Programming Approaches to Dynamic Path Restoration. BlackSeaCom 2024: 146-152 - 2020
- [c8]Bruno Bauwens, Ilya Blinnikov:
The Normalized Algorithmic Information Distance Can Not Be Approximated. CSR 2020: 130-141 - [c7]Bruno Bauwens:
Information Distance Revisited. STACS 2020: 46:1-46:14 - 2014
- [c6]Bruno Bauwens, Marius Zimand:
Linear List-Approximation for Short Programs (or the Power of a Few Random Bits). CCC 2014: 241-247 - [c5]Bruno Bauwens:
Asymmetry of the Kolmogorov complexity of online predicting odd and even bits. STACS 2014: 125-136 - 2013
- [c4]Bruno Bauwens, Anton Makhlin, Nikolay K. Vereshchagin, Marius Zimand:
Short Lists with Short Programs in Short Time. CCC 2013: 98-108 - 2012
- [c3]Bruno Bauwens:
Complexity of Complexity and Maximal Plain versus Prefix-Free Kolmogorov Complexity. ICALP (1) 2012: 100-108 - 2010
- [c2]Dieter Devlaminck, Willem Waegeman, Bruno Bauwens, Bart Wyns, Georges Otte, Luc Boullart, Patrick Santens:
Directional predictions for 4-class BCI data. ESANN 2010 - 2007
- [c1]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: 21-26
Informal and Other Publications
- 2024
- [i22]Alexander A. Rubtsov, Bruno Bauwens, Dmitri Shmelkin, Elizaveta Rudenko, Alexey Lavrov:
Efficient Mixed Integer Linear Programming Approaches to Dynamic Path Restoration. CoRR abs/2406.10110 (2024) - 2022
- [i21]Bruno Bauwens, Marius Zimand:
Hall-type theorems for fast almost dynamic matching and applications. CoRR abs/2204.01936 (2022) - 2020
- [i20]Bruno Bauwens, Ilya Blinnikov:
The normalized algorithmic information distance can not be approximated. CoRR abs/2002.06683 (2020) - [i19]Bruno Bauwens, Marius Zimand:
Universal codes in the shared-randomness model for channels with general distortion capabilities. CoRR abs/2007.02330 (2020) - [i18]Bruno Bauwens:
Precise Expression for the Algorithmic Information Distance. CoRR abs/2009.00469 (2020) - 2019
- [i17]Bruno Bauwens, Marius Zimand:
Universal almost optimal compression and Slepian-Wolf coding in probabilistic polynomial time. CoRR abs/1911.04268 (2019) - 2018
- [i16]Bruno Bauwens:
Optimal probabilistic polynomial time compression and the Slepian-Wolf theorem: tighter version and simple proofs. CoRR abs/1802.00750 (2018) - [i15]Bruno Bauwens, Alexander Shen:
Information Distance Revisited. CoRR abs/1807.11087 (2018) - 2015
- [i14]Bruno Bauwens, Marius Zimand:
Linear list-approximation for short programs (or the power of a few random bits). Electron. Colloquium Comput. Complex. TR15 (2015) - 2013
- [i13]Bruno Bauwens, Anton Makhlin, Nikolay K. Vereshchagin, Marius Zimand:
Short lists with short programs in short time. CoRR abs/1301.1547 (2013) - [i12]Luis Filipe Coelho Antunes, Bruno Bauwens, Andre Souto, Andreia Teixeira:
Sophistication vs Logical Depth. CoRR abs/1304.8046 (2013) - [i11]Bruno Bauwens:
Asymmetry of the Kolmogorov complexity of online predicting odd and even bits. CoRR abs/1307.4007 (2013) - [i10]Bruno Bauwens:
Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs. CoRR abs/1310.5230 (2013) - [i9]Bruno Bauwens:
Relating and contrasting plain and prefix Kolmogorov complexity. CoRR abs/1311.2092 (2013) - [i8]Bruno Bauwens, Marius Zimand:
Linear list-approximation for short programs (or the power of a few random bits). CoRR abs/1311.7278 (2013) - [i7]Bruno Bauwens:
Upper semicomputable sumtests for lower semicomputable semimeasures. CoRR abs/1312.1718 (2013) - [i6]Bruno Bauwens, Anton Makhlin, Nikolay K. Vereshchagin, Marius Zimand:
Short lists with short programs in short time. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [i5]Bruno Bauwens:
Complexity of complexity and maximal plain versus prefix-free Kolmogorov complexity. CoRR abs/1202.6668 (2012) - 2011
- [i4]Bruno Bauwens, Alexander Shen:
An additivity theorem for plain complexity. CoRR abs/1111.4372 (2011) - 2010
- [i3]Bruno Bauwens:
m-sophistication. CoRR abs/1001.4687 (2010) - 2009
- [i2]Bruno Bauwens:
Additivity of on-line decision complexity is violated by a linear term in the length of a binary string. CoRR abs/0908.4457 (2009) - [i1]Bruno Bauwens:
On the equivalence between minimal sufficient statistics, minimal typical models and initial segments of the Halting sequence. CoRR abs/0911.4521 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-04 21:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
