Thomas Dueholm Hansen

Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based Stochastic Games with a Constant Discount Factor

Thomas Dueholm Hansen, Peter Bro Miltersen, Uri Zwick · Journal of the ACM · 2013 · 131 citations

Business, Decision Sciences, Game Theory +16

Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made

Amir Abboud, Thomas Dueholm Hansen, Virginia Vassilevska Williams et al. · 2016 · 81 citations · Full text

Computing, Computer Science, Mathematics +17

Subexponential lower bounds for randomized pivoting rules for the simplex algorithm

Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick · 2011 · 72 citations

Computing, Computer Science, Algorithms +13

Faster <i>k</i> -SAT algorithms using biased-PPSZ

Thomas Dueholm Hansen, Haim Kaplan, Or Zamir et al. · 2019 · 30 citations

Computing, Computer Science, Mathematics +10

An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm

Thomas Dueholm Hansen, Uri Zwick · 2015 · 25 citations

Computing, Computer Science, Algorithms +7