Thomas Dueholm Hansen

From MaRDI portal
Person:708337

Available identifiers

zbMath Open hansen.thomas-dueholmMaRDI QIDQ708337

List of research outcomes





PublicationDate of PublicationType
ARRIVAL: Next Stop in CLS2021-07-28Paper
https://portal.mardi4nfdi.de/entity/Q51113732020-05-27Paper
https://portal.mardi4nfdi.de/entity/Q51114562020-05-27Paper
Faster k -SAT algorithms using biased-PPSZ2020-01-30Paper
Improved upper bounds for Random-Edge and Random-Jump on abstract cubes2019-06-20Paper
Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles2019-06-20Paper
Subtree Isomorphism Revisited2018-11-13Paper
Hollow Heaps2018-11-12Paper
Subtree Isomorphism Revisited2018-07-16Paper
Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs2018-07-16Paper
Random-Edge Is Slower Than Random-Facet on Abstract Cubes2017-12-19Paper
https://portal.mardi4nfdi.de/entity/Q53650382017-09-29Paper
Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made2017-09-29Paper
Hollow Heaps2015-10-27Paper
An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm2015-08-21Paper
Subexponential lower bounds for randomized pivoting rules for the simplex algorithm2014-06-05Paper
Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based Stochastic Games with a Constant Discount Factor2014-02-17Paper
A Faster Algorithm for Solving One-Clock Priced Timed Games2013-08-12Paper
The Complexity of Interior Point Methods for Solving Discounted Turn-Based Stochastic Games2013-08-05Paper
Lower Bounds for Howard’s Algorithm for Finding Minimum Mean-Cost Cycles2010-12-09Paper
On acyclicity of games with cycles2010-10-11Paper
Improved Bounds for Facility Location Games with Fair Cost Allocation2009-07-07Paper
On Acyclicity of Games with Cycles2009-07-02Paper

Research outcomes over time

This page was built for person: Thomas Dueholm Hansen