Simon J. Puglisi

	2009
22		Serdar Boztas, Simon J. Puglisi, Andrew Turpin: Testing Stream Ciphers by Finding the Longest Substring of a Given Density. ACISP 2009: 122-133
21		Juha Kärkkäinen, Giovanni Manzini, Simon J. Puglisi: Permuted Longest-Common-Prefix Array. CPM 2009: 181-192
20		Alistair Moffat, Simon J. Puglisi, Ranjan Sinha: Reducing Space Requirements for Disk Resident Suffix Arrays. DASFAA 2009: 730-744
19		Yohannes Tsegay, Simon J. Puglisi, Andrew Turpin, Justin Zobel: Document Compaction for Efficient Query Biased Snippet Generation. ECIR 2009: 509-520
18		Travis Gagie, Simon J. Puglisi, Andrew Turpin: Range Quantile Queries: Another Virtue of Wavelet Trees. SPIRE 2009: 1-6
17		Jan Schröder, Heiko Schröder, Simon J. Puglisi, Ranjan Sinha, Bertil Schmidt: SHREC: a short-read error correction method. Bioinformatics 25(17): 2157-2163 (2009)
16		Bertil Schmidt, Ranjan Sinha, Bryan Beresford-Smith, Simon J. Puglisi: A fast hybrid short read fragment assembly algorithm. Bioinformatics 25(17): 2279-2280 (2009)
	2008
15		Simon J. Puglisi, Andrew Turpin: Space-Time Tradeoffs for Longest-Common-Prefix Array Computation. ISAAC 2008: 124-135
14		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		Yohannes Tsegay, Falk Scholer, Simon J. Puglisi: RMIT University at TREC 2008: Relevance Feedback Track. TREC 2008
12		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		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		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		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		Mingfang Wu, Falk Scholer, Milad Shokouhi, Simon J. Puglisi, Halil Ali: RMIT University at the TREC 2007 Enterprise Track. TREC 2007
7		Simon J. Puglisi, William F. Smyth, Andrew Turpin: A taxonomy of suffix array construction algorithms. ACM Comput. Surv. 39(2): (2007)
6		Michael A. Maniscalco, Simon J. Puglisi: An efficient, versatile approach to suffix sorting. ACM Journal of Experimental Algorithmics 12: (2007)
	2006
5		Simon J. Puglisi, William F. Smyth, Andrew Turpin: Suffix arrays: what are they good for? ADC 2006: 17-18
4		Simon J. Puglisi, William F. Smyth, Andrew Turpin: Inverted Files Versus Suffix Arrays for Locating Patterns in Primary Memory. SPIRE 2006: 122-133
3		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		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

Coauthor Index

1	Halil Ali	[8]
2	Hamid Abdul Basit	[9]
3	Bryan Beresford-Smith	[16]
4	Serdar Boztas	[22]
5	Gang Chen	[10] [12]
6	Kangmin Fan	[3]
7	Travis Gagie	[18]
8	Stan Jarzabek (Stanislaw Jarzabek)	[9]
9	Juha Kärkkäinen	[21]
10	Michael A. Maniscalco	[6]
11	Giovanni Manzini	[21]
12	Alistair Moffat	[14] [20]
13	Bertil Schmidt	[16] [17]
14	Falk Scholer	[8] [13]
15	Heiko Schröder	[17]
16	Jan Schröder	[17]
17	Milad Shokouhi	[8]
18	Jamie Simpson	[11]
19	Ranjan Sinha	[14] [16] [17] [20]
20	William F. Smyth (Bill Smyth)	[1] [2] [3] [4] [5] [7] [9] [10] [11] [12]
21	Yohannes Tsegay	[13] [19]
22	Andrew Turpin	[1] [2] [3] [4] [5] [7] [9] [14] [15] [18] [19] [22]
23	Mingfang Wu	[8]
24	Justin Zobel	[19]

Colors in the list of coauthors