In the Online List Labeling problem, a set of $n \leq N$ elements from a totally ordered universe must be stored in sorted order in an array with $m=N+\lceil\varepsilon N \rceil$ slots, where $\varepsilon \in (0,1]$ is constant, while an adversary chooses elements that must be inserted and deleted from the set. We devise a skip-list based algorithm for maintaining order against an oblivious adversary and show that the expected amortized number of writes is $O(\varepsilon^{-1}\log (n) \operatorname{poly}(\log \log n))$ per update.

翻译：在在线列表标记问题中，来自全序宇宙的$n \leq N$个元素必须按排序顺序存储在一个具有$m=N+\lceil\varepsilon N \rceil$个槽位的数组中，其中$\varepsilon \in (0,1]$为常数，同时对手选择必须从集合中插入和删除的元素。我们设计了一种基于跳表的算法来维护顺序以对抗不知情对手，并证明了对于每次更新，期望摊还写入次数为$O(\varepsilon^{-1}\log (n) \operatorname{poly}(\log \log n))$。