The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Simon J. Puglisi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. Michael A. Maniscalco, Simon J. Puglisi
    An efficient, versatile approach to suffix sorting. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2007, v:12, n:, pp:- [Journal]

  8. Testing Stream Ciphers by Finding the Longest Substring of a Given Density. [Citation Graph (, )][DBLP]


  9. Permuted Longest-Common-Prefix Array. [Citation Graph (, )][DBLP]


  10. Reducing Space Requirements for Disk Resident Suffix Arrays. [Citation Graph (, )][DBLP]


  11. Document Compaction for Efficient Query Biased Snippet Generation. [Citation Graph (, )][DBLP]


  12. Medium-Space Algorithms for Inverse BWT. [Citation Graph (, )][DBLP]


  13. Top-k Ranked Document Search in General Text Databases. [Citation Graph (, )][DBLP]


  14. Space-Time Tradeoffs for Longest-Common-Prefix Array Computation. [Citation Graph (, )][DBLP]


  15. Improving suffix array locality for fast pattern matching on disk. [Citation Graph (, )][DBLP]


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


  17. Range Quantile Queries: Another Virtue of Wavelet Trees. [Citation Graph (, )][DBLP]


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


  19. RMIT University at TREC 2008: Relevance Feedback Track. [Citation Graph (, )][DBLP]


  20. RMIT University at the TREC 2007 Enterprise Track. [Citation Graph (, )][DBLP]


  21. SHREC: a short-read error correction method. [Citation Graph (, )][DBLP]


  22. A fast hybrid short read fragment assembly algorithm. [Citation Graph (, )][DBLP]


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