Juha Kärkkäinen

2008
29	EE	Juha Kärkkäinen, Tommi Rantala: Engineering Radix Sort for Strings. SPIRE 2008: 3-14
28	EE	Juha Kärkkäinen, Esko Ukkonen: Multidimensional String Matching. Encyclopedia of Algorithms 2008
27	EE	Juha Kärkkäinen: Suffix Array Construction. Encyclopedia of Algorithms 2008
26	EE	Roman Dementiev, Juha Kärkkäinen, Jens Mehnert, Peter Sanders: Better external memory suffix array construction. ACM Journal of Experimental Algorithmics 12: (2008)
2007
25	EE	Juha Kärkkäinen, Joong Chae Na: Faster Filters for Approximate String Matching. ALENEX 2007
24	EE	Juha Kärkkäinen: Fast BWT in small space by blockwise suffix sorting. Theor. Comput. Sci. 387(3): 249-257 (2007)
2006
23	EE	Juha Kärkkäinen, Peter Sanders, Stefan Burkhardt: Linear work suffix array construction. J. ACM 53(6): 918-936 (2006)
2005
22	EE	Roman Dementiev, Juha Kärkkäinen, Jens Mehnert, Peter Sanders: Better External Memory Suffix Array Construction. ALENEX/ANALCO 2005: 86-97
21		Juha Kärkkäinen: Alphabets in generic programming. Stringology 2005: 163-173
20	EE	Marc Fontaine, Stefan Burkhardt, Juha Kärkkäinen: Bdd-based analysis of gapped q-gram Filters. Int. J. Found. Comput. Sci. 16(6): 1121-1134 (2005)
2004
19	EE	Marc Fontaine, Stefan Burkhardt, Juha Kärkkäinen: BDD-Based Analysis of Gapped q-Gram Filters. Stringology 2004: 56-68
2003
18	EE	Stefan Burkhardt, Juha Kärkkäinen: Fast Lightweight Suffix Array Construction and Checking. CPM 2003: 55-69
17	EE	Juha Kärkkäinen, Peter Sanders: Simple Linear Work Suffix Array Construction. ICALP 2003: 943-955
16	EE	Stefan Burkhardt, Juha Kärkkäinen: Better Filtering with Gapped q-Grams. Fundam. Inform. 56(1-2): 51-70 (2003)
15	EE	Juha Kärkkäinen, Gonzalo Navarro, Esko Ukkonen: Approximate string matching on Ziv-Lempel compressed text. J. Discrete Algorithms 1(3-4): 313-338 (2003)
2002
14	EE	Juha Kärkkäinen, S. Srinivasa Rao: Full-Text Indexes in External Memory. Algorithms for Memory Hierarchies 2002: 149-170
13	EE	Stefan Burkhardt, Juha Kärkkäinen: One-Gapped q-Gram Filtersfor Levenshtein Distance. CPM 2002: 225-234
12	EE	Juha Kärkkäinen: Computing the Threshold for q-Gram Filters. SWAT 2002: 348-357
2001
11	EE	Stefan Burkhardt, Juha Kärkkäinen: Better Filtering with Gapped q-Grams. CPM 2001: 73-85
2000
10	EE	Juha Kärkkäinen, Gonzalo Navarro, Esko Ukkonen: Approximate String Matching over Ziv-Lempel Compressed Text. CPM 2000: 195-209
1999
9		Ykä Huhtala, Juha Kärkkäinen, Pasi Porkka, Hannu Toivonen: TANE: An Efficient Algorithm for Discovering Functional and Approximate Dependencies. Comput. J. 42(2): 100-111 (1999)
8		Juha Kärkkäinen, Esko Ukkonen: Two- and Higher-Dimensional Pattern Matching in Optimal Expected Time. SIAM J. Comput. 29(2): 571-589 (1999)
1998
7	EE	Ykä Huhtala, Juha Kärkkäinen, Pasi Porkka, Hannu Toivonen: Efficient Discovery of Functional and Approximate Dependencies Using Partitions. ICDE 1998: 392-401
6		Juha Kärkkäinen, Erkki Sutinen: Lempel-Ziv Index for q-Grams. Algorithmica 21(1): 137-154 (1998)
1997
5		Gautam Das, Rudolf Fleischer, Leszek Gasieniec, Dimitrios Gunopulos, Juha Kärkkäinen: Episode Matching. CPM 1997: 12-27
1996
4		Juha Kärkkäinen, Esko Ukkonen: Sparse Suffix Trees. COCOON 1996: 219-230
3		Juha Kärkkäinen, Erkki Sutinen: Lempel-Ziv Index for q-Grams. ESA 1996: 378-391
1995
2		Juha Kärkkäinen: Suffix Cactus: A Cross between Suffix Tree and Suffix Array. CPM 1995: 191-204
1994
1		Juha Kärkkäinen, Esko Ukkonen: Two and Higher Dimensional Pattern Matching in Optimal Expected Time. SODA 1994: 715-723

Coauthor Index

1	Stefan Burkhardt	[11] [13] [16] [18] [19] [20] [23]
2	Gautam Das	[5]
3	Roman Dementiev	[22] [26]
4	Rudolf Fleischer	[5]
5	Marc Fontaine	[19] [20]
6	Leszek Gasieniec	[5]
7	Dimitrios Gunopulos	[5]
8	Ykä Huhtala	[7] [9]
9	Jens Mehnert	[22] [26]
10	Joong Chae Na	[25]
11	Gonzalo Navarro	[10] [15]
12	Pasi Porkka	[7] [9]
13	Tommi Rantala	[29]
14	S. Srinivasa Rao (Srinivasa Rao Satti)	[14]
15	Peter Sanders	[17] [22] [23] [26]
16	Erkki Sutinen	[3] [6]
17	Hannu Toivonen	[7] [9]
18	Esko Ukkonen	[1] [4] [8] [10] [15] [28]

Colors in the list of coauthors