Pages that link to "Item:Q529045"
From MaRDI portal
The following pages link to Online algorithms with advice: the tape model (Q529045):
Displaying 12 items.
- The \(k\)-server problem with advice in \(d\) dimensions and on the sphere (Q1741849) (← links)
- Online node- and edge-deletion problems with advice (Q1979452) (← links)
- On the advice complexity of the online dominating set problem (Q1998864) (← links)
- Call admission problems on grids with advice (Q2136274) (← links)
- Call admission problems on trees (Q2672603) (← links)
- The secretary problem with reservation costs (Q2695326) (← links)
- Advice Complexity of Fine-Grained Job Shop Scheduling (Q2947041) (← links)
- Disjoint Path Allocation with Sublinear Advice (Q3196403) (← links)
- Advice Complexity and Barely Random Algorithms (Q5198936) (← links)
- Parallel solutions for preemptive makespan scheduling on two identical machines (Q6102847) (← links)
- Parallel solutions for ordinal scheduling with a small number of machines (Q6176402) (← links)
- Advice complexity of adaptive priority algorithms (Q6180750) (← links)
