Thomas Dueholm Hansen

Available identifiers

zbMath Open hansen.thomas-dueholmMaRDI QIDQ708337

List of research outcomes

Publication	Date of Publication	Type
ARRIVAL: Next Stop in CLS	2021-07-28	Paper
https://portal.mardi4nfdi.de/entity/Q5111373	2020-05-27	Paper
https://portal.mardi4nfdi.de/entity/Q5111456	2020-05-27	Paper
Faster k -SAT algorithms using biased-PPSZ	2020-01-30	Paper
Improved upper bounds for Random-Edge and Random-Jump on abstract cubes	2019-06-20	Paper
Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles	2019-06-20	Paper
Subtree Isomorphism Revisited	2018-11-13	Paper
Hollow Heaps	2018-11-12	Paper
Subtree Isomorphism Revisited	2018-07-16	Paper
Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs	2018-07-16	Paper
Random-Edge Is Slower Than Random-Facet on Abstract Cubes	2017-12-19	Paper
https://portal.mardi4nfdi.de/entity/Q5365038	2017-09-29	Paper
Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made	2017-09-29	Paper
Hollow Heaps	2015-10-27	Paper
An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm	2015-08-21	Paper
Subexponential lower bounds for randomized pivoting rules for the simplex algorithm	2014-06-05	Paper
Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based Stochastic Games with a Constant Discount Factor	2014-02-17	Paper
A Faster Algorithm for Solving One-Clock Priced Timed Games	2013-08-12	Paper
The Complexity of Interior Point Methods for Solving Discounted Turn-Based Stochastic Games	2013-08-05	Paper
Lower Bounds for Howard’s Algorithm for Finding Minimum Mean-Cost Cycles	2010-12-09	Paper
On acyclicity of games with cycles	2010-10-11	Paper
Improved Bounds for Facility Location Games with Fair Cost Allocation	2009-07-07	Paper
On Acyclicity of Games with Cycles	2009-07-02	Paper

Research outcomes over time

This page was built for person: Thomas Dueholm Hansen