( en | de | ru )

 

Disambiguation of "Husfeldt, Thore"

Author of the publication

copydeleteadd this publication to your clipboard
New Lower Bound Techniques for Dynamic Partial Sums and Related Problems.

, and . SIAM J. Comput., 32 (3): 736-753 (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Fritz Thorey

Paul Husfeldt

Angela Husfeldt

Vera Husfeldt

Sylvia Thoren

 

Other publications of authors with the same name

Invitation to Algorithmic Uses of Inclusion-Exclusion.. ICALP (2), volume 6756 of Lecture Notes in Computer Science, page 42-59. Springer, (2011)Graph colouring algorithms.. CoRR, (2015)The shortest even cycle problem is tractable., , and . STOC, page 117-130. ACM, (2022)Guest Editorial: Special Issue on Parameterized and Exact Computation., and . Algorithmica, 79 (1): 1-2 (2017)Dynamic Algorithms for the Dyck Languages., , , , and . WADS, volume 955 of Lecture Notes in Computer Science, page 98-108. Springer, (1995)New Lower Bound Techniques for Dynamic Partial Sums and Related Problems., and . SIAM J. Comput., 32 (3): 736-753 (2003)Fully Dynamic Transitive Closure in Plane Dags with One Source and One Sink.. ESA, volume 979 of Lecture Notes in Computer Science, page 199-212. Springer, (1995)Multivariate Analysis of Orthogonal Range Searching and Graph Distances., , and . IPEC, volume 115 of LIPIcs, page 4:1-4:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)A cell probe lower bound for dynamic nearest-neighbor searching., , and . SODA, page 779-780. ACM/SIAM, (2001)Multivariate Analysis of Orthogonal Range Searching and Graph Distances., , and . Algorithmica, 82 (8): 2292-2315 (2020)