I agree that this site is using cookies. You can find further informations here.
X
Hansen, Thomas Dueholm
99  results:
Search for persons X
?
1

Faster k-SAT algorithms using biased-PPSZ:

, In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing,
Hansen, Thomas Dueholm ; Kaplan, Haim ; Zamir, Or. - p. 578-589 , 2019
Link: https://dl.acm.org/doi/1..
 
?
2

Subtree Isomorphism Revisited:

Abboud, Amir ; Backurs, Arturs ; Hansen, Thomas Dueholm..
ACM Transactions on Algorithms (TALG).  14 (2018)  3 - p. 1-23 , 2018
Link: https://dl.acm.org/doi/1..
 
?
3

Subtree Isomorphism Revisited:

Abboud, Amir ; Backurs, Arturs ; Hansen, Thomas Dueholm..
ACM Transactions on Algorithms.  14 (2018)  3 - p. 1-23 , 2018
Link: https://doi.org/10.1145/..
 
?
4

Hollow Heaps:

Hansen, Thomas Dueholm ; Kaplan, Haim ; Tarjan, Robert E..
ACM Transactions on Algorithms (TALG).  13 (2017)  3 - p. 1-27 , 2017
Link: https://dl.acm.org/doi/1..
 
?
5

Faster algorithms for computing maximal 2-connected subgrap..:

, In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms,
Chechik, Shiri ; Hansen, Thomas Dueholm ; Italiano, Giuseppe F... - p. 1900-1918 , 2017
Link: https://dl.acm.org/doi/1..
 
?
6

Hollow Heaps:

Hansen, Thomas Dueholm ; Kaplan, Haim ; Tarjan, Robert E..
ACM Transactions on Algorithms.  13 (2017)  3 - p. 1-27 , 2017
Link: https://doi.org/10.1145/..
 
?
7

Simulating branching programs with edit distance and friend..:

, In: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing,
Abboud, Amir ; Hansen, Thomas Dueholm ; Williams, Virginia Vassilevska. - p. 375-388 , 2016
Link: https://dl.acm.org/doi/1..
 
?
8

Subtree isomorphism revisited:

, In: Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms,
Abboud, Amir ; Backurs, Arturs ; Hansen, Thomas Dueholm.. - p. 1256-1271 , 2016
Link: https://dl.acm.org/doi/1..
 
?
9

An Improved Version of the Random-Facet Pivoting Rule for t..:

, In: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing,
Hansen, Thomas Dueholm ; Zwick, Uri - p. 209-218 , 2015
Link: https://dl.acm.org/doi/1..
 
?
10

Improved upper bounds for random-edge and random-jump on ab..:

, In: Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms,
Hansen, Thomas Dueholm ; Paterson, Mike ; Zwick, Uri - p. 874-881 , 2014
Link: https://dl.acm.org/doi/1..
 
?
11

Dantzig's pivoting rule for shortest paths, deterministic M..:

, In: Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms,
Hansen, Thomas Dueholm ; Kaplan, Haim ; Zwick, Uri - p. 847-860 , 2014
Link: https://dl.acm.org/doi/1..
 
?
12

Strategy Iteration Is Strongly Polynomial for 2-Player Turn..:

Hansen, Thomas Dueholm ; Miltersen, Peter Bro ; Zwick, Uri
Journal of the ACM (JACM).  60 (2013)  1 - p. 1-16 , 2013
Link: https://dl.acm.org/doi/1..
 
?
13

Strategy Iteration Is Strongly Polynomial for 2-Player Turn..:

Hansen, Thomas Dueholm ; Miltersen, Peter Bro ; Zwick, Uri
Journal of the ACM.  60 (2013)  1 - p. 1-16 , 2013
Link: https://doi.org/10.1145/..
 
?
14

Subexponential lower bounds for randomized pivoting rules f..:

, In: Proceedings of the forty-third annual ACM symposium on Theory of computing,
Friedmann, Oliver ; Hansen, Thomas Dueholm ; Zwick, Uri - p. 283-292 , 2011
Link: https://dl.acm.org/doi/1..
 
?
15

A subexponential lower bound for the random facet algorithm..:

, In: Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete algorithms,
Friedmann, Oliver ; Hansen, Thomas Dueholm ; Zwick, Uri - p. 202-216 , 2011
Link: https://dl.acm.org/doi/1..
 
1-15