| Publication | Date of Publication | Type |
|---|
| Reconstructing parameterized strings from parameterized suffix and LCP arrays | 2024-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6065473 | 2023-11-14 | Paper |
| Reconstructing parameterized strings from parameterized suffix and LCP arrays | 2023-08-04 | Paper |
| Searching for a modified pattern in a changing text | 2023-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6098775 | 2023-06-14 | Paper |
| Double string tandem repeats | 2023-04-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874428 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874467 | 2023-02-07 | Paper |
| Pattern matching in hypertext | 2022-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088893 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088906 | 2022-07-18 | Paper |
| Multidimensional period recovery | 2022-06-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075738 | 2022-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075739 | 2022-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009559 | 2021-08-04 | Paper |
| Longest Common Factor After One Edit Operation | 2021-02-16 | Paper |
| Towards a real time algorithm for parameterized longest common prefix computation | 2021-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5140765 | 2020-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5140774 | 2020-12-16 | Paper |
| Online recognition of dictionary with one gap | 2020-12-15 | Paper |
| Dynamic and internal longest common substring | 2020-11-11 | Paper |
| Finding patterns and periods in Cartesian tree matching | 2020-10-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5110891 | 2020-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5110892 | 2020-05-25 | Paper |
| Finding periods in Cartesian tree matching | 2020-02-25 | Paper |
| Two-dimensional maximal repetitions | 2020-02-20 | Paper |
| Approximate cover of strings | 2019-10-07 | Paper |
| Can we recover the cover? | 2019-05-21 | Paper |
| Mind the gap! | 2019-05-17 | Paper |
| Optimal two-dimensional compressed matching | 2019-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636494 | 2018-04-19 | Paper |
| Period recovery of strings over the Hamming and edit distances | 2018-02-16 | Paper |
| String cadences | 2017-11-06 | Paper |
| Two strings at Hamming distance 1 cannot be both quasiperiodic | 2017-09-19 | Paper |
| On representations of ternary order relations in numeric strings | 2017-07-17 | Paper |
| Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings | 2017-02-06 | Paper |
| On the relationship between histogram indexing and block-mass indexing | 2017-01-13 | Paper |
| Online timestamped text indexing | 2016-06-16 | Paper |
| Efficient special cases of pattern matching with swaps | 2016-06-09 | Paper |
| Configurations and minority in the string consensus problem | 2016-05-31 | Paper |
| An improved deterministic algorithm for generating different many-element random samples | 2016-05-26 | Paper |
| Period Recovery over the Hamming and Edit Distances | 2016-05-03 | Paper |
| Dynamic text and static pattern matching | 2015-09-02 | Paper |
| On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling | 2015-08-20 | Paper |
| Dictionary matching with a few gaps | 2015-06-01 | Paper |
| Approximate periodicity | 2015-05-04 | Paper |
| Hypertext Searching - A Survey | 2015-02-10 | Paper |
| Cycle detection and correction | 2014-12-05 | Paper |
| A PTAS for the square tiling problem | 2014-12-02 | Paper |
| Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing | 2014-11-14 | Paper |
| On the hardness of the consensus string problem | 2014-08-13 | Paper |
| On Hardness of Jumbled Indexing | 2014-07-01 | Paper |
| On the Efficiency of the Hamming C-Centerstring Problems | 2014-06-30 | Paper |
| Dictionary Matching with One Gap | 2014-06-30 | Paper |
| Approximate On-line Palindrome Recognition, and Applications | 2014-06-30 | Paper |
| Range LCP | 2014-06-10 | Paper |
| Closest periodic vectors in \(L_p\) spaces | 2014-04-16 | Paper |
| Multiply Balanced k −Partitioning | 2014-03-31 | Paper |
| Detecting approximate periodic patterns | 2014-03-13 | Paper |
| Pattern Matching with Non Overlapping Reversals - Approximation and On-line Algorithms | 2014-01-14 | Paper |
| Detecting Approximate Periodic Patterns | 2013-04-19 | Paper |
| Configurations and Minority in the String Consensus Problem | 2013-04-08 | Paper |
| Quasi-distinct parsing and optimal compression methods | 2012-05-14 | Paper |
| Towards a theory of patches | 2012-05-11 | Paper |
| Range LCP | 2011-12-16 | Paper |
| Closest Periodic Vectors in L p Spaces | 2011-12-16 | Paper |
| Efficient algorithms for consensus string problems minimizing both distance sum and radius | 2011-10-10 | Paper |
| Approximate string matching with stuck address bits | 2011-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3007240 | 2011-06-21 | Paper |
| Approximate Periodicity | 2010-12-09 | Paper |
| Cycle Detection and Correction | 2010-09-07 | Paper |
| On the Cost of Interchange Rearrangement in Strings | 2010-09-06 | Paper |
| Parameterized matching on non-linear structures | 2010-08-20 | Paper |
| Weighted LCS | 2010-08-18 | Paper |
| Pattern matching with address errors | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579428 | 2010-08-06 | Paper |
| String Rearrangement Metrics: A Survey | 2010-05-04 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| Two-Dimensional Pattern Matching with Rotations | 2010-04-06 | Paper |
| Improved approximate common interval | 2010-03-24 | Paper |
| Faster two dimensional scaled matching | 2010-02-23 | Paper |
| Weighted LCS | 2009-12-11 | Paper |
| Approximate string matching with address bit errors | 2009-11-18 | Paper |
| Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances | 2009-10-09 | Paper |
| Pattern matching with address errors: rearrangement distances | 2009-07-24 | Paper |
| Quasi-distinct Parsing and Optimal Compression Methods | 2009-07-07 | Paper |
| Real two dimensional scaled matching | 2009-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5506324 | 2009-01-28 | Paper |
| Generalized LCS | 2009-01-08 | Paper |
| Let sleeping files lie: Pattern matching in Z-compressed files. | 2008-12-21 | Paper |
| On the Cost of Interchange Rearrangement in Strings | 2008-09-25 | Paper |
| Computing similarity of run-length encoded strings with affine gap penalty | 2008-07-10 | Paper |
| Property matching and weighted matching | 2008-07-10 | Paper |
| Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications | 2008-06-17 | Paper |
| Two-Dimensional Range Minimum Queries | 2008-06-17 | Paper |
| Approximate String Matching with Address Bit Errors | 2008-06-17 | Paper |
| Generalized function matching | 2008-01-11 | Paper |
| Efficient one-dimensional real scaled matching | 2007-10-30 | Paper |
| Asynchronous Pattern Matching | 2007-09-14 | Paper |
| Property Matching and Weighted Matching | 2007-09-14 | Paper |
| Faster Two Dimensional Scaled Matching | 2007-09-14 | Paper |
| Approximate Matching in Weighted Sequences | 2007-09-14 | Paper |
| Swap and mismatch edit distance | 2007-06-21 | Paper |
| Faster two-dimensional pattern matching with rotations | 2007-01-22 | Paper |
| String Processing and Information Retrieval | 2006-10-24 | Paper |
| Function Matching | 2006-06-01 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| THEORETICAL ISSUES OF SEARCHING AERIAL PHOTOGRAPHS: A BIRD'S EYE VIEW | 2005-12-15 | Paper |
| Combinatorial Pattern Matching | 2005-12-14 | Paper |
| Combinatorial Pattern Matching | 2005-09-07 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024776 | 2005-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828959 | 2004-11-29 | Paper |
| Two-dimensional pattern matching with rotations | 2004-10-27 | Paper |
| Faster algorithms for string matching with k mismatches | 2004-10-01 | Paper |
| The submatrices character count problem: An efficient solution using separable values | 2004-08-06 | Paper |
| Efficient text fingerprinting via Parikh mapping | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472453 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471383 | 2004-07-28 | Paper |
| Inplace 2D matching in compressed images | 2004-03-14 | Paper |
| Some connections between bounded query classes and non-uniform complexity. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449230 | 2004-02-08 | Paper |
| Overlap matching. | 2003-08-19 | Paper |
| Inplace run-length 2d compressed search. | 2003-08-17 | Paper |
| Approximate swapped matching. | 2003-01-21 | Paper |
| Real scaled matching | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768306 | 2002-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768309 | 2002-01-30 | Paper |
| Text Indexing and Dictionary Matching with One Error | 2001-04-02 | Paper |
| Alphabet-Independent and Scaled Dictionary Matching | 2001-03-12 | Paper |
| Pattern Matching with Swaps | 2000-12-19 | Paper |
| The Power of Migration in Multiprocessor Scheduling of Real-Time Systems | 2000-10-18 | Paper |
| Pattern Matching in Hypertext | 2000-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952702 | 2000-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952704 | 2000-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952705 | 2000-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250186 | 1999-06-17 | Paper |
| Optimal parallel two dimensional text searching on a CREW PRAM | 1999-03-25 | Paper |
| Two-Dimensional Periodicity in Rectangular Arrays | 1998-05-10 | Paper |
| A new and versatile method for association generation | 1998-04-13 | Paper |
| Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms | 1998-02-10 | Paper |
| Inverse Pattern Matching | 1997-10-20 | Paper |
| Optimal Two-Dimensional Compressed Matching | 1997-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128934 | 1997-10-05 | Paper |
| Efficient matching of nonrectangular shapes. | 1997-05-13 | Paper |
| Dynamic dictionary matching | 1996-02-26 | Paper |
| Improved dynamic dictionary matching | 1995-08-02 | Paper |
| Efficient 2-dimensional approximate matching of half-rectangular figures | 1995-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763432 | 1995-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138911 | 1994-09-20 | Paper |
| An Alphabet Independent Approach to Two-Dimensional Pattern Matching | 1994-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140443 | 1994-01-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4271921 | 1993-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138956 | 1993-10-20 | Paper |
| Two-dimensional dictionary matching | 1993-05-16 | Paper |
| Efficient pattern matching with scaling | 1992-06-28 | Paper |
| Fast parallel and serial multidimensional approximate array matching | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4206393 | 1990-01-01 | Paper |
| A fast feasibility test for relocation problems | 1988-01-01 | Paper |
| Polynomial terse sets | 1988-01-01 | Paper |
| Relocation problems are hard | 1988-01-01 | Paper |
| Preservation of expressive completeness in temporal models | 1987-01-01 | Paper |
| Expressive completeness failure in branching time structures | 1987-01-01 | Paper |
| A direct linear-time planarity test for unflippable modules | 1987-01-01 | Paper |
| Separation in nonlinear time models | 1985-01-01 | Paper |
| A syntactical definition of the problem | 1985-01-01 | Paper |
| Polynomial computations in non-deterministic loop-programs and PL-programs | 1983-01-01 | Paper |
