7 citations · 17 across the 21 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
cs.IT2026
Solomonoff induction of selected bits and online classification
Bruno Bauwens, German Kuznetsov
Solomonoff induction is a general solution for sequence prediction that started the field of algorithmic information theory around 1960. Let be the universal semimeasure. After…
cs.CC2026
Explicit unbalanced 1-expanders with small degree and right size
Bruno Bauwens, Marius Zimand
An explicit graph is given with left size , left degree , right size and -expansion up to~, meaning that every left subset of size $K'…
cs.DS2026
Online matching games in bipartite expanders: applications to bitprobes and dictionaries with non-adaptive probing
Bruno Bauwens, Marius Zimand
A dictionary is a data structure which stores pairs (key, value). The operation query on input key returns value if the dictionary contains a pair (key, value) and nil otherwise. A…