The following pages link to Online computation with advice (Q541670):
Displaying 50 items.
- Topology recognition with advice (Q259077) (← links)
- Online bin packing with advice (Q261387) (← links)
- A fast approximate implementation of the work function algorithm for solving the \(k\)-server problem (Q301952) (← 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)
- Weighted online problems with advice (Q726104) (← links)
- The string guessing problem as a method to prove lower bounds on the advice complexity (Q744093) (← links)
- Fast rendezvous with advice (Q896137) (← links)
- Online algorithms with advice for the dual bin packing problem (Q1642809) (← 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)
- Impact of knowledge on election time in anonymous networks (Q1755789) (← links)
- Online node- and edge-deletion problems with advice (Q1979452) (← links)
- On the advice complexity of the online dominating set problem (Q1998864) (← links)
- Advice complexity of treasure hunt in geometric terrains (Q2051769) (← links)
- Exploring sparse graphs with advice (Q2105435) (← links)
- Call admission problems on grids with advice (Q2136274) (← links)
- Two-way and one-way quantum and classical automata with advice for online minimization problems (Q2139057) (← links)
- Online two-way trading: randomization and advice (Q2219058) (← 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)
- Distributed graph searching with a sense of direction (Q2355324) (← 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)
- Finding the size and the diameter of a radio network using short labels (Q2661761) (← links)
- Weighted Online Problems with Advice (Q2819501) (← links)
- Advice Complexity of the Online Search Problem (Q2819505) (← links)
- On Advice Complexity of the k-server Problem under Sparse Metrics (Q2868631) (← links)
- Optimal Online Edge Coloring of Planar Graphs with Advice (Q2947032) (← links)
- Advice Complexity of Fine-Grained Job Shop Scheduling (Q2947041) (← links)
- Advice complexity of disjoint path allocation (Q2953693) (← links)
- On the Power of Randomness versus Advice in Online Computation (Q3166941) (← links)
- Online Graph Coloring Against a Randomized Adversary (Q3177338) (← 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)
- Advice Complexity and Barely Random Algorithms (Q5198936) (← links)
- A Simple PTAS for the Dual Bin Packing Problem and Advice Complexity of Its Online Version (Q5240422) (← links)
- Towards using the history in online computation with advice (Q5501863) (← links)
