Thomas Arts
Theoretical Computer Science · 2000
A researcher in the Science corpus: 1 paper; trusts 1 researcher and is trusted by 1 researcher here, as inferred from the citation graph.
Whom Thomas Arts trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Thomas Arts overall
Papers from Thomas Arts's perspective
Ordered by how strongly the researchers Thomas Arts trusts endorse each paper. Same corpus, a different order for every researcher.
- Term Rewriting Systems
- Suffix arrays: a new method for on-line string searches
- REPuter: the manifold applications of repeat analysis on a genomic scale. (Nucleic Acids Research)
- Opportunistic data structures with applications
- Space efficient linear time construction of suffix arrays
- A universal algorithm for sequential data compression
- The LCA Problem Revisited (Latin American Symposium on Theoretical Informatics)
- Simple Linear Work Suffix Array Construction
- A Block-sorting Lossless Data Compression Algorithm
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract) (Symposium on the Theory of Computing)
Their papers
- Termination of term rewriting using dependency pairs (2000) — 647 citations