research
∙
04/18/2022
Optimal Coding Theorems in Time-Bounded Kolmogorov Complexity
The classical coding theorem in Kolmogorov complexity states that if an ...
share
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...
research
∙
03/28/2022
27 Open Problems in Kolmogorov Complexity
The paper proposes open problems in classical Kolmogorov complexity. Eac...
research
∙
02/16/2021
Online matching in lossless expanders
Bauwens and Zimand [BZ 2019] have shown that lossless expanders have an ...
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
∙
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
∙
10/09/2019
Secret key agreement from correlated data, with no prior information
A fundamental question that has been studied in cryptography and in info...
research
∙
05/01/2019
On a conditional inequality in Kolmogorov complexity and its applications in communication complexity
Romashchenko and Zimand rom-zim:c:mutualinfo have shown that if we parti...
research
∙
10/16/2017
