In the 2-choice allocation problem, m balls are placed into n bins, and each ball must
choose between two random bins i,j∈n that it has been assigned to. It has been known for …

In this column, we will discuss some papers in online algorithms that appeared in 2021. As
usual, we make no claim at complete coverage here, and have instead made a selection. If …

The bamboo trimming problem considers n bamboo with growth rates h1, 2,..., satisfying
Σihi= 1. During a given unit of time, each bamboo grows by hi, and then the bamboo …

This paper studies the problem of programming a robotic panda gardener to keep a bamboo
garden from obstructing the view of the lake by your house. The garden consists of n …

A garden is populated by n bamboos, each with its own daily growth rate. The Bamboo
Garden Trimming Problem (BGT) is to design for a robotic gardener a perpetual schedule of …

This thesis revisits some of the oldest and most basic questions in the theory of randomized
data structures—questions such as: How efficient is a linear probing hash table? How fast …

The\emph {$ p $-processor cup game} is a classic and widely studied scheduling problem
that captures the setting in which a $ p $-processor machine must assign tasks to processors …

This paper studies two related scheduling problems: fractional bamboo trimming and
distributed windows scheduling. In the fractional bamboo trimming problem, we are given n …

This paper studies two related scheduling problems: fractional bamboo trimming and
distributed windows scheduling. In the fractional bamboo trimming problem, we are given n …

In this thesis, we consider a variety of problems where solutions must be found while
adhering to some kind of restriction. We measure the performance of our algorithms by …