2009 |
17 | EE | Alistair Moffat,
Simon J. Puglisi,
Ranjan Sinha:
Reducing Space Requirements for Disk Resident Suffix Arrays.
DASFAA 2009: 730-744 |
16 | EE | Yohannes Tsegay,
Simon J. Puglisi,
Andrew Turpin,
Justin Zobel:
Document Compaction for Efficient Query Biased Snippet Generation.
ECIR 2009: 509-520 |
2008 |
15 | EE | Simon J. Puglisi,
Andrew Turpin:
Space-Time Tradeoffs for Longest-Common-Prefix Array Computation.
ISAAC 2008: 124-135 |
14 | EE | Ranjan Sinha,
Simon J. Puglisi,
Alistair Moffat,
Andrew Turpin:
Improving suffix array locality for fast pattern matching on disk.
SIGMOD Conference 2008: 661-672 |
13 | EE | Yohannes Tsegay,
Falk Scholer,
Simon J. Puglisi:
RMIT University at TREC 2008: Relevance Feedback Track.
TREC 2008 |
12 | EE | Gang Chen,
Simon J. Puglisi,
William F. Smyth:
Lempel-Ziv Factorization Using Less Time & Space.
Mathematics in Computer Science 1(4): 605-623 (2008) |
11 | EE | Simon J. Puglisi,
Jamie Simpson,
William F. Smyth:
How many runs can a string contain?
Theor. Comput. Sci. 401(1-3): 165-171 (2008) |
2007 |
10 | EE | Gang Chen,
Simon J. Puglisi,
William F. Smyth:
Fast and Practical Algorithms for Computing All the Runs in a String.
CPM 2007: 307-315 |
9 | EE | Hamid Abdul Basit,
Simon J. Puglisi,
William F. Smyth,
Andrew Turpin,
Stan Jarzabek:
Efficient token based clone detection with flexible tokenization.
ESEC/SIGSOFT FSE (Companion) 2007: 513-516 |
8 | EE | Mingfang Wu,
Falk Scholer,
Milad Shokouhi,
Simon J. Puglisi,
Halil Ali:
RMIT University at the TREC 2007 Enterprise Track.
TREC 2007 |
7 | EE | Simon J. Puglisi,
William F. Smyth,
Andrew Turpin:
A taxonomy of suffix array construction algorithms.
ACM Comput. Surv. 39(2): (2007) |
6 | EE | Michael A. Maniscalco,
Simon J. Puglisi:
An efficient, versatile approach to suffix sorting.
ACM Journal of Experimental Algorithmics 12: (2007) |
2006 |
5 | EE | Simon J. Puglisi,
William F. Smyth,
Andrew Turpin:
Suffix arrays: what are they good for?
ADC 2006: 17-18 |
4 | EE | Simon J. Puglisi,
William F. Smyth,
Andrew Turpin:
Inverted Files Versus Suffix Arrays for Locating Patterns in Primary Memory.
SPIRE 2006: 122-133 |
3 | EE | Kangmin Fan,
Simon J. Puglisi,
William F. Smyth,
Andrew Turpin:
A New Periodicity Lemma.
SIAM J. Discrete Math. 20(3): 656-668 (2006) |
2005 |
2 | EE | Simon J. Puglisi,
William F. Smyth,
Andrew Turpin:
The Performance of Linear Time Suffix Sorting Algorithms.
DCC 2005: 358-367 |
1 | | Simon J. Puglisi,
William F. Smyth,
Andrew Turpin:
A taxonomy of suffix array construction algorithms.
Stringology 2005: 1-30 |