The bookshelf problem (which computer scientists call the “list labeling” problem) is one of the most basic topics in the field of data structures. “It’s the kind of problem you’d teach to freshman or ...

As algorithms watch us, our inner witness—the self-observer—risks being replaced by performance. Reclaiming it may be key to ...

In this paper, we study an online cost optimization problem for distributed data access. The goal of this problem is to dynamically create and delete data copies in a multi-server distributed system ...