1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2017★ 1 cited
Better Labeling Schemes for Nearest Common Ancestors through Minor-Universal Trees
Paweł Gawrychowski, Jakub Łopuszański
A labeling scheme for nearest common ancestors assigns a distinct binary string, called the label, to every node of a tree, so that given the labels of two nodes (and no further in…
cs.DS2008
Generalized Whac-a-Mole
Marcin Bienkowski, Marek Chrobak, Christoph Durr +5
We consider online competitive algorithms for the problem of collecting weighted items from a dynamic set S, when items are added to or deleted from S over time. The objective is t…