Johannes Fischer
Johannes Fischer
Подтвержден адрес электронной почты в домене cs.tu-dortmund.de - Главная страница
Название
Процитировано
Процитировано
Год
Space-efficient preprocessing schemes for range minimum queries on static arrays
J Fischer, V Heun
SIAM Journal on Computing 40 (2), 465-492, 2011
1912011
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
1772006
A new succinct representation of RMQ-information and improvements in the enhanced suffix array
J Fischer, V Heun
International Symposium on Combinatorics, Algorithms, Probabilistic and …, 2007
1642007
Faster entropy-bounded compressed suffix trees
J Fischer, V Mäkinen, G Navarro
Theoretical Computer Science 410 (51), 5354-5364, 2009
942009
Faster entropy-bounded compressed suffix trees
J Fischer, V Mäkinen, G Navarro
Theoretical Computer Science 410 (51), 5354-5364, 2009
942009
Optimal succinctness for range minimum queries
J Fischer
Latin American Symposium on Theoretical Informatics, 158-169, 2010
932010
Inducing the LCP-array
J Fischer
Workshop on Algorithms and Data Structures, 374-385, 2011
802011
CST++
E Ohlebusch, J Fischer, S Gog
String Processing and Information Retrieval, 322-333, 2010
712010
Inducing Suffix and LCP Arrays in External Memory.
T Bingmann, J Fischer, V Osipov
ALENEX, 88-102, 2013
602013
A 2-approximation algorithm for sorting by prefix reversals
J Fischer, SW Ginzinger
European Symposium on Algorithms, 415-425, 2005
492005
Wee LCP
J Fischer
Information Processing Letters 110 (8), 317-320, 2010
452010
Suffix arrays on words
P Ferragina, J Fischer
Annual Symposium on Combinatorial Pattern Matching, 328-339, 2007
442007
Optimal string mining under frequency constraints
J Fischer, V Heun, S Kramer
European Conference on Principles of Data Mining and Knowledge Discovery …, 2006
412006
Alphabet-dependent string searching with wexponential search trees
J Fischer, P Gawrychowski
Annual Symposium on Combinatorial Pattern Matching, 160-171, 2015
392015
Approximating LZ77 via small-space multiple-pattern matching
J Fischer, T Gagie, P Gawrychowski, T Kociumaka
Algorithms-ESA 2015, 533-544, 2015
352015
An (other) entropy-bounded compressed suffix tree
J Fischer, V Mäkinen, G Navarro
Annual Symposium on Combinatorial Pattern Matching, 152-165, 2008
342008
Combined data structure for previous-and next-smaller-values
J Fischer
Theoretical Computer Science 412 (22), 2451-2456, 2011
322011
Two-dimensional range minimum queries
A Amir, J Fischer, M Lewenstein
Annual Symposium on Combinatorial Pattern Matching, 286-294, 2007
322007
Space efficient string mining under frequency constraints
J Fischer, V Mäkinen, N Välimäki
2008 Eighth IEEE International Conference on Data Mining, 193-202, 2008
312008
Fast frequent string mining using suffix arrays
J Fischer, V Heun, S Kramer
Fifth IEEE International Conference on Data Mining (ICDM'05), 4 pp., 2005
282005
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20