Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Selma Gürler
Li Shufang
Claudia Calabrese
Hao Mao
Peter Malec
Giovanni Venturelli
Chen Ma
John Murphy
Radu Timofte
Kuanrui Yin
Home
/
Author
/
AYUMI SHINOHARA
Author Info
Open Visualization
Name
Affiliation
Papers
AYUMI SHINOHARA
Department of Informatics, PRESTO, Japan Science and Technology Agency, Kyushu University 33, Fukuoka, 812-8581 JAPAN
128
Collaborators
Citations
PageRank
153
936
88.28
Referers
Referees
References
942
854
1129
Search Limit
100
942
Publications (100 rows)
Collaborators (100 rows)
Referers (100 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
Computing the Parameterized Burrows–Wheeler Transform Online
0
0.34
2022
Parallel Algorithm for Pattern Matching Problems Under Substring Consistent Equivalence Relations.
0
0.34
2022
Parameterized DAWGs: Efficient constructions and bidirectional pattern searches
0
0.34
2022
Linear-Time Online Algorithm for Inferring the Shortest Path Graph from a Walk Label
0
0.34
2020
An Extension of Linear-size Suffix Tries for Parameterized Strings.
0
0.34
2020
In-Place Bijective Burrows-Wheeler Transforms.
0
0.34
2020
Computing Covers under Substring Consistent Equivalence Relations
0
0.34
2020
Detecting $k$-(Sub-)Cadences and Equidistant Subsequence Occurrences
0
0.34
2020
AOBA - An Online Benchmark Tool for Algorithms in Stringology.
0
0.34
2020
Grammar Compression with Probabilistic Context-Free Grammar
0
0.34
2020
DAWGs for parameterized matching: online construction and related indexing structures
0
0.34
2020
Efficient computation of longest single-arm-gapped palindromes in a string
0
0.34
2020
Query Learning Algorithm for Residual Symbolic Finite Automata.
0
0.34
2019
Linear-size Suffix Tries for Parameterized Strings.
0
0.34
2019
Permuted Pattern Matching Algorithms on Multi-Track Strings
0
0.34
2019
An Improvement of the Franek-Jennings-Smyth Pattern Matching Algorithm.
0
0.34
2019
Enumerating Cryptarithms Using Deterministic Finite Automata.
0
0.34
2018
Duel and sweep algorithm for order-preserving pattern matching.
0
0.34
2018
Linear-Time Online Algorithm Inferring the Shortest Path from a Walk.
0
0.34
2018
New Variants of Pattern Matching with Constants and Variables.
0
0.34
2018
Computing longest single-arm-gapped palindromes in a string.
1
0.41
2017
Position Heaps for Parameterized Strings.
1
0.38
2017
Efficient Dynamic Dictionary Matching with DAWGs and AC-automata.
0
0.34
2017
An efficient query learning algorithm for zero-suppressed binary decision diagrams.
0
0.34
2017
Generalization Of Efficient Implementation Of Compression By Substring Enumeration
0
0.34
2016
AC-Automaton Update Algorithm for Semi-dynamic Dictionary Matching.
1
0.36
2016
Compact bit encoding schemes for simply-typed lambda-terms.
0
0.34
2016
QBF Encoding of Generalized Tic-Tac-Toe.
0
0.34
2016
KMP Based Pattern Matching Algorithms for Multi-Track Strings.
0
0.34
2016
A Simple Classification Method for Class Imbalanced Data using the Kernel Mean
0
0.34
2014
Efficient Algorithm and Coding for Higher-Order Compression.
0
0.34
2014
Reducing Sample Complexity in Reinforcement Learning by Transferring Transition and Reward Probabilities.
0
0.34
2014
Average number of occurrences of repetitions in a necklace.
0
0.34
2014
Bounded Occurrence Edit Distance: A New Metric for String Similarity Joins with Edit Distance Constraints.
0
0.34
2014
Permuted Pattern Matching on Multi-track Strings.
2
0.48
2013
Detecting regularities on grammar-compressed strings.
3
0.39
2013
Computing maximum number of runs in strings
0
0.34
2012
Functional programs as compressed data
6
0.73
2012
An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Program.
0
0.34
2010
Average Number Of Runs And Squares In Necklace
2
0.38
2010
The Number Of Runs In A Ternary Word
3
0.41
2010
Inferring Strings From Runs
5
0.44
2010
Complexity of Teaching by a Restricted Number of Examples
10
0.87
2009
A Series of Run-Rich Strings
8
0.72
2009
Average Value Of Sum Of Exponents Of Runs In A String
2
0.38
2009
Development Of An Interactive Augmented Environment And Its Application To Autonomous Learning For Quadruped Robots
1
0.36
2009
Efficient algorithms to compute compressed longest common substrings and compressed palindromes
15
0.67
2009
Linear-Time Text Compression By Longest-First Substitution
7
0.62
2009
Bit-Parallel Algorithms For Computing All The Runs In A String
3
0.43
2009
Development of an Augmented Environment and Autonomous Learning for Quadruped Robots
0
0.34
2008
1
2
50 / page
