research
∙
12/31/2020
Matching on the line admits no o(√(log n))-competitive algorithm
We present a simple proof that the competitive ratio of any randomized o...
share
research
∙
07/18/2018
Deterministic oblivious distribution (and tight compaction) in linear time
In an array of N elements, M positions and M elements are "marked". We s...
research
∙
12/30/2017
On approximating the stationary distribution of time-reversible Markov chains
Approximating the stationary probability of a state in a Markov chain th...
research
∙
04/22/2013
