The following pages link to Thomas Dueholm Hansen (Q708337):
Displayed 23 items.
- On acyclicity of games with cycles (Q708338) (← links)
- A Faster Algorithm for Solving One-Clock Priced Timed Games (Q2842131) (← links)
- An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm (Q2941509) (← links)
- Lower Bounds for Howard’s Algorithm for Finding Minimum Mean-Cost Cycles (Q3060752) (← links)
- Hollow Heaps (Q3448827) (← links)
- Improved Bounds for Facility Location Games with Fair Cost Allocation (Q3637064) (← links)
- On Acyclicity of Games with Cycles (Q3638439) (← links)
- Subtree Isomorphism Revisited (Q4554355) (← links)
- Hollow Heaps (Q4554932) (← links)
- Subtree Isomorphism Revisited (Q4575669) (← links)
- Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs (Q4575870) (← links)
- Random-Edge Is Slower Than Random-Facet on Abstract Cubes (Q4598190) (← links)
- ARRIVAL: Next Stop in CLS (Q5002737) (← links)
- (Q5111373) (← links)
- (Q5111456) (← links)
- Faster <i>k</i> -SAT algorithms using biased-PPSZ (Q5212800) (← links)
- The Complexity of Interior Point Methods for Solving Discounted Turn-Based Stochastic Games (Q5326375) (← links)
- Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made (Q5361845) (← links)
- (Q5365038) (← links)
- Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles (Q5384024) (← links)
- Improved upper bounds for Random-Edge and Random-Jump on abstract cubes (Q5384026) (← links)
- Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based Stochastic Games with a Constant Discount Factor (Q5395701) (← links)
- Subexponential lower bounds for randomized pivoting rules for the simplex algorithm (Q5419098) (← links)