research
∙
06/20/2023
Online Vector Bin Packing and Hypergraph Coloring Illuminated: Simpler Proofs and New Connections
This paper studies the online vector bin packing (OVBP) problem and the ...
share
research
∙
05/18/2023
Perspective on complexity measures targetting read-once branching programs
A model of computation for which reasonable yet still incomplete lower b...
research
∙
05/21/2020
Online Coloring and a New Type of Adversary for Online Graph Problems
We introduce a new type of adversary for online graph problems. The new ...
research
∙
05/21/2020
Chang's lemma via Pinsker's inequality
Extending the idea in [Impagliazzo, R., Moore, C. and Russell, A., An en...
research
∙
04/18/2019
Human Motion Prediction via Pattern Completion in Latent Representation Space
Inspired by ideas in cognitive science, we propose a novel and general a...
research
∙
10/21/2018
Conflict complexity is lower bounded by block sensitivity
We show conflict complexity of any total boolean function, recently defi...
research
∙
09/26/2018
Trading information complexity for error II
Consider the standard two-party communication model. This paper, follows...
research
∙
09/04/2018
