Pages that link to "Item:Q2954988"
From MaRDI portal
The following pages link to Advice complexity for a class of online problems (Q2954988):
Displaying 23 items.
- Online algorithms with advice: the tape model (Q529045) (← links)
- Advice classes of parametrized tractability (Q676315) (← links)
- Weighted online problems with advice (Q726104) (← links)
- Online-bounded analysis (Q1617274) (← links)
- The advice complexity of a class of hard online problems (Q1693995) (← links)
- Call admission problems on grids with advice (extended abstract) (Q1757763) (← links)
- Online node- and edge-deletion problems with advice (Q1979452) (← links)
- On the advice complexity of the online dominating set problem (Q1998864) (← links)
- Dynamic node packing (Q2097666) (← links)
- Call admission problems on grids with advice (Q2136274) (← links)
- Improved analysis of the online set cover problem with advice (Q2402263) (← links)
- Advice complexity of online non-crossing matching (Q2678256) (← links)
- Weighted Online Problems with Advice (Q2819501) (← links)
- Advice Complexity of the Online Search Problem (Q2819505) (← links)
- Optimal Online Edge Coloring of Planar Graphs with Advice (Q2947032) (← links)
- Advice complexity of disjoint path allocation (Q2953693) (← links)
- Treasure Hunt with Advice (Q3460725) (← links)
- On the Advice Complexity of Online Problems (Q3652221) (← links)
- A Simple PTAS for the Dual Bin Packing Problem and Advice Complexity of Its Online Version (Q5240422) (← links)
- Online Bounded Analysis (Q5740182) (← links)
- Online Minimum Spanning Tree with Advice (Q5895056) (← links)
- On the Advice Complexity of Online Edge- and Node-Deletion Problems (Q6163644) (← links)
- Online computation with untrusted advice (Q6564618) (← links)
