Pages that link to "Item:Q3075527"

The following pages link to Advice Complexity and Barely Random Algorithms (Q3075527):

Displaying 10 items.

• On the advice complexity of the \(k\)-server problem under sparse metrics (Q503460) (← links)
• Advice classes of parametrized tractability (Q676315) (← 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 structure of logarithmic advice complexity classes (Q1275000) (← links)
• On online algorithms with advice for the \(k\)-server problem (Q2344207) (← links)
• On Advice Complexity of the k-server Problem under Sparse Metrics (Q2868631) (← links)
• Advice Complexity of Fine-Grained Job Shop Scheduling (Q2947041) (← links)
• (Q5150974) (← links)
• Advice Complexity and Barely Random Algorithms (Q5198936) (← links)