Johannes Fischer
Johannes Fischer
Dirección de correo verificada de cs.tu-dortmund.de - Página principal
TítuloCitado porAño
Theoretical and practical improvements on the RMQ-problem, with applications to LCA and LCE
J Fischer, V Heun
Annual Symposium on Combinatorial Pattern Matching, 36-48, 2006
1602006
Space-efficient preprocessing schemes for range minimum queries on static arrays
J Fischer, V Heun
SIAM Journal on Computing 40 (2), 465-492, 2011
1552011
A new succinct representation of RMQ-information and improvements in the enhanced suffix array
J Fischer, V Heun
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, 459-470, 2007
1552007
Faster entropy-bounded compressed suffix trees
J Fischer, V Mäkinen, G Navarro
Theoretical Computer Science 410 (51), 5354-5364, 2009
116*2009
Optimal succinctness for range minimum queries
J Fischer
Latin American Symposium on Theoretical Informatics, 158-169, 2010
882010
Inducing the LCP-array
J Fischer
Workshop on Algorithms and Data Structures, 374-385, 2011
672011
CST++
E Ohlebusch, J Fischer, S Gog
String Processing and Information Retrieval, 322-333, 2010
662010
Inducing Suffix and LCP Arrays in External Memory.
T Bingmann, J Fischer, V Osipov
ALENEX, 88-102, 2013
492013
Wee LCP
J Fischer
Information Processing Letters 110 (8), 317-320, 2010
462010
A 2-approximation algorithm for sorting by prefix reversals
J Fischer, SW Ginzinger
European Symposium on Algorithms, 415-425, 2005
462005
Suffix arrays on words
P Ferragina, J Fischer
Annual Symposium on Combinatorial Pattern Matching, 328-339, 2007
402007
Optimal string mining under frequency constraints
J Fischer, V Heun, S Kramer
European Conference on Principles of Data Mining and Knowledge Discovery …, 2006
332006
Two-dimensional range minimum queries
A Amir, J Fischer, M Lewenstein
Annual Symposium on Combinatorial Pattern Matching, 286-294, 2007
302007
Alphabet-dependent string searching with wexponential search trees
J Fischer, P Gawrychowski
Annual Symposium on Combinatorial Pattern Matching, 160-171, 2015
282015
Combined data structure for previous-and next-smaller-values
J Fischer
arXiv preprint arXiv:1102.0395, 2011
282011
Fast frequent string mining using suffix arrays
J Fischer, V Heun, S Kramer
Data Mining, Fifth IEEE International Conference on, 4 pp., 2005
272005
Approximating LZ77 via small-space multiple-pattern matching
J Fischer, T Gagie, P Gawrychowski, T Kociumaka
Algorithms-ESA 2015, 533-544, 2015
262015
Space efficient string mining under frequency constraints
J Fischer, V Mäkinen, N Välimäki
Data Mining, 2008. ICDM'08. Eighth IEEE International Conference on, 193-202, 2008
262008
Practical entropy-bounded schemes for O (1)-range minimum queries
J Fischer, V Heun, HM Stiihler
Data Compression Conference, 2008. DCC 2008, 272-281, 2008
262008
Forbidden patterns
J Fischer, T Gagie, T Kopelowitz, M Lewenstein, V Mäkinen, L Salmela, ...
Latin American Symposium on Theoretical Informatics, 327-337, 2012
252012
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20