| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6075975 | 2023-09-20 | Paper |
| Subsequence covers of words | 2023-08-04 | Paper |
| Faster recovery of approximate periods over edit distance | 2023-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6098782 | 2023-06-14 | Paper |
| Tight bound for the number of distinct palindromes in a tree | 2023-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874434 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874500 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875583 | 2023-02-03 | Paper |
| 200 Problems on Languages, Automata, and Computation | 2023-01-30 | Paper |
| Internal Quasiperiod Queries | 2022-12-22 | Paper |
| Efficient Enumeration of Distinct Factors Using Package Representations | 2022-12-22 | Paper |
| Efficient algorithms for Lempel-Ziv encoding | 2022-12-09 | Paper |
| Pattern-matching problems for 2-dimensional images described by finite automata | 2022-12-09 | Paper |
| Energy-Optimal Broadcast in a Tree with Mobile Agents | 2022-12-09 | Paper |
| Parallel and sequential approximation of shortest superstrings | 2022-12-09 | Paper |
| Efficient sublinear time parallel algorithms for dynamic programming and context-free recognition | 2022-08-18 | Paper |
| Speeding up two string-matching algorithms | 2022-08-18 | Paper |
| Parallel recognition and ranking of context-free languages | 2022-08-18 | Paper |
| On a sublinear time parallel construction of optimal binary search trees | 2022-08-18 | Paper |
| On linear-time alphabet-independent 2-dimensional pattern matching | 2022-08-16 | Paper |
| Quasi-Linear-Time Algorithm for Longest Common Circular Factor | 2022-07-18 | Paper |
| String covers of a tree | 2022-06-15 | Paper |
| Efficient representation and counting of antipower factors in words | 2022-06-13 | Paper |
| A periodicity lemma for partial words | 2022-03-14 | Paper |
| Syntactic view of sigma-tau generation of permutations | 2021-08-11 | Paper |
| Internal dictionary matching | 2021-06-30 | Paper |
| A Linear-Time Algorithm for Seeds Computation | 2021-05-03 | Paper |
| Shortest covers of all cyclic shifts of a string | 2021-04-14 | Paper |
| 125 Problems in Text Algorithms | 2021-04-06 | Paper |
| Gossiping by energy-constrained mobile agents in tree networks | 2021-03-09 | Paper |
| Linear-Time Algorithm for Long LCF with k Mismatches | 2020-12-16 | Paper |
| Deterministic broadcasting in ad hoc radio networks | 2020-12-03 | Paper |
| Circular pattern matching with \(k\) mismatches | 2020-10-23 | Paper |
| String Periods in the Order-Preserving Model | 2020-08-05 | Paper |
| Shortest covers of all cyclic shifts of a string | 2020-07-22 | Paper |
| Universal reconstruction of a string | 2020-02-20 | Paper |
| Circular pattern matching with \(k\) mismatches | 2020-01-30 | Paper |
| String periods in the order-preserving model | 2020-01-17 | Paper |
| Polynomial size test sets for context-free languages | 2019-12-04 | Paper |
| Efficient representation and counting of antipower factors in words | 2019-12-04 | Paper |
| Syntactic view of sigma-tau generation of permutations | 2019-12-04 | Paper |
| Energy-optimal broadcast and exploration in a tree using mobile agents | 2019-10-18 | Paper |
| Efficient enumeration of non-equivalent squares in partial words with few holes | 2019-06-06 | Paper |
| A Linear-Time Algorithm for Seeds Computation | 2019-05-10 | Paper |
| Broadcast with energy-exchanging mobile agents distributed on a tree | 2019-01-30 | Paper |
| Near-optimal computation of runs over general alphabet via non-crossing LCE queries | 2018-10-17 | Paper |
| On periodicity lemma for partial words | 2018-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4643840 | 2018-05-29 | Paper |
| Evacuation from a disc in the presence of a faulty robot | 2018-04-12 | Paper |
| On semi-perfect de Bruijn words | 2018-03-12 | Paper |
| On the string consensus problem and the Manhattan sequence consensus problem | 2018-02-16 | Paper |
| Efficient algorithms for shortest partial seeds in words | 2018-02-16 | Paper |
| Two-dimensional pattern matching in linear time and small space | 2017-12-04 | Paper |
| String powers in trees | 2017-11-09 | Paper |
| Covering problems for partial words and for indeterminate strings | 2017-11-06 | Paper |
| Efficient enumeration of non-equivalent squares in partial words with few holes | 2017-10-23 | Paper |
| Faster Longest Common Extension Queries in Strings over General Alphabets | 2017-10-17 | Paper |
| Internal Pattern Matching Queries in a Text and Applications | 2017-10-05 | Paper |
| Efficient indexes for jumbled pattern matching with constant-sized alphabet | 2017-05-02 | Paper |
| Two fast constructions of compact representations of binary words with given set of periods | 2017-02-06 | Paper |
| Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries | 2017-01-30 | Paper |
| Communication Problems for Mobile Agents Exchanging Energy | 2016-12-01 | Paper |
| Fast algorithms for abelian periods in words and greatest common divisor queries | 2016-11-14 | Paper |
| Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence | 2016-10-28 | Paper |
| Maximum number of distinct and nonequivalent nonstandard squares in a word | 2016-09-12 | Paper |
| Order-preserving indexing | 2016-06-16 | Paper |
| Square-Free Words over Partially Commutative Alphabets | 2016-04-08 | Paper |
| Polynomial-time approximation algorithms for weighted LCS problem | 2016-04-07 | Paper |
| On the greedy algorithm for the shortest common superstring problem with reversals | 2016-01-05 | Paper |
| Universal Reconstruction of a String | 2015-10-30 | Paper |
| Linear-time version of Holub's algorithm for morphic imprimitivity testing | 2015-09-25 | Paper |
| New simple efficient algorithms computing powers and runs in strings | 2015-09-22 | Paper |
| Computing the number of cubic runs in standard Sturmian words | 2015-09-22 | Paper |
| Covering problems for partial words and for indeterminate strings | 2015-09-11 | Paper |
| Fast algorithm for partial covers in words | 2015-09-03 | Paper |
| A note on the longest common compatible prefix problem for partial words | 2015-08-24 | Paper |
| String Powers in Trees | 2015-08-20 | Paper |
| On the String Consensus Problem and the Manhattan Sequence Consensus Problem | 2015-02-10 | Paper |
| Searching for Zimin patterns | 2015-01-30 | Paper |
| Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word | 2014-10-14 | Paper |
| A linear time algorithm for consecutive permutation pattern matching | 2014-08-13 | Paper |
| A note on a simple computation of the maximal suffix of a string | 2014-08-13 | Paper |
| Efficient counting of square substrings in a tree | 2014-07-07 | Paper |
| Efficient Algorithms for Shortest Partial Seeds in Words | 2014-06-30 | Paper |
| Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence | 2014-06-30 | Paper |
| Extracting powers and periods in a word from its runs structure | 2014-01-22 | Paper |
| Efficient seed computation revisited | 2014-01-09 | Paper |
| Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet | 2013-09-17 | Paper |
| Fast Algorithm for Partial Covers in Words | 2013-06-14 | Paper |
| The maximal number of runs in standard Sturmian words | 2013-06-07 | Paper |
| Efficient Counting of Square Substrings in a Tree | 2013-03-21 | Paper |
| A note on efficient computation of all abelian periods in a string | 2013-03-20 | Paper |
| Linear-Time Version of Holub’s Algorithm for Morphic Imprimitivity Testing | 2013-03-18 | Paper |
| Computing the longest previous factor | 2012-11-15 | Paper |
| On the maximum number of cubic subwords in a word | 2012-11-15 | Paper |
| The maximal number of cubic runs in a word | 2012-11-06 | Paper |
| On the maximal sum of exponents of runs in a string | 2012-09-13 | Paper |
| ASYMPTOTIC BEHAVIOUR OF THE MAXIMAL NUMBER OF SQUARES IN STANDARD STURMIAN WORDS | 2012-08-30 | Paper |
| The Maximum Number of Squares in a Tree | 2012-08-14 | Paper |
| On the structure of compacted subword graphs of Thue-Morse words and their applications | 2012-05-11 | Paper |
| Efficient algorithms for three variants of the LPF table | 2012-05-11 | Paper |
| Hamiltonian Paths in the Square of a Tree | 2011-12-16 | Paper |
| Efficient Seeds Computation Revisited | 2011-06-29 | Paper |
| Polynomial-Time Approximation Algorithms for Weighted LCS Problem | 2011-06-29 | Paper |
| On the Maximal Sum of Exponents of Runsin a String | 2011-05-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3575485 | 2010-07-27 | Paper |
| Algorithms for Three Versions of the Shortest Common Superstring Problem | 2010-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3565913 | 2010-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3565916 | 2010-06-07 | Paper |
| On the Maximal Number of Cubic Runs in a String | 2010-05-26 | Paper |
| Post Correspondence Problem with Partially Commutative Alphabets | 2010-05-26 | Paper |
| Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays | 2010-01-28 | Paper |
| Efficient Testing of Equivalence of Words in a Free Idempotent Semigroup | 2010-01-28 | Paper |
| USEFULNESS OF DIRECTED ACYCLIC SUBWORD GRAPHS IN PROBLEMS RELATED TO STANDARD STURMIAN WORDS | 2010-01-08 | Paper |
| LPF Computation Revisited | 2009-12-11 | Paper |
| On the Maximal Number of Cubic Subwords in a String | 2009-12-11 | Paper |
| Repetitions in strings: algorithms and combinatorics | 2009-11-06 | Paper |
| Compressed string-matching in standard Sturmian words | 2009-08-07 | Paper |
| Equivalence of Functions Represented by Simple Context-Free Grammars with Output | 2009-03-26 | Paper |
| On special families of morphisms related to \(\delta \)-matching and don't care symbols | 2009-03-23 | Paper |
| The Number of Runs in Sturmian Words | 2009-02-12 | Paper |
| Tiling Periodicity | 2008-06-17 | Paper |
| Matching Integer Intervals by Minimal Sets of Binary Words with don’t cares | 2008-06-17 | Paper |
| Efficient Computation of Throughput Values of Context-Free Languages | 2008-06-10 | Paper |
| REDUCING SIMPLE GRAMMARS: EXPONENTIAL AGAINST HIGHLY-POLYNOMIAL TIME IN PRACTICE | 2008-05-20 | Paper |
| The Number of Runs in a String: Improved Analysis of the Linear Upper Bound | 2008-03-19 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| The number of runs in a string | 2007-09-18 | Paper |
| Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice | 2007-09-06 | Paper |
| Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes | 2007-09-05 | Paper |
| Equivalence of simple functions | 2007-05-11 | Paper |
| Prime normal form and equivalence of simple grammars | 2007-01-09 | Paper |
| The structure of subword graphs and suffix trees of Fibonacci words | 2007-01-09 | Paper |
| Implementation and Application of Automata | 2006-11-13 | Paper |
| Implementation and Application of Automata | 2006-11-13 | Paper |
| Broadcasting algorithms in radio networks with unknown topology | 2006-10-05 | Paper |
| A FIRST APPROACH TO FINDING COMMON MOTIFS WITH GAPS | 2005-12-15 | Paper |
| LINEAR-TIME PRIME DECOMPOSITION OF REGULAR PREFIX CODES | 2005-10-19 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024808 | 2005-07-04 | Paper |
| On the complexity of decidable cases of the commutation problem of languages | 2005-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044327 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737684 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737699 | 2004-08-11 | Paper |
| A randomized algorithm for gossiping in radio networks | 2004-03-15 | Paper |
| Jewels of Stringology | 2004-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4432970 | 2003-12-15 | Paper |
| Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique | 2003-10-29 | Paper |
| Application of Lempel-Ziv factorization to the approximation of grammar-based compression. | 2003-08-17 | Paper |
| On polynomial-time approximation algorithms for the variable length scheduling problem. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418601 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4412042 | 2003-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2708962 | 2003-06-26 | Paper |
| On maximal suffixes and constant-space linear-time versions of KMP algorithm. | 2003-05-25 | Paper |
| On the complexity of pattern matching for highly compressed two-dimensional texts. | 2003-05-14 | Paper |
| The complexity of compressing subsegments of images described by finite automata | 2003-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4787343 | 2003-01-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4782709 | 2002-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779149 | 2002-11-25 | Paper |
| Fast broadcasting and gossiping in radio networks | 2002-09-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551385 | 2002-09-05 | Paper |
| Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property | 2002-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941888 | 2002-03-04 | Paper |
| Efficient web searching using temporal factors | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3150181 | 2002-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4500842 | 2001-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4496242 | 2000-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952711 | 2000-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252022 | 2000-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941166 | 2000-02-29 | Paper |
| Generalized factorizations of words and their algorithmic properties | 1999-06-21 | Paper |
| Constant-space string-matching in sublinear average time | 1999-06-21 | Paper |
| Alphabet-independent optimal parallel search for three-dimensional patterns | 1999-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4219050 | 1998-11-15 | Paper |
| Almost optimal sublinear time parallel recognition algorithms for three subclasses of context free languages | 1998-08-13 | Paper |
| Correctness of constructing optimal alphabetic trees revisited | 1998-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4389326 | 1998-05-13 | Paper |
| Constant-Time Randomized Parallel String Matching | 1998-02-10 | Paper |
| The zooming method: A recursive approach to time-space efficient string-matching | 1997-09-29 | Paper |
| Two results on linear embeddings of complete binary trees | 1997-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4347161 | 1997-09-18 | Paper |
| Sequential and Parallel Approximation of Shortest Superstrings | 1997-07-06 | Paper |
| A simple randomized parallel algorithm for maximal f-matchings | 1997-02-28 | Paper |
| Context-free recognition via shortest paths computation: a version of Valiant's algorithm | 1997-02-28 | Paper |
| Parallel tree-contraction and Fibonacci numbers | 1997-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875166 | 1996-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858437 | 1996-04-09 | Paper |
| Polynomial size test sets for context-free languages | 1996-03-18 | Paper |
| Speeding up two string-matching algorithms | 1996-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4849531 | 1995-10-03 | Paper |
| Squares, cubes, and time-space efficient string searching | 1995-08-09 | Paper |
| An optimal sublinear time parallel algorithm for some dynamic programming problems | 1995-07-24 | Paper |
| On two-dimensional pattern matching by optimal parallel algorithms | 1994-09-25 | Paper |
| Two-dimensional pattern matching by sampling | 1993-12-01 | Paper |
| Efficient constructions of test sets for regular and context-free languages | 1993-10-25 | Paper |
| Fast recognition of deterministic cfl's with a smaller number of processors | 1993-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035247 | 1993-05-18 | Paper |
| Observations on \(\log(n)\) time parallel recognition of unambiguous cfl's | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3992991 | 1993-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4003168 | 1992-09-18 | Paper |
| Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays | 1992-06-26 | Paper |
| Efficient parallel algorithms to test square-freeness and factorize strings | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3975140 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3975142 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3976032 | 1992-06-26 | Paper |
| On the parallel recognition of unambiguous context-free languages | 1991-01-01 | Paper |
| On the complexity of the recognition of parallel 2D-image languages | 1991-01-01 | Paper |
| On optimal parallel computations for sequences of brackets | 1991-01-01 | Paper |
| Optimally edge-colouring outerplanar graphs is in NC | 1990-01-01 | Paper |
| Parallel construction of minimal suffix and factor automata | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3197319 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3355232 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3359785 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4206401 | 1990-01-01 | Paper |
| Parallel algorithms for a class of graphs generated recursively | 1989-01-01 | Paper |
| Optimal parallel algorithms for dynamic expression evaluation and context-free recognition | 1989-01-01 | Paper |
| A note on optimal parallel transformations of regular expressions to nondeterministic finite automata | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3484353 | 1989-01-01 | Paper |
| Parallel O(log n) time edge-colouring of trees and Halin graphs | 1988-01-01 | Paper |
| On efficient parallel computations for some dynamic programming problems | 1988-01-01 | Paper |
| On efficient parallel computations of costs of paths on a grid graph | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5753770 | 1987-01-01 | Paper |
| Optimal parallel parsing of bracket languages | 1987-01-01 | Paper |
| Parallel time O(log n) recognition of unambiguous context-free languages | 1987-01-01 | Paper |
| Remarks on string-matching and one-way multihead automata | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3765260 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3773822 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3779733 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3783598 | 1987-01-01 | Paper |
| An application of Mehlhorn's algorithm for bracket languages to log(n) space recognition of input-driven languages | 1986-01-01 | Paper |
| The space complexity of the unique decipherability problem | 1986-01-01 | Paper |
| On the complexity of parallel parsing of general context-free languages | 1986-01-01 | Paper |
| On the decidability of some problems about rational subsets of free partially commutative monoids | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3761691 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4728262 | 1986-01-01 | Paper |
| A characterization of reversal-bounded multipushdown machine languages | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3692896 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3700838 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3742751 | 1985-01-01 | Paper |
| Fast recognition of pushdown automaton and context-free languages | 1985-01-01 | Paper |
| On linear context-free languages and one-way multihead automata | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3336723 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3727409 | 1984-01-01 | Paper |
| Time complexity of loop-free two-way pushdown automata | 1983-01-01 | Paper |
| A simulation result for two-way pushdown automata | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3038619 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3040546 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3040547 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3318129 | 1983-01-01 | Paper |
| Time complexity of unambiguous path systems | 1982-01-01 | Paper |
| A note on two-way nondeterministic pushdown automata | 1982-01-01 | Paper |
| Time complexity of languages recognized by one-way multihead pushdown automata | 1981-01-01 | Paper |
| A hardest language recognized by two-way nondeterministic pushdown automata | 1981-01-01 | Paper |
| An effective simulation of deterministic pushdown automata with many two- way and one-way heads | 1981-01-01 | Paper |
| A Correct Preprocessing Algorithm for Boyer–Moore String-Searching | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3926039 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3947122 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4167530 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4103467 | 1976-01-01 | Paper |
| The dimension of stability of stochastic automata | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5675649 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5675650 | 1973-01-01 | Paper |
