The following pages link to Alexander Kozachinskiy (Q1625171):
Displaying 13 items.
- On Slepian-Wolf theorem with interaction (Q1635810) (← links)
- New bounds for the flock-of-birds problem (Q2097227) (← links)
- Two characterizations of finite-state dimension (Q2291415) (← links)
- Automatic Kolmogorov complexity, normality, and finite-state dimension revisited (Q2656172) (← links)
- Making Randomness Public in Unbounded-Round Information Complexity (Q3194724) (← links)
- From Expanders to Hitting Distributions and Simulation Theorems (Q5005099) (← links)
- One-Sided Error Communication Complexity of Gap Hamming Distance. (Q5005103) (← links)
- On Slepian–Wolf Theorem with Interaction (Q5740187) (← links)
- Recognizing read-once functions from depth-three formulas (Q5915579) (← links)
- Continuous Positional Payoffs (Q6135780) (← links)
- One-to-two-player lifting for mildly growing memory (Q6490989) (← links)
- Infinite separation between general and chromatic memory (Q6547948) (← links)
- Constant-depth sorting networks (Q6610308) (← links)
