Vizing's theorem states that every graph $ G $ of maximum degree $\Delta $ can be properly
edge-colored using $\Delta+ 1$ colors. The fastest currently known $(\Delta+ 1) $-edge …

We obtain essentially tight upper bounds for a strengthened notion of regret in the stochastic
linear bandits framework. The strengthening---referred to as Nash regret---is defined as the …

Consider the following experiment: a deck with m copies of n different card types is randomly
shuffled, and a guesser attempts to guess the cards sequentially as they are drawn. Each …

We present a simple $(1+\varepsilon)\Delta $-edge-coloring algorithm for graphs of
maximum degree $\Delta=\Omega (\log n/\varepsilon) $ with running time $ O\left (m\,\log^ 3 …

In one view of the classical game of prediction with expert advice with binary outcomes, in
each round, each expert maintains an adversarially chosen belief and honestly reports this …

Contention resolution addresses the problem of coordinating access to a shared
communication channel. Time is discretized into synchronized slots, and a packet …

Most work in the area of learning theory has focused on designing effective Probably
Approximately Correct (PAC) learners. Recently, other models of learning such as …

Linear-probing hash tables have been classically believed to support insertions in time
Θ(x^2), where 1-1/x is the load factor of the hash table. Recent work by Bender, Kuszmaul …

We present a randomized algorithm that, given $\epsilon> 0$, outputs a proper
$(1+\epsilon)\Delta $-edge-coloring of an $ m $-edge simple graph $ G $ of maximum …

Let $\epsilon\in (0, 1) $ and $ n,\Delta\in\mathbb N $ be such that $\Delta=\Omega\left
(\max\left\{\frac {\log n}{\epsilon},\,\left (\frac {1}{\epsilon}\log\frac {1}{\epsilon}\right) …