Ayumi Shinohara

Proceedings of the SOFSEM 2020 Doctoral Student Research Forum co-located with the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2020), 2020

Parallel Duel-and-Sweep Algorithm for the Order-Preserving Pattern Matching.

[BibT_eX]

[DOI]

Davaajav Jargalsaikhan

Diptarama Hendrian

Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

Grammar Compression with Probabilistic Context-Free Grammar.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2020

DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

In-Place Bijective Burrows-Wheeler Transforms.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

2019

Cyber-Enhanced Rescue Canine.

[BibT_eX]

[DOI]

Proceedings of the Disaster Robotics - Results from the ImPACT Tough Robotics Challenge, 2019

Efficient dynamic dictionary matching with DAWGs and AC-automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Query Learning Algorithm for Residual Symbolic Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Tenth International Symposium on Games, 2019

Linear-size Suffix Tries for Parameterized Strings.

[BibT_eX]

[DOI]

CoRR, 2019

Permuted Pattern Matching Algorithms on Multi-Track Strings.

[BibT_eX]

[DOI]

Algorithms, 2019

An Improvement of the Franek-Jennings-Smyth Pattern Matching Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2019, 2019

Development of a Lightweight Cyber-enhanced Rescue Canine Suit with Heat Protection and Anti-slip Countermeasures.

[BibT_eX]

[DOI]

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).

[BibT_eX]

[DOI]

New Gener. Comput., 2018

Enumerating Cryptarithms Using Deterministic Finite Automata.

[BibT_eX]

[DOI]

CoRR, 2018

Enumeration of Cryptarithms Using Deterministic Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2018

Linear-Time Online Algorithm Inferring the Shortest Path from a Walk.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2018

Duel and Sweep Algorithm for Order-Preserving Pattern Matching.

[BibT_eX]

[DOI]

Davaajav Jargalsaikhan

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Davaajav Jargalsaikhan

CoRR, 2017

Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

Computing Longest Single-arm-gapped Palindromes in a String.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

Position Heaps for Parameterized Strings.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

An efficient query learning algorithm for zero-suppressed binary decision diagrams.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Algorithmic Learning Theory, 2017

2016

Pattern Matching on Compressed Text.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Fast Full Permuted Pattern Matching Algorithms on Multi-track Strings.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2016, 2016

AC-Automaton Update Algorithm for Semi-dynamic Dictionary Matching.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2016

A Fast Order-Preserving Matching with q-neighborhood Filtration Using SIMD Instructions.

[BibT_eX]

[DOI]

Yohei Ueki

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Ichinari Sato

Proceedings of the 5th IIAI International Congress on Advanced Applied Informatics, 2016

Compact bit encoding schemes for simply-typed lambda-terms.

[BibT_eX]

[DOI]

Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, 2016

Generalization of Efficient Implementation of Compression by Substring Enumeration.

[BibT_eX]

[DOI]

Shumpei Sakuma

Proceedings of the 2016 Data Compression Conference, 2016

2015

Detecting regularities on grammar-compressed strings.

[BibT_eX]

[DOI]

Inf. Comput., 2015

Position Heaps for Permuted Pattern Matching on Multi-Track String.

[BibT_eX]

[DOI]

Proceedings of Student Research Forum Papers and Posters at SOFSEM 2015, 2015

2014

Average number of occurrences of repetitions in a necklace.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Bounded Occurrence Edit Distance: A New Metric for String Similarity Joins with Edit Distance Constraints.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

Reducing Sample Complexity in Reinforcement Learning by Transferring Transition and Reward Probabilities.

[BibT_eX]

[DOI]

Kouta Oguni

Proceedings of the ICAART 2014, 2014

A Simple Classification Method for Class Imbalanced Data using the Kernel Mean.

[BibT_eX]

[DOI]

Yusuke Sato

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.

[BibT_eX]

[DOI]

Kazuya Yaguchi

Naoki Kobayashi

Proceedings of the Data Compression Conference, 2014

2013

On Morphisms Generating Run-Rich Strings.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, 2013

Permuted Pattern Matching on Multi-track Strings.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2013: Theory and Practice of Computer Science, 2013

2012

Functional programs as compressed data.

[BibT_eX]

[DOI]

High. Order Symb. Comput., 2012

Computing Maximum Number of Runs in Strings.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2012

Functional programs as compressed data.

[BibT_eX]

[DOI]

Naoki Kobayashi

Kazutaka Matsuda

Proceedings of the ACM SIGPLAN 2012 Workshop on Partial Evaluation and Program Manipulation, 2012

Prediction for Control Delay on Reinforcement Learning.

[BibT_eX]

Junya Saito

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.

[BibT_eX]

[DOI]

Chic. J. Theor. Comput. Sci., 2010

Inferring Strings from Runs.

[BibT_eX]

[DOI]

Akira Ishino

Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30, 2010

Average Number of Runs and Squares in Necklace.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30, 2010

The Number of Runs in a Ternary Word.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30, 2010

Multi-target adaptive A.

[BibT_eX]

[DOI]

Kengo Matsuta

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.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Average Value of Sum of Exponents of Runs in a String.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2009

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

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2009

Linear-Time Text Compression by Longest-First Substitution.

[BibT_eX]

[DOI]

Algorithms, 2009

Bit-parallel Algorithms for Computing all the Runs in a String.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31, 2009

A Series of Run-Rich Strings.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2009

Complexity of Teaching by a Restricted Number of Examples.

[BibT_eX]

[DOI]

Proceedings of the COLT 2009, 2009

Testing Square-Freeness of Strings Compressed by Balanced Straight Line Program.

[BibT_eX]

[DOI]

Proceedings of the Theory of Computing 2009, 2009

Improvement of the performance using received message on learning of communication codes.

[BibT_eX]

[DOI]

Tatsuya Kasai

Proceedings of the 8th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), 2009

2008

New Lower Bounds for the Maximum Number of Runs in a String.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2008, Prague, Czech Republic, 2008

Average Value of Sum of Exponents of Runs in Strings.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2008, Prague, Czech Republic, 2008

Computing Longest Common Substring and All Palindromes from Compressed Strings.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008

Development of an Augmented Environment and Autonomous Learning for Quadruped Robots.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Structure-Based Compression of Complex Massive Data, 22.06., 2008

2007

Reducing Trials by Thinning-Out in Skill Discovery.

[BibT_eX]

[DOI]

Proceedings of the Discovery Science, 10th International Conference, 2007

2006

Autonomous Learning of Ball Trapping in the Four-Legged Robot League.

[BibT_eX]

[DOI]

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.

[BibT_eX]

Akira Ishino

Proceedings of the Intelligent Autonomous Systems 9, 2006

Ball tracking with velocity based on Monte-Carlo localization.

[BibT_eX]

Jun Inoue

Akira Ishino

Proceedings of the Intelligent Autonomous Systems 9, 2006

2005

The size of subsequence automaton.

[BibT_eX]

[DOI]

Zdenek Tronícek

Theor. Comput. Sci., 2005

A fully compressed pattern matching algorithm for simple collage systems.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2005

On-line construction of compact directed acyclic word graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

New Bit-Parallel Indel-Distance Algorithm.

[BibT_eX]

[DOI]

Heikki Hyyrö

Yoan J. Pinzón

Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

Fast Bit-Vector Algorithms for Approximate String Matching Under Indel Distance.

[BibT_eX]

[DOI]

Heikki Hyyrö

Yoan J. Pinzón

Proceedings of the SOFSEM 2005: Theory and Practice of Computer Science, 2005

Fully Incremental LCS Computation.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2004

Ternary directed acyclic word graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

An O(N<sup>2</sup>) Algorithm for Discovering Optimal Boolean Pattern Pairs.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2004

Compact directed acyclic word graphs for a sliding window.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2004

Efficiently Finding Regulatory Elements Using Correlation with Gene Expression.

[BibT_eX]

[DOI]

J. Bioinform. Comput. Biol., 2004

Finding Optimal Pairs of Patterns.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics, 4th International Workshop, 2004

An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 2004

Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance.

[BibT_eX]

[DOI]

Proceedings of the Discovery Science, 7th International Conference, 2004

String Pattern Discovery.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 15th International Conference, 2004

On Bit-Parallel Processing of Multi-byte Text.

[BibT_eX]

[DOI]

Proceedings of the Information Retrieval Technology, Asia Information Retrieval Symposium, 2004

2003

Collage system: a unifying framework for compressed pattern matching.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

A practical algorithm to find the best subsequence patterns.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Uniform characterizations of polynomial-query learnabilities.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

A Note on Randomized Algorithm for String Matching with Mismatches.

[BibT_eX]

Nord. J. Comput., 2003

Linear-Time Off-Line Text Compression by Longest-First Substitution.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2003

Inferring Strings from Graphs and Arrays.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

On the Length of the Minimum Solution of Word Equations in One Variable.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Discovering Most Classificatory Patterns for Very Expressive Pattern Classes.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2002

Space-Economical Construction of Index Structures for All Suffixes of a String.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

Finding Best Patterns Practically.

[BibT_eX]

[DOI]

Proceedings of the Progress in Discovery Science, 2002

Discovering Best Variable-Length-Don't-Care Patterns.

[BibT_eX]

[DOI]

Proceedings of the Discovery Science, 5th International Conference, 2002

The Minimum DAWG for All Suffixes of a String and Its Applications.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

2001

Construction of the CDAWG for a Trie.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2001, Prague, Czech Republic, 2001

Musical Sequence Comparison for Melodic and Rhythmic Similarities.

[BibT_eX]

[DOI]

Proceedings of the Eighth International Symposium on String Processing and Information Retrieval, 2001

On-Line Construction of Symmetric Compact Directed Acyclic Word Graphs.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Discovering Repetitive Expressions and Affinities from Anthologies of Classical Japanese Poems.

[BibT_eX]

[DOI]

Proceedings of the Discovery Science, 4th International Conference, DS 2001, Washington, 2001

A Practical Algorithm to Find the Best Episode Patterns.

[BibT_eX]

[DOI]

Proceedings of the Discovery Science, 4th International Conference, DS 2001, Washington, 2001

Faster Approximate String Matching over Compressed Text.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2001

Compressed Pattern Matching for SEQUITUR.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2001

Multiple Pattern Matching Algorithms on Collage System.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 12th Annual Symposium, 2001

2000

Polynomial-time Learning of Elementary Formal Systems.

[BibT_eX]

[DOI]

Takeshi Shinohara

New Gener. Comput., 2000

Bit-Parallel Approach to Approximate String Matching in Compressed Texts.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Symposium on String Processing and Information Retrieval, 2000

Online Construction of Subsequence Automata for Multiple Texts.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Symposium on String Processing and Information Retrieval, 2000

Fully Compressed Pattern Matching Algorithm for Balanced Straight-Line Programs.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Symposium on String Processing and Information Retrieval, 2000

A Boyer-Moore Type Algorithm for Compressed Pattern Matching.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000

Speeding Up Pattern Matching by Text Compression.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

1999

A Unifying Framework for Compressed Pattern Matching.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Discovery Science, 1999

Pattern Matching in Text Compressed by Using Antidictionaries.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 10th Annual Symposium, 1999

Shift-And Approach to Pattern Matching in LZW Compressed Text.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 10th Annual Symposium, 1999

1998

On the Hardness of Approximating the minimum Consistent Acyclic DFA and Decision Diagram.

[BibT_eX]

[DOI]

Shinichi Shimozono

Kouichi Hirata

Inf. Process. Lett., 1998

Multiple Pattern Matching in LZW Compressed Text.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 1998

1997

An Efficient Pattern-Matching Algorithm for Strings with Short Descriptions.

[BibT_eX]

Marek Karpinski

Wojciech Rytter

Nord. J. Comput., 1997

Learning Pattern Languages Using Queries.

[BibT_eX]

[DOI]

Satoshi Matsumoto

Proceedings of the Computational Learning Theory, Third European Conference, 1997

An Improved Pattern Matching Algorithm for Strings in Terms of Straight-Line Programs.

[BibT_eX]

[DOI]

Masamichi Miyazaki

Proceedings of the Combinatorial Pattern Matching, 8th Annual Symposium, 1997

1996

On the Hardness of Approximating the Minimum Consistent OBDD Problem.

[BibT_eX]

[DOI]

Kouichi Hirata

Shinichi Shimozono

Proceedings of the Algorithm Theory, 1996

1995

Complexity of Computing Vapnik-Chervonenkis Dimension and Some Generalized Dimensions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1995

Pattern-Matching for Strings with Short Descriptions

[BibT_eX]

[DOI]

Marek Karpinski

Wojciech Rytter

Electron. Colloquium Comput. Complex., 1995

Developments in Computational Learning and Discovery Theory within the Framework of Elementary Formal Systems.

[BibT_eX]

Proceedings of the Machine Intelligence 15, 1995

BONSAI Garden: Parallel Knowledge Discovery System for Amino Acid Sequences.

[BibT_eX]

[DOI]

Proceedings of the Third International Conference on Intelligent Systems for Molecular Biology, 1995

1994

Machine Learning and Discovery for Bloinformatics: Introduction.

[BibT_eX]

Proceedings of the 27th Annual Hawaii International Conference on System Sciences (HICSS-27), 1994

Complexity of Computing Generalized VC-Dimensions.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning: ECML-94, 1994

Refutably Probably Approximately Correct Learning.

[BibT_eX]

[DOI]

Satoshi Matsumoto

Proceedings of the Algorithmic Learning Theory, 1994

1993

A Machine Discovery from Amino Acid Sequences by Decision Trees over Regular Patterns.

[BibT_eX]

[DOI]

New Gener. Comput., 1993

Complexity of Computing Vapnik-Chervonenkis Dimension.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 4th International Workshop, 1993

1991

Teachability in Computational Learning.

[BibT_eX]

[DOI]

New Gener. Comput., 1991

More About Learning Elementary Formal Systems.

[BibT_eX]

[DOI]

Proceedings of the Nonmonotonic and Inductive Logic, 1991

Which classes of elementary formal systems are polynomial-time learnable.

[BibT_eX]

Takeshi Shinohara

Proceedings of the Algorithmic Learning Theory, 2nd International Workshop, 1991

1990

Teachability in Computational Learning.

[BibT_eX]