Optimal expected time to complete the online monotone array filling game with i.i.d. uniform samples is (1/2 + o(1)) n log n, with a separation shown for the with-replacement variant.
4969–4995
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The online monotone array completion problem
Optimal expected time to complete the online monotone array filling game with i.i.d. uniform samples is (1/2 + o(1)) n log n, with a separation shown for the with-replacement variant.