The following pages link to Sacha Krug (Q744080):
Displaying 11 items.
- 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)
- On the advice complexity of the online dominating set problem (Q1998864) (← links)
- Improved analysis of the online set cover problem with advice (Q2402263) (← links)
- On the Approximation Ratio of the Path Matching Christofides Algorithm (Q2891381) (← links)
- On the Power of Advice and Randomization for the Disjoint Path Allocation Problem (Q2938097) (← links)
- On Energy-Efficient Computations With Advice (Q3196431) (← links)
- On the Advice Complexity of the Online L(2,1)-Coloring Problem on Paths and Cycles (Q4925225) (← links)
- The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity (Q4925265) (← links)
- Analysis of a near-metric TSP approximation algorithm (Q5397720) (← links)
- Towards using the history in online computation with advice (Q5501863) (← links)