The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Thore Husfeldt: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Thore Husfeldt
    Fully Dynamic Transitive Closure in Plane Dags with One Source and One Sink. [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:199-212 [Conf]
  2. Stephen Alstrup, Thore Husfeldt, Theis Rauhe
    Marked Ancestor Problems. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:534-544 [Conf]
  3. Andreas Björklund, Thore Husfeldt
    Inclusion--Exclusion Algorithms for Counting Set Partitions. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:575-582 [Conf]
  4. Andreas Björklund, Thore Husfeldt
    Finding a Path of Superlogarithmic Length. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:985-992 [Conf]
  5. Andreas Björklund, Thore Husfeldt
    Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:548-559 [Conf]
  6. Andreas Björklund, Thore Husfeldt, Sanjeev Khanna
    Approximating Longest Directed Paths and Cycles. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:222-233 [Conf]
  7. Thore Husfeldt, Theis Rauhe
    Hardness Results for Dynamic Problems by Extensions of Fredman and Saks' Chronogram Method. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:67-78 [Conf]
  8. Stephen Alstrup, Thore Husfeldt, Theis Rauhe
    A cell probe lower bound for dynamic nearest-neighbor searching. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:779-780 [Conf]
  9. Thore Husfeldt, Theis Rauhe, Søren Skyum
    Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parentheses Matching. [Citation Graph (0, 0)][DBLP]
    SWAT, 1996, pp:198-211 [Conf]
  10. Gudmund Skovbjerg Frandsen, Thore Husfeldt, Peter Bro Miltersen, Theis Rauhe, Søren Skyum
    Dynamic Algorithms for the Dyck Languages. [Citation Graph (0, 0)][DBLP]
    WADS, 1995, pp:98-108 [Conf]
  11. Andreas Björklund, Thore Husfeldt, Sanjeev Khanna
    Approximating Longest Directed Path [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:032, pp:- [Journal]
  12. Stephen Alstrup, Thore Husfeldt, Theis Rauhe
    Dynamic nested brackets. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:193, n:2, pp:75-83 [Journal]
  13. Joachim Gudmundsson, Thore Husfeldt, Christos Levcopoulos
    Lower bounds for approximate polygon decomposition and minimum gap. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:81, n:3, pp:137-141 [Journal]
  14. Thore Husfeldt, Theis Rauhe, Søren Skyum
    Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parantheses Matching. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1996, v:3, n:4, pp:323-336 [Journal]
  15. Andreas Björklund, Thore Husfeldt
    Finding a Path of Superlogarithmic Length. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:6, pp:1395-1402 [Journal]
  16. Thore Husfeldt, Theis Rauhe
    New Lower Bound Techniques for Dynamic Partial Sums and Related Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:3, pp:736-753 [Journal]
  17. Stephen Alstrup, Thore Husfeldt, Theis Rauhe, Mikkel Thorup
    Black box for constant-time insertion in priority queues (note). [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2005, v:1, n:1, pp:102-106 [Journal]
  18. Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
    Fourier meets möbius: fast subset convolution. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:67-74 [Conf]
  19. Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
    Fourier meets Möbius: fast subset convolution [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  20. Counting Paths and Packings in Halves. [Citation Graph (, )][DBLP]


  21. Computing the Tutte Polynomial in Vertex-Exponential Time. [Citation Graph (, )][DBLP]


  22. The Travelling Salesman Problem in Bounded Degree Graphs. [Citation Graph (, )][DBLP]


  23. Exponential Time Complexity of the Permanent and the Tutte Polynomial. [Citation Graph (, )][DBLP]


  24. Covering and Packing in Linear Space. [Citation Graph (, )][DBLP]


  25. Trimmed Moebius Inversion and Graphs of Bounded Degree. [Citation Graph (, )][DBLP]


  26. Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings. [Citation Graph (, )][DBLP]


  27. Computing the Tutte polynomial in vertex-exponential time [Citation Graph (, )][DBLP]


  28. Trimmed Moebius Inversion and Graphs of Bounded Degree [Citation Graph (, )][DBLP]


  29. The fast intersection transform with applications to counting paths [Citation Graph (, )][DBLP]


  30. Counting Paths and Packings in Halves [Citation Graph (, )][DBLP]


  31. On evaluation of permanents [Citation Graph (, )][DBLP]


  32. Narrow sieves for parameterized paths and packings [Citation Graph (, )][DBLP]


  33. Inclusion-Exclusion Based Algorithms for Graph Colouring. [Citation Graph (, )][DBLP]


Search in 0.036secs, Finished in 0.037secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002