Metrical Task Systems on Trees via Mirror Descent and Unfair Gluing
Abstract
Keywords
MSC codes
Formats available
You can view the full content in the following formats:
References
Information & Authors
Information
Published In

Copyright
History
Keywords
MSC codes
Authors
Funding Information
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
- Learning-Augmented Competitive Algorithms for Spatiotemporal Online Allocation with Deadline ConstraintsProceedings of the ACM on Measurement and Analysis of Computing Systems, Vol. 9, No. 1 | 10 March 2025
- Dynamic Data Layout Optimization with Worst-Case Guarantees2024 IEEE 40th International Conference on Data Engineering (ICDE) | 13 May 2024
- The Online Pause and Resume Problem: Optimal Algorithms and An Application to Carbon-Aware Load ShiftingProceedings of the ACM on Measurement and Analysis of Computing Systems, Vol. 7, No. 3 | 12 December 2023
- Chasing Positive Bodies2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) | 6 Nov 2023
- Polylog-Competitive Algorithms for Dynamic Balanced Graph Partitioning for Ring DemandsProceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures | 17 June 2023
- Optimal Algorithms for Right-sizing Data CentersACM Transactions on Parallel Computing, Vol. 9, No. 4 | 16 December 2022
View Options
View options
- Access via your Institution
- Questions about how to access this content? Contact SIAM at [email protected].