2 papers
cs.DS2021
Temporal Locality in Online Algorithms
Maciej Pacut, Mahmoud Parham, Joel Rybicki +3
Online algorithms make decisions based on past inputs. In general, the decision may depend on the entire history of inputs. If many computers run the same online algorithm with the…
cs.DC2021
Locally Checkable Problems in Rooted Trees
Alkida Balliu, Sebastian Brandt, Yi-Jun Chang +4
Consider any locally checkable labeling problem in rooted regular trees: there is a finite set of labels , and for each label we specify what are permitted label c…