Pages that link to "Item:Q3652221"

The following pages link to On the Advice Complexity of Online Problems (Q3652221):

Displaying 13 items.

• Online bin packing with advice (Q261387) (← links)
• On the advice complexity of online bipartite matching and online stable marriage (Q402379) (← links)
• Online coloring of bipartite graphs with and without advice (Q486981) (← links)
• Online algorithms with advice for bin packing and scheduling problems (Q496020) (← links)
• On the advice complexity of the \(k\)-server problem under sparse metrics (Q503460) (← links)
• Online algorithms with advice: the tape model (Q529045) (← links)
• Weighted online problems with advice (Q726104) (← links)
• On the advice complexity of the online \(L(2,1)\)-coloring problem on paths and cycles (Q744081) (← links)
• The string guessing problem as a method to prove lower bounds on the advice complexity (Q744093) (← links)
• The advice complexity of a class of hard online problems (Q1693995) (← links)
• Reordering buffer management with advice (Q1707821) (← links)
• The \(k\)-server problem with advice in \(d\) dimensions and on the sphere (Q1741849) (← links)
• Advice complexity of disjoint path allocation (Q2953693) (← links)