research
∙
04/05/2022
Hall-type theorems for fast almost dynamic matching and applications
A dynamic set of size up to K is a set in which elements can be inserted...
share
research
∙
08/30/2020
Precise Expression for the Algorithmic Information Distance
We consider the notion of information distance between two objects x and...
research
∙
07/05/2020
Universal codes in the shared-randomness model for channels with general distortion capabilities
We put forth new models for universal channel coding. Unlike standard co...
research
∙
02/16/2020
The normalized algorithmic information distance can not be approximated
It is known that the normalized algorithmic information distance N is no...
research
∙
11/11/2019
Universal almost optimal compression and Slepian-Wolf coding in probabilistic polynomial time
In a lossless compression system with target lengths, a compressor C map...
research
∙
07/29/2018
Information Distance Revisited
We consider the notion of information distance between two objects x and...
research
∙
02/02/2018
