Juha Kärkkäinen

	2012
41		Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi: Slashing the Time for BWT Inversion. DCC 2012: 99-108
40		Travis Gagie, Pawel Gawrychowski, Juha Kärkkäinen, Yakov Nekrich, Simon J. Puglisi: A Faster Grammar-Based Self-index. LATA 2012: 240-251
39		Travis Gagie, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen, Leena Salmela, Jorma Tarhio: Indexed Multi-pattern Matching. LATIN 2012: 399-407
	2011
38		Juha Kärkkäinen, Simon J. Puglisi: Cache Friendly Burrows-Wheeler Inversion. CCP 2011: 38-42
37		Travis Gagie, Juha Kärkkäinen: Counting Colours in Compressed Strings. CPM 2011: 197-207
36		Juha Kärkkäinen, Simon J. Puglisi: Fixed Block Compression Boosting in FM-Indexes. SPIRE 2011: 174-184
35		Juha Kärkkäinen, Simon J. Puglisi: Fixed Block Compression Boosting in FM-Indexes CoRR abs/1104.3810: (2011)
34		Travis Gagie, Juha Kärkkäinen, Yakov Nekrich, Simon J. Puglisi: A Compressed Self-Index for Genomic Databases CoRR abs/1111.1355: (2011)
	2010
33		Juha Kärkkäinen, Simon J. Puglisi: Medium-Space Algorithms for Inverse BWT. ESA (1) 2010: 451-462
32		Travis Gagie, Juha Kärkkäinen: Counting Colours in Compressed Strings CoRR abs/1011.3480: (2010)
31		Travis Gagie, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen, Leena Salmela: Pattern Kits CoRR abs/1011.3491: (2010)
	2009
30		Juha Kärkkäinen, Giovanni Manzini, Simon J. Puglisi: Permuted Longest-Common-Prefix Array. CPM 2009: 181-192
	2008
29		Juha Kärkkäinen, Tommi Rantala: Engineering Radix Sort for Strings. SPIRE 2008: 3-14
28		Juha Kärkkäinen, Esko Ukkonen: Multidimensional String Matching. Encyclopedia of Algorithms 2008
27		Juha Kärkkäinen: Suffix Array Construction. Encyclopedia of Algorithms 2008
26		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		Juha Kärkkäinen, Joong Chae Na: Faster Filters for Approximate String Matching. ALENEX 2007
24		Juha Kärkkäinen: Fast BWT in small space by blockwise suffix sorting. Theor. Comput. Sci. 387(3): 249-257 (2007)
	2006
23		Juha Kärkkäinen, Peter Sanders, Stefan Burkhardt: Linear work suffix array construction. J. ACM 53(6): 918-936 (2006)
	2005
22		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		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		Marc Fontaine, Stefan Burkhardt, Juha Kärkkäinen: BDD-Based Analysis of Gapped q-Gram Filters. Stringology 2004: 56-68
	2003
18		Stefan Burkhardt, Juha Kärkkäinen: Fast Lightweight Suffix Array Construction and Checking. CPM 2003: 55-69
17		Juha Kärkkäinen, Peter Sanders: Simple Linear Work Suffix Array Construction. ICALP 2003: 943-955
16		Stefan Burkhardt, Juha Kärkkäinen: Better Filtering with Gapped q-Grams. Fundam. Inform. 56(1-2): 51-70 (2003)
15		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		Juha Kärkkäinen, S. Srinivasa Rao: Full-Text Indexes in External Memory. Algorithms for Memory Hierarchies 2002: 149-170
13		Stefan Burkhardt, Juha Kärkkäinen: One-Gapped q-Gram Filtersfor Levenshtein Distance. CPM 2002: 225-234
12		Juha Kärkkäinen: Computing the Threshold for q-Gram Filters. SWAT 2002: 348-357
	2001
11		Stefan Burkhardt, Juha Kärkkäinen: Better Filtering with Gapped q-Grams. CPM 2001: 73-85
	2000
10		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		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	Travis Gagie	[31] [32] [34] [37] [39] [40]
7	Leszek Gasieniec	[5]
8	Pawel Gawrychowski	[40]
9	Dimitrios Gunopulos	[5]
10	Ykä Huhtala	[7] [9]
11	Kalle Karhu	[31] [39]
12	Dominik Kempa	[41]
13	Veli Mäkinen	[31] [39]
14	Giovanni Manzini	[30]
15	Jens Mehnert	[22] [26]
16	Joong Chae Na	[25]
17	Gonzalo Navarro	[10] [15]
18	Yakov Nekrich	[34] [40]
19	Pasi Porkka	[7] [9]
20	Simon J. Puglisi	[30] [33] [34] [35] [36] [38] [40] [41]
21	Tommi Rantala	[29]
22	S. Srinivasa Rao (Srinivasa Rao Satti)	[14]
23	Leena Salmela	[31] [39]
24	Peter Sanders	[17] [22] [23] [26]
25	Erkki Sutinen	[3] [6]
26	Jorma Tarhio	[39]
27	Hannu Toivonen	[7] [9]
28	Esko Ukkonen	[1] [4] [8] [10] [15] [28]

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page