Pages that link to "Item:Q3012806"

The following pages link to On the Advice Complexity of the k-Server Problem (Q3012806):

Displaying 36 items.

• Online bin packing with advice (Q261387) (← links)
• On the advice complexity of online bipartite matching and online stable marriage (Q402379) (← 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)
• On the list update problem with advice (Q515679) (← links)
• Online algorithms with advice: the tape model (Q529045) (← 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)
• On extensions of the deterministic online model for bipartite matching and max-sat (Q1740687) (← links)
• 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)
• Online bin packing with advice of small size (Q2322702) (← links)
• On online algorithms with advice for the \(k\)-server problem (Q2344207) (← links)
• Advice complexity of maximum independent set in sparse and bipartite graphs (Q2344218) (← links)
• Online multi-coloring with advice (Q2355706) (← links)
• Online makespan minimization with parallel schedules (Q2362356) (← links)
• On the advice complexity of the \(k\)-server problem (Q2396827) (← links)
• The ANTS problem (Q2401118) (← links)
• Improved analysis of the online set cover problem with advice (Q2402263) (← links)
• The online knapsack problem: advice and randomization (Q2437775) (← links)
• The secretary problem with reservation costs (Q2695326) (← links)
• Advice Complexity of the Online Search Problem (Q2819505) (← links)
• On Advice Complexity of the k-server Problem under Sparse Metrics (Q2868631) (← links)
• A Technique to Obtain Hardness Results for Randomized Online Algorithms – A Survey (Q2944895) (← links)
• Optimal Online Edge Coloring of Planar Graphs with Advice (Q2947032) (← links)
• On the Power of Randomness versus Advice in Online Computation (Q3166941) (← links)
• Disjoint Path Allocation with Sublinear Advice (Q3196403) (← links)
• On Energy-Efficient Computations With Advice (Q3196431) (← links)
• Online Bin Packing with Advice of Small Size (Q3449804) (← links)
• Online Multi-Coloring with Advice (Q3453285) (← links)
• Treasure Hunt with Advice (Q3460725) (← links)
• Towards using the history in online computation with advice (Q5501863) (← links)
• Advice complexity of priority algorithms (Q5916086) (← links)