Kazuyuki Narisawa

According to our database1, Kazuyuki Narisawa authored at least 22 papers between 2007 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Efficient computation of longest single-arm-gapped palindromes in a string.
Theor. Comput. Sci., 2020

2019
Permuted Pattern Matching Algorithms on Multi-Track Strings.
Algorithms, 2019

2017
Efficient Computation of Substring Equivalence Classes with Suffix Arrays.
Algorithmica, 2017

Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings.
Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

Computing Longest Single-arm-gapped Palindromes in a String.
Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

Position Heaps for Parameterized Strings.
Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

2016
A Fast Order-Preserving Matching with q-neighborhood Filtration Using SIMD Instructions.
Proceedings of Student Research Forum Papers and Posters at SOFSEM 2016 co-located with 42nd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2016), 2016

KMP Based Pattern Matching Algorithms for Multi-Track Strings.
Proceedings of Student Research Forum Papers and Posters at SOFSEM 2016 co-located with 42nd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2016), 2016

Generalization of Efficient Implementation of Compression by Substring Enumeration.
Proceedings of the 2016 Data Compression Conference, 2016

2015
Dynamic edit distance table under a general weighted cost function.
J. Discrete Algorithms, 2015

Detecting regularities on grammar-compressed strings.
Inf. Comput., 2015

Position Heaps for Permuted Pattern Matching on Multi-Track String.
Proceedings of Student Research Forum Papers and Posters at SOFSEM 2015, 2015

2014
Bounded Occurrence Edit Distance: A New Metric for String Similarity Joins with Edit Distance Constraints.
Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

Reducing Sample Complexity in Reinforcement Learning by Transferring Transition and Reward Probabilities.
Proceedings of the ICAART 2014, 2014

A Simple Classification Method for Class Imbalanced Data using the Kernel Mean.
Proceedings of the KDIR 2014 - Proceedings of the International Conference on Knowledge Discovery and Information Retrieval, Rome, Italy, 21, 2014

2013
On Morphisms Generating Run-Rich Strings.
Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, 2013

Permuted Pattern Matching on Multi-track Strings.
Proceedings of the SOFSEM 2013: Theory and Practice of Computer Science, 2013

2012
Computing Maximum Number of Runs in Strings.
Proceedings of the String Processing and Information Retrieval, 2012

Prediction for Control Delay on Reinforcement Learning.
Proceedings of the ICAART 2012 - Proceedings of the 4th International Conference on Agents and Artificial Intelligence, Volume 1, 2012

2008
String Kernels Based on Variable-Length-Don't-Care Patterns.
Proceedings of the Discovery Science, 11th International Conference, 2008

2007
Unsupervised Spam Detection Based on String Alienness Measures.
Proceedings of the Discovery Science, 10th International Conference, 2007

Efficient Computation of Substring Equivalence Classes with Suffix Arrays.
Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007


  Loading...