Information Processing Letters
Brief announcement: new bounds for the controller problem
Proceedings of the 28th ACM symposium on Principles of distributed computing
New bounds for the controller problem
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Tight lower bounds for the online labeling problem
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
On online labeling with polynomially many labels
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
On randomized online labeling with polynomially many labels
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |
Maintaining a monotonic labeling of an ordered list during the insertion of n items requires $\Omega$(n log n) individual relabelings, in the worst case, if the number of usable labels is only polynomial in n. This follows from a lower bound for a new problem, prefix bucketing.