Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="K{\"a}rkk{\"a}inen, Juha"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Faster sparse suffix sorting
Tomohiro I
,
Juha Kärkkäinen
,
Dominik Kempa
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 386-396
String range matching
Juha Kärkkäinen
,
Dominik Kempa
,
Simon J. Puglisi
Lecture Notes in Computer Science
8486
, 2014, pp. 232-241
Versatile succinct representations of the bidirectional Burrows-Wheeler transform
Djamal Belazzougui
,
Fabio Cunial
,
Juha Kärkkäinen
,
Veli Mäkinen
Lecture Notes in Computer Science
8125
, 2013, pp. 133-144
A constant-space comparison-based algorithm for computing the Burrows-Wheeler transform
Maxime Crochemore
,
Roberto Grossi
,
Juha Kärkkäinen
,
Gad M. Landau
Lecture Notes in Computer Science
7922
, 2013, pp. 74-82
Colored range queries and document retrieval
Travis Gagie
,
Juha Kärkkäinen
,
Gonzalo Navarro
,
Simon J. Puglisi
Theoretical Computer Science
483
, 2013, pp. 36-50
Linear time Lempel-Ziv factorization: Simple, fast, small
Juha Kärkkäinen
,
Dominik Kempa
,
Simon J. Puglisi
Lecture Notes in Computer Science
7922
, 2013, pp. 189-200
An efficient linear pseudo-minimization algorithm for Aho-Corasick automata
Omar AitMous
,
Frédérique Bassino
,
Cyril Nicaud
Lecture Notes in Computer Science
7354
, 2012, pp. 110-123
Efficient exponential time algorithms for edit distance between unordered trees
Tatsuya Akutsu
,
Takeyuki Tamura
,
Daiji Fukagawa
,
Atsuhiro Takasu
Lecture Notes in Computer Science
7354
, 2012, pp. 360-372
Local exact pattern matching for non-fixed RNA structures
Mika Amit
,
Rolf Backofen
,
Steffen Heyne
,
Gad M. Landau
,
Mathias Möhl
,
Christina Schmiedl
,
Sebastian Will
Lecture Notes in Computer Science
7354
, 2012, pp. 306-320
Compressed string dictionary look-up with edit distance one
Djamal Belazzougui
,
Rossano Venturini
Lecture Notes in Computer Science
7354
, 2012, pp. 280-292
Time-space trade-offs for longest common extensions
Philip Bille
,
Inge Li Grtz
,
Benjamin Sach
,
Hjalte Wedel Vildhj
Lecture Notes in Computer Science
7354
, 2012, pp. 293-305
Hardness of longest common subsequence for sequences with bounded run-lengths
Guillaume Blin
,
Laurent Bulteau
,
Minghui Jiang
,
Pedro J. Tejada
,
Stéphane Vialette
Lecture Notes in Computer Science
7354
, 2012, pp. 138-148
Approximation algorithms and hardness results for shortest path based graph orientations
Dima Blokh
,
Danny Segev
,
Roded Sharan
Lecture Notes in Computer Science
7354
, 2012, pp. 70-82
On approximating string selection problems with outliers
Christina Boucher
,
Gad M. Landau
,
Avivit Levy
,
David Pritchard
,
Oren Weimann
Lecture Notes in Computer Science
7354
, 2012, pp. 427-438
Constant-time word-size string matching
Dany Breslauer
,
Leszek Ga̧sieniec
,
Roberto Grossi
Lecture Notes in Computer Science
7354
, 2012, pp. 83-96
Partitioning into colorful components by minimum edge deletions
Sharon Bruckner
,
Falk Hüffner
,
Christian Komusiewicz
,
Rolf Niedermeier
,
Sven Thiel
,
Johannes Uhlmann
Lecture Notes in Computer Science
7354
, 2012, pp. 56-69
The parameterized complexity of the shared center problem
Zhi-Zhong Chen
,
Lusheng Wang
,
Wenji Ma
Lecture Notes in Computer Science
7354
, 2012, pp. 439-452
Near linear time construction of an approximate index for all maximum consecutive sub-sums of a sequence
Ferdinando Cicalese
,
Eduardo Laber
,
Oren Weimann
,
Raphael Yuster
Lecture Notes in Computer Science
7354
, 2012, pp. 149-158
Pattern matching in multiple streams
Raphaël Clifford
,
Markus Jalsenius
,
Ely Porat
,
Benjamin Sach
Lecture Notes in Computer Science
7354
, 2012, pp. 97-109
The complexity of string partitioning
Anne Condon
,
Ján Man̑uch
,
Chris Thachuk
Lecture Notes in Computer Science
7354
, 2012, pp. 159-172
The maximum number of squares in a tree
Maxime Crochemore
,
Costas S. Iliopoulos
,
Tomasz Kociumaka
,
Marcin Kubica
,
Jakub Radoszewski
,
Wojciech Rytter
,
Wojciech Tyczyński
,
Tomasz Waleń
Lecture Notes in Computer Science
7354
, 2012, pp. 27-40
On the closest string via rank distance
Liviu P. Dinu
,
Alexandru Popa
Lecture Notes in Computer Science
7354
, 2012, pp. 413-426
Minimum leaf removal for reconciliation: Complexity and algorithms
Riccardo Dondi
,
Nadia El-Mabrouk
Lecture Notes in Computer Science
7354
, 2012, pp. 399-412
FEMTO: Fast search of large sequence collections
Michael P. Ferguson
Lecture Notes in Computer Science
7354
, 2012, pp. 208-219
Fixed-parameter algorithms for finding agreement supertrees
David Fernández-Baca
,
Sylvain Guillemot
,
Brad Shutters
,
Sudheer Vakati
Lecture Notes in Computer Science
7354
, 2012, pp. 373-384
Seiten 1
2
3
>