Guessing fractions of online sequences

DOI10.1016/J.DAM.2020.07.015MaRDI QIDQ2064290zbMATH OpenOpenAlexFDO

Authors 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

guessinglower boundsonline algorithmspreemption

Mathematics Subject Classification ID

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

Recommendations

• A guessing game and randomized online algorithms
• On Guessing Whether A Sequence Has A Certain Property
• Online Selection of Alternating Subsequences from a Random Sample
• On-Line Probability, Complexity and Randomness
• Publication:4204219
• On-line Ramsey Numbers
• Asymptotic expansions and strategies in the online increasing subsequence problem
• Online and size anti-Ramsey numbers
• scientific article; zbMATH DE number 3941962
• scientific article; zbMATH DE number 3817820

Cites work

• Competitive snoopy caching
• Efficient array partitioning
• scientific article; zbMATH DE number 3651705 (Why is no real title available?)
• Oblivious Medians Via Online Bidding
• Preemptively guessing the center
• Streaming partitioning of sequences and trees
• Tight bounds on online checkpointing algorithms

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2064290)