William F. Smyth

Artificial Intelligence · 2003–2007

A researcher in the Science corpus: 2 papers; trusts 9 researchers and is trusted by 7 researchers here, as inferred from the citation graph.

Subfields

• Artificial Intelligence — 7 citations into it; #17,380 of 35,345 by trust here, #27,551 by citations
• Molecular Biology — 6 citations into it; #6,297 of 17,773 by trust here, #15,203 by citations

Whom William F. Smyth trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Juha Kärkkäinen
2. Roberto Grossi
3. Gonzalo Navarro
4. Peter Sanders
5. Mohamed Ibrahim Abouelhoda
6. M. Burrows

Who trusts William F. Smyth overall

1. Steven S. Skiena
2. Eric Sadit Tellez
3. Julian Labeit

Papers from William F. Smyth's perspective

Ordered by how strongly the researchers William F. Smyth trusts endorse each paper. Same corpus, a different order for every researcher.

1. A Block-sorting Lossless Data Compression Algorithm
2. Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract) (Symposium on the Theory of Computing)
3. Simple Linear Work Suffix Array Construction
4. Replacing suffix trees with enhanced suffix arrays (J. Discrete Algorithms)
5. Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications (Annual Symposium on Combinatorial Pattern Matching)
6. Compressed full-text indexes (CSUR)
7. Linear work suffix array construction
8. Opportunistic data structures with applications
9. Linear Pattern Matching Algorithms
10. The LCA Problem Revisited (Latin American Symposium on Theoretical Informatics)

Their papers

• A taxonomy of suffix array construction algorithms (2007) — 347 citations
• The maximum number of of runs in a string (2003) — 52 citations