Kunsoo Park
Annual Symposium on Combinatorial Pattern Matching · 2001–2013
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 Kunsoo Park trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Kunsoo Park overall
Papers from Kunsoo Park's perspective
Ordered by how strongly the researchers Kunsoo Park trusts endorse each paper. Same corpus, a different order for every researcher.
- Protocols for secure computations
- Efficient Private Matching and Set Intersection
- Threshold Cryptosystems
- Limiting privacy breaches in privacy preserving data mining
- Suffix arrays: a new method for on-line string searches
- A computational introduction to number theory and algebra
- 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)
- Privacy-preserving distributed mining of association rules on horizontally partitioned data
- Privacy-Preserving Set Operations
Their papers
- Constant-Round Privacy Preserving Multiset Union (2013) — 23 citations
- Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications (2001) — 526 citations