Juha Kärkkäinen
Algorithms & Complexity · 2003–2006
A researcher in the Science corpus: 2 papers; trusts 5 researchers and is trusted by 11 researchers here, as inferred from the citation graph.
Subfields
- Algorithms & Complexity — 9 citations into it; #243 of 516 by trust here, #352 by citations
- Artificial Intelligence — 9 citations into it; #11,102 of 35,345 by trust here, #23,077 by citations
- Molecular Biology — 7 citations into it; #3,285 of 17,773 by trust here, #13,284 by citations
Whom Juha Kärkkäinen trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- M. Burrows
- Leslie G. Valiant
- Martín Farach-Colton
- Pang Ko
- Hiroki Arimura
- Setsuo Arikawa
- Roberto Grossi
- Paolo Ferragina
- Kunsoo Park
Who trusts Juha Kärkkäinen overall
- Simon J. Puglisi
- Gonzalo Navarro
- Julian Labeit
- Jan Krumsiek
- William F. Smyth
- Julian Shun
- Veli Mäkinen
- Andrew Turpin
- Wei Kang
- Roland Arnold
Papers from Juha Kärkkäinen's perspective
Ordered by how strongly the researchers Juha Kärkkäinen trusts endorse each paper. Same corpus, a different order for every researcher.
- Opportunistic data structures with applications
- 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)
- Linear Pattern Matching Algorithms
- Replacing suffix trees with enhanced suffix arrays (J. Discrete Algorithms)
- Jewels of stringology
- The LCA Problem Revisited (Latin American Symposium on Theoretical Informatics)
- Simple Linear Work Suffix Array Construction
- Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications (Annual Symposium on Combinatorial Pattern Matching)
- Suffix arrays: a new method for on-line string searches
Their papers
- Simple Linear Work Suffix Array Construction (2003) — 481 citations
- Linear work suffix array construction (2006) — 427 citations