| Publication | Date of Publication | Type |
|---|
Serial and parallel algorithms for order-preserving pattern matching based on the duel-and-sweep paradigm
Acta Informatica | 2024-11-07 | Paper |
Efficient non-isomorphic graph enumeration algorithms for several intersection graph classes
Theoretical Computer Science | 2024-06-04 | Paper |
| Efficient parameterized pattern matching in sublinear space | 2024-05-29 | Paper |
| Sorting balls and water: equivalence and computational complexity | 2024-05-16 | Paper |
| Parallel algorithm for pattern matching problems under substring consistent equivalence relations | 2024-05-06 | Paper |
Efficient non-isomorphic graph enumeration algorithms for subclasses of perfect graphs
WALCOM: Algorithms and Computation | 2023-11-24 | Paper |
Inferring strings from position heaps in linear time
WALCOM: Algorithms and Computation | 2023-11-24 | Paper |
Sorting balls and water: equivalence and computational complexity
Theoretical Computer Science | 2023-10-12 | Paper |
Computing the parameterized Burrows-Wheeler transform online
String Processing and Information Retrieval | 2023-08-04 | Paper |
Linear-time online algorithm inferring the shortest path from a walk
Lecture Notes in Computer Science | 2023-07-28 | Paper |
| Fast and linear-time string matching algorithms based on the distances of \(q\)-gram occurrences | 2023-02-07 | Paper |
| DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures | 2023-02-07 | Paper |
Computing Covers Under Substring Consistent Equivalence Relations
1511.68351 | 2022-12-22 | Paper |
Parameterized DAWGs: efficient constructions and bidirectional pattern searches
Theoretical Computer Science | 2022-09-27 | Paper |
| scientific article; zbMATH DE number 7453082 (Why is no real title available?) | 2022-01-06 | Paper |
scientific article; zbMATH DE number 7453082 (Why is no real title available?)
(available as arXiv preprint) | 2022-01-06 | Paper |
Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes
(available as arXiv preprint) | 2021-10-04 | Paper |
Duel and sweep algorithm for order-preserving pattern matching
SOFSEM 2018: Theory and Practice of Computer Science | 2020-10-21 | Paper |
New variants of pattern matching with constants and variables
SOFSEM 2018: Theory and Practice of Computer Science | 2020-10-21 | Paper |
Parallel duel-and-sweep algorithm for the order-preserving pattern matching
SOFSEM 2020: Theory and Practice of Computer Science | 2020-07-20 | Paper |
Linear-time online algorithm for inferring the shortest path graph from a walk label
Theoretical Computer Science | 2020-02-20 | Paper |
Efficient dynamic dictionary matching with DAWGs and AC-automata
Theoretical Computer Science | 2019-10-07 | Paper |
Permuted pattern matching algorithms on multi-track strings
Algorithms | 2019-07-08 | Paper |
Distributional learning of conjunctive grammars and contextual binary feature grammars
Journal of Computer and System Sciences | 2019-06-25 | Paper |
Finding all solutions and instances of Numberlink and Slitherlink by ZDDs
Algorithms | 2019-03-26 | Paper |
The time complexity of permutation routing via matching, token swapping and a variant
Journal of Graph Algorithms and Applications | 2019-02-14 | Paper |
| scientific article; zbMATH DE number 6999904 (Why is no real title available?) | 2019-01-10 | Paper |
Enumeration of cryptarithms using deterministic finite automata
(available as arXiv preprint) | 2018-11-07 | Paper |
| AC-automaton update algorithm for semi-dynamic dictionary matching | 2018-10-17 | Paper |
| General perspective on distributionally learnable classes | 2017-12-18 | Paper |
Distributional learning of some nonlinear tree grammars
Fundamenta Informaticae | 2017-07-28 | Paper |
The strong, weak, and very weak finite context and kernel properties
Language and Automata Theory and Applications | 2017-06-01 | Paper |
The time complexity of the token swapping problem and its parallel variants
WALCOM: Algorithms and Computation | 2017-05-05 | Paper |
Longest common subsequence in at least \(k\) length order-isomorphic substrings
SOFSEM 2017: Theory and Practice of Computer Science | 2017-04-04 | Paper |
Learning concepts and their unions from positive data with refinement operators
Annals of Mathematics and Artificial Intelligence | 2017-03-06 | Paper |
Distributional Learning of Context-Free and Multiple Context-Free Grammars
Topics in Grammatical Inference | 2017-02-15 | Paper |
Efficiency in the identification in the limit learning paradigm
Topics in Grammatical Inference | 2017-02-15 | Paper |
Distributional Learning and Context/Substructure Enumerability in Nonlinear Tree Grammars
Formal Grammar | 2016-12-01 | Paper |
Sequence binary decision diagram: minimization, relationship to acyclic automata, and complexities of Boolean set operations
Discrete Applied Mathematics | 2016-09-12 | Paper |
Learning conjunctive grammars and contextual binary feature grammars
Language and Automata Theory and Applications | 2016-04-08 | Paper |
Probabilistic learnability of context-free grammars with basic distributional properties from positive examples
Theoretical Computer Science | 2016-02-26 | Paper |
The failure of the strong pumping lemma for multiple context-free languages
Theory of Computing Systems | 2015-02-05 | Paper |
Distributional learning of parallel multiple context-free grammars
Machine Learning | 2014-12-05 | Paper |
A comparison of collapsed Bayesian methods for probabilistic finite automata
Machine Learning | 2014-12-05 | Paper |
An Algebraic Approach to Multiple Context-Free Grammars
Logical Aspects of Computational Linguistics | 2014-06-24 | Paper |
PAC Learning of Some Subclasses of Context-Free Grammars with Basic Distributional Properties from Positive Data
Lecture Notes in Computer Science | 2013-11-06 | Paper |
Polynomial Time Learning of Some Multiple Context-Free Languages with a Minimally Adequate Teacher
Formal Grammar | 2012-11-02 | Paper |
Counterexamples to the long-standing conjecture on the complexity of BDD binary operations
Information Processing Letters | 2012-10-23 | Paper |
Integration of the Dual Approaches in the Distributional Learning of Context-Free Grammars
Language and Automata Theory and Applications | 2012-06-08 | Paper |
Distributional Learning of Simple Context-Free Tree Grammars
Lecture Notes in Computer Science | 2011-10-19 | Paper |
Towards dual approaches for learning context-free grammars based on syntactic concept lattices
Developments in Language Theory | 2011-07-29 | Paper |
Distributional learning of abstract categorial grammars
Logical Aspects of Computational Linguistics | 2011-07-01 | Paper |
Well-nestedness properly subsumes strict derivational minimalism
Logical Aspects of Computational Linguistics | 2011-07-01 | Paper |
Efficient learning of multiple context-free languages with multidimensional substitutability from positive data
Theoretical Computer Science | 2011-04-14 | Paper |
Polynomial-time identification of multiple context-free languages from positive data and membership queries
Grammatical Inference: Theoretical Results and Applications | 2010-09-10 | Paper |
An elementary proof of a generalization of double Greibach normal form
Information Processing Letters | 2010-08-16 | Paper |
Chomsky-Schützenberger-type characterization of multiple context-free languages
Language and Automata Theory and Applications | 2010-05-26 | Paper |
Learning mildly context-sensitive languages with multidimensional substitutability from positive data
Lecture Notes in Computer Science | 2009-12-01 | Paper |
Learning efficiency of very simple grammars from positive data
Theoretical Computer Science | 2009-05-12 | Paper |
Polynomial-Time Identification of an Extension of Very Simple Grammars from Positive Data
Grammatical Inference: Algorithms and Applications | 2008-11-27 | Paper |
An Efficient Algorithm for the Inclusion Problem of a Subclass of DPDAs
Language and Automata Theory and Applications | 2008-11-20 | Paper |
Identification in the Limit of k,l-Substitutable Context-Free Languages
Grammatical Inference: Algorithms and Applications | 2008-10-16 | Paper |
Probabilistic Generalization of Simple Grammars and Its Application to Reinforcement Learning
Lecture Notes in Computer Science | 2008-09-04 | Paper |
Learning Efficiency of Very Simple Grammars from Positive Data
Lecture Notes in Computer Science | 2008-08-19 | Paper |
On Two Extensions of Abstract Categorial Grammars
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-15 | Paper |
Logical Aspects of Computational Linguistics
Lecture Notes in Computer Science | 2005-11-23 | Paper |
Term Rewriting and Applications
Lecture Notes in Computer Science | 2005-11-11 | Paper |
