Ayumi Shinohara

According to our database1, Ayumi Shinohara authored at least 129 papers between 1990 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
Parallel Duel-and-Sweep Algorithm for the Order-Preserving Pattern Matching.
Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

2019

Efficient dynamic dictionary matching with DAWGs and AC-automata.
Theor. Comput. Sci., 2019

Query Learning Algorithm for Residual Symbolic Finite Automata.
Proceedings of the Proceedings Tenth International Symposium on Games, 2019

Linear-size Suffix Tries for Parameterized Strings.
CoRR, 2019

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

An Improvement of the Franek-Jennings-Smyth Pattern Matching Algorithm.
Proceedings of the Prague Stringology Conference 2019, 2019

Development of a Lightweight Cyber-enhanced Rescue Canine Suit with Heat Protection and Anti-slip Countermeasures.
Proceedings of the IEEE International Symposium on Safety, Security, and Rescue Robotics, 2019

2018
Renewal of the Major Fields from New Generation Computing Vol. 36 (2018).
New Generation Comput., 2018

Enumerating Cryptarithms Using Deterministic Finite Automata.
CoRR, 2018

Enumeration of Cryptarithms Using Deterministic Finite Automata.
Proceedings of the Implementation and Application of Automata, 2018

Linear-Time Online Algorithm Inferring the Shortest Path from a Walk.
Proceedings of the String Processing and Information Retrieval, 2018

Duel and Sweep Algorithm for Order-Preserving Pattern Matching.
Proceedings of the SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29, 2018

New Variants of Pattern Matching with Constants and Variables.
Proceedings of the SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29, 2018

2017
Duel and sweep algorithm for order-preserving pattern matching.
CoRR, 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

An efficient query learning algorithm for zero-suppressed binary decision diagrams.
Proceedings of the International Conference on Algorithmic Learning Theory, 2017

2016
Pattern Matching on Compressed Text.
Encyclopedia of Algorithms, 2016

Fast Full Permuted Pattern Matching Algorithms on Multi-track Strings.
Proceedings of the Prague Stringology Conference 2016, 2016

AC-Automaton Update Algorithm for Semi-dynamic Dictionary Matching.
Proceedings of the String Processing and Information Retrieval, 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

QBF Encoding of Generalized Tic-Tac-Toe.
Proceedings of the 4th International Workshop on Quantified Boolean Formulas (QBF 2016) co-located with 19th International Conference on Theory and Applications of Satisfiability Testing (SAT 2016), 2016

Visualization and Analysis of Electrical Energy Consumption in Laboratories.
Proceedings of the 5th IIAI International Congress on Advanced Applied Informatics, 2016

Compact bit encoding schemes for simply-typed lambda-terms.
Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, 2016

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

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
Average number of occurrences of repetitions in a necklace.
Discrete Applied Mathematics, 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

Efficient Algorithm and Coding for Higher-Order Compression.
Proceedings of the Data Compression Conference, 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
Functional programs as compressed data.
Higher-Order and Symbolic Computation, 2012

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

Functional programs as compressed data.
Proceedings of the ACM SIGPLAN 2012 Workshop on Partial Evaluation and Program Manipulation, 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

2010
An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Programs.
Chicago J. Theor. Comput. Sci., 2010

Inferring Strings from Runs.
Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30, 2010

Average Number of Runs and Squares in Necklace.
Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30, 2010

The Number of Runs in a Ternary Word.
Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30, 2010

Multi-target adaptive A.
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

2009
Efficient algorithms to compute compressed longest common substrings and compressed palindromes.
Theor. Comput. Sci., 2009

Average Value of Sum of Exponents of Runs in a String.
Int. J. Found. Comput. Sci., 2009

Development of an Interactive Augmented Environment and Its Application to Autonomous Learning for Quadruped Robots.
IEICE Transactions, 2009

Linear-Time Text Compression by Longest-First Substitution.
Algorithms, 2009

Bit-parallel Algorithms for Computing all the Runs in a String.
Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31, 2009

A Series of Run-Rich Strings.
Proceedings of the Language and Automata Theory and Applications, 2009

Complexity of Teaching by a Restricted Number of Examples.
Proceedings of the COLT 2009, 2009

Testing Square-Freeness of Strings Compressed by Balanced Straight Line Program.
Proceedings of the Theory of Computing 2009, 2009

Improvement of the performance using received message on learning of communication codes.
Proceedings of the 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), 2009

2008
New Lower Bounds for the Maximum Number of Runs in a String.
Proceedings of the Prague Stringology Conference 2008, Prague, Czech Republic, 2008

Average Value of Sum of Exponents of Runs in Strings.
Proceedings of the Prague Stringology Conference 2008, Prague, Czech Republic, 2008

Computing Longest Common Substring and All Palindromes from Compressed Strings.
Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008

Development of an Augmented Environment and Autonomous Learning for Quadruped Robots.
Proceedings of the RoboCup 2008: Robot Soccer World Cup XII [papers from the 12th annual RoboCup International Symposium, 2008

An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Program.
Proceedings of the Structure-Based Compression of Complex Massive Data, 22.06., 2008

2007
Reducing Trials by Thinning-Out in Skill Discovery.
Proceedings of the Discovery Science, 10th International Conference, 2007

2006
Autonomous Learning of Ball Trapping in the Four-Legged Robot League.
Proceedings of the RoboCup 2006: Robot Soccer World Cup X, 2006

A Framework for Advanced Robot Programming in the RoboCup Domain - Using Plug-in System and Scripting Language.
Proceedings of the Intelligent Autonomous Systems 9, 2006

Ball tracking with velocity based on Monte-Carlo localization.
Proceedings of the Intelligent Autonomous Systems 9, 2006

2005
The size of subsequence automaton.
Theor. Comput. Sci., 2005

A fully compressed pattern matching algorithm for simple collage systems.
Int. J. Found. Comput. Sci., 2005

On-line construction of compact directed acyclic word graphs.
Discrete Applied Mathematics, 2005

New Bit-Parallel Indel-Distance Algorithm.
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

Fast Bit-Vector Algorithms for Approximate String Matching Under Indel Distance.
Proceedings of the SOFSEM 2005: Theory and Practice of Computer Science, 2005

Fully Incremental LCS Computation.
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2004
Ternary directed acyclic word graphs.
Theor. Comput. Sci., 2004

An O(N2) Algorithm for Discovering Optimal Boolean Pattern Pairs.
IEEE/ACM Trans. Comput. Biology Bioinform., 2004

Compact directed acyclic word graphs for a sliding window.
J. Discrete Algorithms, 2004

Efficiently Finding Regulatory Elements Using Correlation with Gene Expression.
J. Bioinformatics and Computational Biology, 2004

Finding Optimal Pairs of Patterns.
Proceedings of the Algorithms in Bioinformatics, 4th International Workshop, 2004

An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars.
Proceedings of the Developments in Language Theory, 2004

Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance.
Proceedings of the Discovery Science, 7th International Conference, 2004

String Pattern Discovery.
Proceedings of the Algorithmic Learning Theory, 15th International Conference, 2004

On Bit-Parallel Processing of Multi-byte Text.
Proceedings of the Information Retrieval Technology, Asia Information Retrieval Symposium, 2004

2003
Collage system: a unifying framework for compressed pattern matching.
Theor. Comput. Sci., 2003

A practical algorithm to find the best subsequence patterns.
Theor. Comput. Sci., 2003

Uniform characterizations of polynomial-query learnabilities.
Theor. Comput. Sci., 2003

A Note on Randomized Algorithm for String Matching with Mismatches.
Nord. J. Comput., 2003

Linear-Time Off-Line Text Compression by Longest-First Substitution.
Proceedings of the String Processing and Information Retrieval, 2003

Inferring Strings from Graphs and Arrays.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

On the Length of the Minimum Solution of Word Equations in One Variable.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Discovering Most Classificatory Patterns for Very Expressive Pattern Classes.
Proceedings of the Discovery Science, 6th International Conference, 2003

2002
Processing Text Files as Is: Pattern Matching over Compressed Texts, Multi-byte Character Texts, and Semi-structured Texts.
Proceedings of the String Processing and Information Retrieval, 2002

Space-Economical Construction of Index Structures for All Suffixes of a String.
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

Finding Best Patterns Practically.
Proceedings of the Progress in Discovery Science, 2002

Discovering Best Variable-Length-Don't-Care Patterns.
Proceedings of the Discovery Science, 5th International Conference, 2002

The Minimum DAWG for All Suffixes of a String and Its Applications.
Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

2001
Construction of the CDAWG for a Trie.
Proceedings of the Prague Stringology Conference 2001, Prague, Czech Republic, 2001

Musical Sequence Comparison for Melodic and Rhythmic Similarities.
Proceedings of the Eighth International Symposium on String Processing and Information Retrieval, 2001

On-Line Construction of Symmetric Compact Directed Acyclic Word Graphs.
Proceedings of the Eighth International Symposium on String Processing and Information Retrieval, 2001

Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Discovering Repetitive Expressions and Affinities from Anthologies of Classical Japanese Poems.
Proceedings of the Discovery Science, 4th International Conference, DS 2001, Washington, 2001

A Practical Algorithm to Find the Best Episode Patterns.
Proceedings of the Discovery Science, 4th International Conference, DS 2001, Washington, 2001

Faster Approximate String Matching over Compressed Text.
Proceedings of the Data Compression Conference, 2001

Compressed Pattern Matching for SEQUITUR.
Proceedings of the Data Compression Conference, 2001

Multiple Pattern Matching Algorithms on Collage System.
Proceedings of the Combinatorial Pattern Matching, 12th Annual Symposium, 2001

2000
Polynomial-time Learning of Elementary Formal Systems.
New Generation Comput., 2000

Bit-Parallel Approach to Approximate String Matching in Compressed Texts.
Proceedings of the Seventh International Symposium on String Processing and Information Retrieval, 2000

Online Construction of Subsequence Automata for Multiple Texts.
Proceedings of the Seventh International Symposium on String Processing and Information Retrieval, 2000

Fully Compressed Pattern Matching Algorithm for Balanced Straight-Line Programs.
Proceedings of the Seventh International Symposium on String Processing and Information Retrieval, 2000

A Boyer-Moore Type Algorithm for Compressed Pattern Matching.
Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000

Speeding Up Pattern Matching by Text Compression.
Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

1999
A Unifying Framework for Compressed Pattern Matching.
Proceedings of the Sixth International Symposium on String Processing and Information Retrieval and Fifth International Workshop on Groupware, 1999

Knowledge Discovery from Health Data Using Weighted Aggregation Classifiers.
Proceedings of the Discovery Science, 1999

Pattern Matching in Text Compressed by Using Antidictionaries.
Proceedings of the Combinatorial Pattern Matching, 10th Annual Symposium, 1999

Shift-And Approach to Pattern Matching in LZW Compressed Text.
Proceedings of the Combinatorial Pattern Matching, 10th Annual Symposium, 1999

1998
On the Hardness of Approximating the minimum Consistent Acyclic DFA and Decision Diagram.
Inf. Process. Lett., 1998

Multiple Pattern Matching in LZW Compressed Text.
Proceedings of the Data Compression Conference, 1998

1997
An Efficient Pattern-Matching Algorithm for Strings with Short Descriptions.
Nord. J. Comput., 1997

Learning Pattern Languages Using Queries.
Proceedings of the Computational Learning Theory, Third European Conference, 1997

An Improved Pattern Matching Algorithm for Strings in Terms of Straight-Line Programs.
Proceedings of the Combinatorial Pattern Matching, 8th Annual Symposium, 1997

1996
On the Hardness of Approximating the Minimum Consistent OBDD Problem.
Proceedings of the Algorithm Theory, 1996

1995
Complexity of Computing Vapnik-Chervonenkis Dimension and Some Generalized Dimensions.
Theor. Comput. Sci., 1995

Pattern-Matching for Strings with Short Descriptions
Electronic Colloquium on Computational Complexity (ECCC), 1995

Developments in Computational Learning and Discovery Theory within the Framework of Elementary Formal Systems.
Proceedings of the Machine Intelligence 15, 1995

BONSAI Garden: Parallel Knowledge Discovery System for Amino Acid Sequences.
Proceedings of the Third International Conference on Intelligent Systems for Molecular Biology, 1995

1994
Machine Learning and Discovery for Bloinformatics: Introduction.
Proceedings of the 27th Annual Hawaii International Conference on System Sciences (HICSS-27), 1994

Complexity of Computing Generalized VC-Dimensions.
Proceedings of the Machine Learning: ECML-94, 1994

Refutably Probably Approximately Correct Learning.
Proceedings of the Algorithmic Learning Theory, 1994

1993
A Machine Discovery from Amino Acid Sequences by Decision Trees over Regular Patterns.
New Generation Comput., 1993

Complexity of Computing Vapnik-Chervonenkis Dimension.
Proceedings of the Algorithmic Learning Theory, 4th International Workshop, 1993

1991
Teachability in Computational Learning.
New Generation Comput., 1991

More About Learning Elementary Formal Systems.
Proceedings of the Nonmonotonic and Inductive Logic, 1991

1990
Teachability in Computational Learning.
Proceedings of the Algorithmic Learning Theory, First International Workshop, 1990


  Loading...