Setsuo Arikawa
Annual Symposium on Combinatorial Pattern Matching · 1999–2001
A researcher in the Science corpus: 2 papers; trusts 1 researcher and is trusted by 3 researchers here, as inferred from the citation graph.
Whom Setsuo Arikawa trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Setsuo Arikawa overall
Papers from Setsuo Arikawa's perspective
Ordered by how strongly the researchers Setsuo Arikawa trusts endorse each paper. Same corpus, a different order for every researcher.
- Suffix arrays: a new method for on-line string searches
- Opportunistic data structures with applications
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract) (Symposium on the Theory of Computing)
- A Block-sorting Lossless Data Compression Algorithm
- Linear Pattern Matching Algorithms
- A new algorithm for data compression
- Efficient Randomized Pattern-Matching Algorithms
- Succinct indexable dictionaries with applications to encoding k-ary trees and multisets (ACM-SIAM Symposium on Discrete Algorithms)
- A scalable content-addressable network (Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication)
- Chord: A scalable peer-to-peer lookup service for internet applications (Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication)