The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Philip Bille: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Philip Bille, Inge Li Gørtz
    Matching Subsequences in Trees. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:248-259 [Conf]
  2. Arjan Kuijper, Ole Fogh Olsen, Peter J. Giblin, Philip Bille, Mads Nielsen
    From a 2D Shape to a String Structure Using the Symmetry Set. [Citation Graph (0, 0)][DBLP]
    ECCV (2), 2004, pp:313-325 [Conf]
  3. Philip Bille
    New Algorithms for Regular Expression Matching. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:643-654 [Conf]
  4. Philip Bille, Inge Li Gørtz
    The Tree Inclusion Problem: In Optimal Space and Faster. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:66-77 [Conf]
  5. Arjan Kuijper, Ole Fogh Olsen, Philip Bille, Peter J. Giblin
    Matching 2D Shapes using their Symmetry Sets. [Citation Graph (0, 0)][DBLP]
    ICPR (2), 2006, pp:179-182 [Conf]
  6. Stephen Alstrup, Philip Bille, Theis Rauhe
    Labeling schemes for small distances in trees. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:689-698 [Conf]
  7. Stephen Alstrup, Philip Bille, Theis Rauhe
    Labeling Schemes for Small Distances in Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:2, pp:448-462 [Journal]
  8. Philip Bille
    A survey on tree edit distance and related problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:337, n:1-3, pp:217-239 [Journal]
  9. Philip Bille, Rolf Fagerberg, Inge Li Gørtz
    Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts. [Citation Graph (0, 0)][DBLP]
    CPM, 2007, pp:52-62 [Conf]
  10. Philip Bille, Rolf Fagerberg, Inge Li Gørtz
    Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  11. Philip Bille
    New Algorithms for Regular Expression Matching [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  12. Philip Bille, Inge Li Gørtz
    The Tree Inclusion Problem: In Linear Space and Faster [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  13. Philip Bille, Anna Pagh, Rasmus Pagh
    Fast evaluation of union-intersection expressions [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  14. Philip Bille
    Pattern Matching in Trees and Strings [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  15. Fast Searching in Packed Strings. [Citation Graph (, )][DBLP]


  16. Faster Regular Expression Matching. [Citation Graph (, )][DBLP]


  17. Fast Evaluation of Union-Intersection Expressions. [Citation Graph (, )][DBLP]


  18. Regular Expression Matching with Multi-Strings and Intervals. [Citation Graph (, )][DBLP]


  19. Fast Arc-Annotated Subsequence Matching in Linear Space. [Citation Graph (, )][DBLP]


  20. Fast and Compact Regular Expression Matching [Citation Graph (, )][DBLP]


  21. Matching Subsequences in Trees [Citation Graph (, )][DBLP]


  22. Faster Approximate String Matching for Short Patterns [Citation Graph (, )][DBLP]


  23. Fast Searching in Packed Strings [Citation Graph (, )][DBLP]


  24. Fast Arc-Annotated Subsequence Matching in Linear Space [Citation Graph (, )][DBLP]


  25. Random Access to Grammar Compressed Strings [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
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