Folgen
Thomas Dueholm Hansen
Thomas Dueholm Hansen
Former Associate professor, University of Copenhagen
Bestätigte E-Mail-Adresse bei di.ku.dk
Titel
Zitiert von
Zitiert von
Jahr
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
1792013
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
1332016
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
1002011
Subtree isomorphism revisited
A Abboud, A Backurs, TD Hansen, V Vassilevska Williams, O Zamir
ACM Transactions on Algorithms (TALG) 14 (3), 1-23, 2018
622018
Faster k-SAT algorithms using biased-PPSZ
TD Hansen, H Kaplan, O Zamir, U Zwick
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
542019
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
452015
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
362017
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
342016
Approximability and parameterized complexity of minmax values
KA Hansen, TD Hansen, PB Miltersen, TB Sørensen
Internet and Network Economics: 4th International Workshop, WINE 2008 …, 2008
332008
Worst-case analysis of strategy iteration and the simplex method
TD Hansen
Aarhus Universitet, Datalogisk Institut, 2012
312012
ARRIVAL: next stop in CLS
B Gärtner, TD Hansen, P Hubáček, K Král, H Mosaad, V Slívová
arXiv preprint arXiv:1802.07702, 2018
262018
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
262010
Hollow heaps
TD Hansen, H Kaplan, RE Tarjan, U Zwick
ACM Transactions on Algorithms (TALG) 13 (3), 1-27, 2017
252017
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
252013
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
252011
On acyclicity of games with cycles
D Andersson, V Gurvich, TD Hansen
Discrete Applied Mathematics 158 (10), 1049-1063, 2010
232010
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
Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles
TD Hansen, H Kaplan, U Zwick
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete …, 2014
132014
On pure and (approximate) strong equilibria of facility location games
TD Hansen, OA Telelis
International Workshop on Internet and Network Economics, 490-497, 2008
132008
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
122017
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20