Thomas Dueholm Hansen
Thomas Dueholm Hansen
Former Associate professor, University of Copenhagen
Dirección de correo verificada de di.ku.dk
TítuloCitado porAño
Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor
TD Hansen, PB Miltersen, U Zwick
Journal of the ACM (JACM) 60 (1), 1-16, 2013
782013
Subexponential lower bounds for randomized pivoting rules for the simplex algorithm
O Friedmann, TD Hansen, U Zwick
Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011
712011
Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made
A Abboud, TD Hansen, VV Williams, R Williams
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
602016
Subtree isomorphism revisited
A Abboud, A Backurs, TD Hansen, V Vassilevska Williams, O Zamir
ACM Transactions on Algorithms (TALG) 14 (3), 1-23, 2018
252018
Worst-case analysis of strategy iteration and the simplex method
TD Hansen
Department Office Computer Science, Aarhus University, 2012
232012
A subexponential lower bound for the random facet algorithm for parity games
O Friedmann, TD Hansen, U Zwick
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011
232011
An improved version of the random-facet pivoting rule for the simplex algorithm
TD Hansen, U Zwick
Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015
212015
Decremental single-source reachability and strongly connected components in O (m√ n) total update time
S Chechik, TD Hansen, GF Italiano, J Łącki, N Parotsidis
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016
182016
Lower bounds for howard’s algorithm for finding minimum mean-cost cycles
TD Hansen, U Zwick
International Symposium on Algorithms and Computation, 415-426, 2010
182010
On acyclicity of games with cycles
D Andersson, V Gurvich, TD Hansen
Discrete Applied Mathematics 158 (10), 1049-1063, 2010
182010
Approximability and parameterized complexity of minmax values
KA Hansen, TD Hansen, PB Miltersen, TB Sørensen
International Workshop on Internet and Network Economics, 684-695, 2008
182008
A faster algorithm for solving one-clock priced timed games
TD Hansen, R Ibsen-Jensen, PB Miltersen
International Conference on Concurrency Theory, 531-545, 2013
172013
Improved upper bounds for random-edge and random-jump on abstract cubes
TD Hansen, M Paterson, U Zwick
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
162014
Faster algorithms for computing maximal 2-connected subgraphs in sparse directed graphs
S Chechik, TD Hansen, GF Italiano, V Loitzenbauer, N Parotsidis
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
142017
On pure and (approximate) strong equilibria of facility location games
TD Hansen, OA Telelis
International Workshop on Internet and Network Economics, 490-497, 2008
122008
Hollow heaps
TD Hansen, H Kaplan, RE Tarjan, U Zwick
ACM Transactions on Algorithms (TALG) 13 (3), 1-27, 2017
82017
Improved bounds for facility location games with fair cost allocation
TD Hansen, OA Telelis
International Conference on Combinatorial Optimization and Applications, 174-185, 2009
82009
Random-Facet and Random-Bland require subexponential time even for shortest paths
O Friedmann, TD Hansen, U Zwick
arXiv preprint arXiv:1410.7530, 2014
72014
Decremental data structures for connectivity and dominators in directed graphs
L Georgiadis, TD Hansen, GF Italiano, S Krinninger, N Parotsidis
arXiv preprint arXiv:1704.08235, 2017
62017
The complexity of interior point methods for solving discounted turn-based stochastic games
TD Hansen, R Ibsen-Jensen
Conference on Computability in Europe, 252-262, 2013
62013
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20