The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

William F. Smyth: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Andrew Turpin, William F. Smyth
    An Approach to Phrase Selection for Offline Data Compression. [Citation Graph (0, 0)][DBLP]
    ACSC, 2002, pp:267-273 [Conf]
  2. Simon J. Puglisi, William F. Smyth, Andrew Turpin
    Suffix arrays: what are they good for? [Citation Graph (0, 0)][DBLP]
    ADC, 2006, pp:17-18 [Conf]
  3. M. Sohel Rahman, Costas S. Iliopoulos, Inbok Lee, Manal Mohamed, William F. Smyth
    Finding Patterns with Variable Length Gaps or Don't Cares. [Citation Graph (0, 0)][DBLP]
    COCOON, 2006, pp:146-155 [Conf]
  4. Kangmin Fan, William F. Smyth, R. J. Simpson
    A New Periodicity Lemma. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:257-265 [Conf]
  5. Frantisek Franek, Jiandong Jiang, Weilin Lu, William F. Smyth
    Two-Pattern Strings. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:76-84 [Conf]
  6. Frantisek Franek, Christopher G. Jennings, William F. Smyth
    A Simple Fast Hybrid Pattern-Matching Algorithm. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:288-297 [Conf]
  7. Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park, William F. Smyth
    Approximate Periods of Strings. [Citation Graph (0, 0)][DBLP]
    CPM, 1999, pp:123-133 [Conf]
  8. Simon J. Puglisi, William F. Smyth, Andrew Turpin
    The Performance of Linear Time Suffix Sorting Algorithms. [Citation Graph (0, 0)][DBLP]
    DCC, 2005, pp:358-367 [Conf]
  9. Costas S. Iliopoulos, William F. Smyth
    PRAM Algorithms for Identifying Polygon Similarity. [Citation Graph (0, 0)][DBLP]
    Optimal Algorithms, 1989, pp:25-32 [Conf]
  10. Dennis Moore, William F. Smyth
    Computing the Covers of a String in Linear Time. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:511-515 [Conf]
  11. Simon J. Puglisi, William F. Smyth, Andrew Turpin
    Inverted Files Versus Suffix Arrays for Locating Patterns in Primary Memory. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2006, pp:122-133 [Conf]
  12. Manolis Christodoulakis, Costas S. Iliopoulos, Mohammad Sohel Rahman, William F. Smyth
    Song classifications for dancing. [Citation Graph (0, 0)][DBLP]
    Stringology, 2006, pp:41-48 [Conf]
  13. Frantisek Franek, William F. Smyth
    Sorting suffixes of two-pattern strings. [Citation Graph (0, 0)][DBLP]
    Stringology, 2004, pp:69-78 [Conf]
  14. Yin Li, William F. Smyth
    Computing the Cover Array in Linear Time. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:32, n:1, pp:95-106 [Journal]
  15. Dennis Moore, William F. Smyth, D. Miller
    Counting Distinct Strings. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:23, n:1, pp:1-13 [Journal]
  16. Art M. Duval, William F. Smyth
    Covering a Circular String with Substrings of Fixed Length. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1996, v:7, n:1, pp:87-93 [Journal]
  17. Frantisek Franek, William F. Smyth
    Sorting suffixes of two-pattern strings. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:6, pp:1135-1144 [Journal]
  18. Frantisek Franek, William F. Smyth
    Reconstructing a Suffix Array. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2006, v:17, n:6, pp:1281-1296 [Journal]
  19. Dennis Moore, William F. Smyth
    An Optimal Algorithm to Compute all the Covers of a String. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:50, n:5, pp:239-246 [Journal]
  20. Dennis Moore, William F. Smyth
    A Correction to ``An Optimal Algorithm to Compute all the Covers of a String''. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:54, n:2, pp:101-103 [Journal]
  21. Frantisek Franek, Jan Holub, William F. Smyth, Xiangdong Xiao
    Computing Quasi Suffix Arrays. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2003, v:8, n:4, pp:593-606 [Journal]
  22. Frantisek Franek, William F. Smyth, Yudong Tang
    Computing All Repeats Using Suffix Arrays. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2003, v:8, n:4, pp:579-591 [Journal]
  23. Frantisek Franek, Weilin Lu, William F. Smyth
    Two-pattern strings I - A recognition algorithm. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2003, v:1, n:5-6, pp:445-460 [Journal]
  24. Frantisek Franek, William F. Smyth, Xiangdong Xiao
    A Note on Crochemore's Repetitions Algorithm - A Fast Space-Efficient Approach. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2003, v:10, n:1, pp:21-28 [Journal]
  25. Costas S. Iliopoulos, Manal Mohamed, Laurent Mouchard, Katerina Perdikuri, William F. Smyth, Athanasios K. Tsakalidis
    String Regularities with Don't Cares. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2003, v:10, n:1, pp:40-51 [Journal]
  26. Jacqueline W. Daykin, Costas S. Iliopoulos, William F. Smyth
    Parallel RAM Algorithms for Factorizing Words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:127, n:1, pp:53-67 [Journal]
  27. Costas S. Iliopoulos, Dennis Moore, William F. Smyth
    A Characterization of the Squares in a Fibonacci String. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:172, n:1-2, pp:281-291 [Journal]
  28. Costas S. Iliopoulos, William F. Smyth
    Optimal Algorithms for Computing the canonical form of a circular string. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:92, n:1, pp:87-105 [Journal]
  29. Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park, William F. Smyth
    Approximate periods of strings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:557-568 [Journal]
  30. Gang Chen, Simon J. Puglisi, William F. Smyth
    Fast and Practical Algorithms for Computing All the Runs in a String. [Citation Graph (0, 0)][DBLP]
    CPM, 2007, pp:307-315 [Conf]
  31. Simon J. Puglisi, William F. Smyth, Andrew Turpin
    A taxonomy of suffix array construction algorithms. [Citation Graph (0, 0)][DBLP]
    Stringology, 2005, pp:1-30 [Conf]
  32. Frantisek Franek, William F. Smyth
    Reconstructing a suffix array. [Citation Graph (0, 0)][DBLP]
    Stringology, 2005, pp:54-68 [Conf]
  33. Simon J. Puglisi, William F. Smyth, Andrew Turpin
    A taxonomy of suffix array construction algorithms. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 2007, v:39, n:2, pp:- [Journal]

  34. Key Parameters in Identifying Cost of Spam 2.0. [Citation Graph (, )][DBLP]


  35. Efficient token based clone detection with flexible tokenization. [Citation Graph (, )][DBLP]


  36. New Perspectives on the Prefix Array. [Citation Graph (, )][DBLP]


  37. An Adaptive Hybrid Pattern-Matching Algorithm on Indeterminate Strings. [Citation Graph (, )][DBLP]


  38. Fast Optimal Algorithms for Computing All the Repeats in a String. [Citation Graph (, )][DBLP]


Search in 0.063secs, Finished in 0.064secs
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