Guessing fractions of online sequences

DOI10.1016/J.DAM.2020.07.015OpenAlexW3049604414MaRDI QIDQ2064290

Christian Konrad, Tigran Tonoyan

Publication date: 5 January 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2020.07.015

zbMATH Keywords

online algorithmslower boundspreemptionguessing

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of data (68Pxx) Theory of software (68Nxx)

Cites Work

• Unnamed Item
• Competitive snoopy caching
• Preemptively guessing the center
• Online Checkpointing with Improved Worst-Case Guarantees
• Oblivious Medians Via Online Bidding
• Efficient array partitioning
• Tight Bounds on Online Checkpointing Algorithms
• Streaming Partitioning of Sequences and Trees

This page was built for publication: Guessing fractions of online sequences