Guessing fractions of online sequences (Q2064290): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Tight Bounds on Online Checkpointing Algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Online Checkpointing with Improved Worst-Case Guarantees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Oblivious Medians Via Online Bidding / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Competitive snoopy caching / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient array partitioning / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Streaming Partitioning of Sequences and Trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Preemptively guessing the center / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3851570 / rank | |||
Normal rank |
Revision as of 15:19, 27 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Guessing fractions of online sequences |
scientific article |
Statements
Guessing fractions of online sequences (English)
0 references
5 January 2022
0 references
online algorithms
0 references
preemption
0 references
guessing
0 references
lower bounds
0 references