| Publication | Date of Publication | Type |
|---|
On suffix tree detection
Theoretical Computer Science | 2024-08-27 | Paper |
On suffix tree detection
| 2024-05-29 | Paper |
Reconstructing parameterized strings from parameterized suffix and LCP arrays
Theoretical Computer Science | 2024-02-23 | Paper |
scientific article; zbMATH DE number 7765421 (Why is no real title available?)
| 2023-11-14 | Paper |
Reconstructing parameterized strings from parameterized suffix and LCP arrays
String Processing and Information Retrieval | 2023-08-04 | Paper |
Searching for a modified pattern in a changing text
String Processing and Information Retrieval | 2023-07-28 | Paper |
scientific article; zbMATH DE number 7695991 (Why is no real title available?)
| 2023-06-14 | Paper |
Double string tandem repeats
Algorithmica | 2023-04-21 | Paper |
scientific article; zbMATH DE number 7651094 (Why is no real title available?)
| 2023-02-07 | Paper |
Analysis of the Period Recovery Error Bound
| 2023-02-07 | Paper |
Approximating the Anticover of a String
1511.68349 | 2022-12-22 | Paper |
Multidimensional Period Recovery
1511.6835 | 2022-12-22 | Paper |
Adaptive Exact Learning in a Mixed-Up World: Dealing with Periodicity, Errors and Jumbled-Index Queries in String Reconstruction
1511.68347 | 2022-12-22 | Paper |
Pattern matching in hypertext
Lecture Notes in Computer Science | 2022-08-19 | Paper |
Cartesian Tree Matching and Indexing
| 2022-07-18 | Paper |
scientific article; zbMATH DE number 7559174 (Why is no real title available?)
| 2022-07-18 | Paper |
Multidimensional period recovery
Algorithmica | 2022-06-01 | Paper |
Longest common substring made fully dynamic
| 2022-05-11 | Paper |
Repetition Detection in a Dynamic String
| 2022-05-11 | Paper |
Two-dimensional maximal repetitions
| 2021-08-04 | Paper |
Longest common factor after one edit operation
String Processing and Information Retrieval | 2021-02-16 | Paper |
Towards a real time algorithm for parameterized longest common prefix computation
Theoretical Computer Science | 2021-01-25 | Paper |
Quasi-periodicity under mismatch errors
| 2020-12-16 | Paper |
Locally maximal common factors as a tool for efficient dynamic string algorithms
| 2020-12-16 | Paper |
Online recognition of dictionary with one gap
Information and Computation | 2020-12-15 | Paper |
Dynamic and internal longest common substring
Algorithmica | 2020-11-11 | Paper |
Finding patterns and periods in Cartesian tree matching
Theoretical Computer Science | 2020-10-22 | Paper |
Approximate cover of strings
| 2020-05-25 | Paper |
scientific article; zbMATH DE number 7203330 (Why is no real title available?)
| 2020-05-25 | Paper |
Finding periods in Cartesian tree matching
| 2020-02-25 | Paper |
Two-dimensional maximal repetitions
Theoretical Computer Science | 2020-02-20 | Paper |
Approximate cover of strings
Theoretical Computer Science | 2019-10-07 | Paper |
Can we recover the cover?
Algorithmica | 2019-05-21 | Paper |
Mind the gap!
Algorithmica | 2019-05-17 | Paper |
Optimal two-dimensional compressed matching
Automata, Languages and Programming | 2019-04-29 | Paper |
Mind the gap: essentially optimal algorithms for online dictionary matching with one gap
| 2018-04-19 | Paper |
Period recovery of strings over the Hamming and edit distances
Theoretical Computer Science | 2018-02-16 | Paper |
String cadences
Theoretical Computer Science | 2017-11-06 | Paper |
Two strings at Hamming distance 1 cannot be both quasiperiodic
Information Processing Letters | 2017-09-19 | Paper |
On representations of ternary order relations in numeric strings
Mathematics in Computer Science | 2017-07-17 | Paper |
Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings
Theoretical Computer Science | 2017-02-06 | Paper |
On the relationship between histogram indexing and block-mass indexing
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2017-01-13 | Paper |
Online timestamped text indexing
Information Processing Letters | 2016-06-16 | Paper |
Efficient special cases of pattern matching with swaps
Information Processing Letters | 2016-06-09 | Paper |
Configurations and minority in the string consensus problem
Algorithmica | 2016-05-31 | Paper |
An improved deterministic algorithm for generating different many-element random samples
Information Processing Letters | 2016-05-26 | Paper |
Period recovery over the Hamming and edit distances
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Dynamic text and static pattern matching
ACM Transactions on Algorithms | 2015-09-02 | Paper |
On the hardness of optimal vertex relabeling and restricted vertex relabeling
Combinatorial Pattern Matching | 2015-08-20 | Paper |
Dictionary matching with a few gaps
Theoretical Computer Science | 2015-06-01 | Paper |
Approximate periodicity
Information and Computation | 2015-05-04 | Paper |
Hypertext searching -- a survey
Lecture Notes in Computer Science | 2015-02-10 | Paper |
Cycle detection and correction
ACM Transactions on Algorithms | 2014-12-05 | Paper |
A PTAS for the square tiling problem
Theoretical Computer Science | 2014-12-02 | Paper |
Managing unbounded-length keys in comparison-driven data structures with applications to online indexing
SIAM Journal on Computing | 2014-11-14 | Paper |
On the hardness of the consensus string problem
Information Processing Letters | 2014-08-13 | Paper |
On hardness of jumbled indexing
Automata, Languages, and Programming | 2014-07-01 | Paper |
Approximate On-line Palindrome Recognition, and Applications
Combinatorial Pattern Matching | 2014-06-30 | Paper |
Dictionary matching with one gap
Combinatorial Pattern Matching | 2014-06-30 | Paper |
On the Efficiency of the Hamming C-Centerstring Problems
Combinatorial Pattern Matching | 2014-06-30 | Paper |
Range LCP
Journal of Computer and System Sciences | 2014-06-10 | Paper |
Closest periodic vectors in \(L_p\) spaces
Theoretical Computer Science | 2014-04-16 | Paper |
Multiply balanced \(k\)-partitioning
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Detecting approximate periodic patterns
Theoretical Computer Science | 2014-03-13 | Paper |
Pattern matching with non overlapping reversals -- approximation and on-line algorithms
Algorithms and Computation | 2014-01-14 | Paper |
Detecting Approximate Periodic Patterns
Lecture Notes in Computer Science | 2013-04-19 | Paper |
Configurations and minority in the string consensus problem
String Processing and Information Retrieval | 2013-04-08 | Paper |
Quasi-distinct parsing and optimal compression methods
Theoretical Computer Science | 2012-05-14 | Paper |
Towards a theory of patches
Journal of Discrete Algorithms | 2012-05-11 | Paper |
Closest periodic vectors in \(L_p\) spaces
Algorithms and Computation | 2011-12-16 | Paper |
Range LCP
Algorithms and Computation | 2011-12-16 | Paper |
Weighted shortest common supersequence
| 2011-10-28 | Paper |
Efficient algorithms for consensus string problems minimizing both distance sum and radius
Theoretical Computer Science | 2011-10-10 | Paper |
Approximate string matching with stuck address bits
Theoretical Computer Science | 2011-07-14 | Paper |
Two glass balls and a tower
| 2011-06-21 | Paper |
Approximate Periodicity
Algorithms and Computation | 2010-12-09 | Paper |
Cycle detection and correction
Automata, Languages and Programming | 2010-09-07 | Paper |
On the cost of interchange rearrangement in strings
SIAM Journal on Computing | 2010-09-06 | Paper |
Parameterized matching on non-linear structures
Information Processing Letters | 2010-08-20 | Paper |
Weighted LCS
Journal of Discrete Algorithms | 2010-08-18 | Paper |
Pattern matching with address errors
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
scientific article; zbMATH DE number 5764836 (Why is no real title available?)
| 2010-08-06 | Paper |
String rearrangement metrics: a survey
Algorithms and Applications | 2010-05-04 | Paper |
Dynamic text and static pattern matching.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Real two dimensional scaled matching.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Two-dimensional pattern matching with rotations
Combinatorial Pattern Matching | 2010-04-06 | Paper |
Improved approximate common interval
Information Processing Letters | 2010-03-24 | Paper |
Faster two dimensional scaled matching
Algorithmica | 2010-02-23 | Paper |
Weighted LCS (extended abstract)
Lecture Notes in Computer Science | 2009-12-11 | Paper |
Approximate string matching with address bit errors
Theoretical Computer Science | 2009-11-18 | Paper |
Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances
Theoretical Computer Science | 2009-10-09 | Paper |
Pattern matching with address errors: rearrangement distances
Journal of Computer and System Sciences | 2009-07-24 | Paper |
Quasi-distinct Parsing and Optimal Compression Methods
Combinatorial Pattern Matching | 2009-07-07 | Paper |
Real two dimensional scaled matching
Algorithmica | 2009-06-17 | Paper |
The practical efficiency of convolutions in pattern matching algorithms
| 2009-01-28 | Paper |
Generalized LCS
Theoretical Computer Science | 2009-01-08 | Paper |
Let sleeping files lie: Pattern matching in Z-compressed files.
Journal of Computer and System Sciences | 2008-12-21 | Paper |
On the Cost of Interchange Rearrangement in Strings
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Property matching and weighted matching
Theoretical Computer Science | 2008-07-10 | Paper |
Computing similarity of run-length encoded strings with affine gap penalty
Theoretical Computer Science | 2008-07-10 | Paper |
Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications
Combinatorial Pattern Matching | 2008-06-17 | Paper |
Two-Dimensional Range Minimum Queries
Combinatorial Pattern Matching | 2008-06-17 | Paper |
Approximate String Matching with Address Bit Errors
Combinatorial Pattern Matching | 2008-06-17 | Paper |
Generalized function matching
Journal of Discrete Algorithms | 2008-01-11 | Paper |
Efficient one-dimensional real scaled matching
Journal of Discrete Algorithms | 2007-10-30 | Paper |
Approximate Matching in Weighted Sequences
Combinatorial Pattern Matching | 2007-09-14 | Paper |
Property Matching and Weighted Matching
Combinatorial Pattern Matching | 2007-09-14 | Paper |
Faster Two Dimensional Scaled Matching
Combinatorial Pattern Matching | 2007-09-14 | Paper |
Asynchronous Pattern Matching
Combinatorial Pattern Matching | 2007-09-14 | Paper |
Swap and mismatch edit distance
Algorithmica | 2007-06-21 | Paper |
Faster two-dimensional pattern matching with rotations
Theoretical Computer Science | 2007-01-22 | Paper |
String Processing and Information Retrieval
Lecture Notes in Computer Science | 2006-10-24 | Paper |
Function Matching
SIAM Journal on Computing | 2006-06-01 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
THEORETICAL ISSUES OF SEARCHING AERIAL PHOTOGRAPHS: A BIRD'S EYE VIEW
International Journal of Foundations of Computer Science | 2005-12-15 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
scientific article; zbMATH DE number 2185612 (Why is no real title available?)
| 2005-07-04 | Paper |
scientific article; zbMATH DE number 2119688 (Why is no real title available?)
| 2004-11-29 | Paper |
Two-dimensional pattern matching with rotations
Theoretical Computer Science | 2004-10-27 | Paper |
Faster algorithms for string matching with k mismatches
Journal of Algorithms | 2004-10-01 | Paper |
Efficient text fingerprinting via Parikh mapping
Journal of Discrete Algorithms | 2004-08-06 | Paper |
The submatrices character count problem: An efficient solution using separable values
Information and Computation | 2004-08-06 | Paper |
scientific article; zbMATH DE number 2080211 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 2079423 (Why is no real title available?)
| 2004-07-28 | Paper |
Inplace 2D matching in compressed images
Journal of Algorithms | 2004-03-14 | Paper |
Some connections between bounded query classes and non-uniform complexity.
Information and Computation | 2004-03-14 | Paper |
scientific article; zbMATH DE number 2038765 (Why is no real title available?)
| 2004-02-08 | Paper |
Overlap matching.
Information and Computation | 2003-08-19 | Paper |
Inplace run-length 2d compressed search.
Theoretical Computer Science | 2003-08-17 | Paper |
Approximate swapped matching.
Information Processing Letters | 2003-01-21 | Paper |
Real scaled matching
Information Processing Letters | 2002-07-25 | Paper |
Overlap matching
| 2002-06-18 | Paper |
Approximate subset matching with don't cares
| 2002-01-30 | Paper |
Genetic threading
Constraints | 2001-10-28 | Paper |
Text Indexing and Dictionary Matching with One Error
Journal of Algorithms | 2001-04-02 | Paper |
Alphabet-Independent and Scaled Dictionary Matching
Journal of Algorithms | 2001-03-12 | Paper |
Pattern Matching with Swaps
Journal of Algorithms | 2000-12-19 | Paper |
The Power of Migration in Multiprocessor Scheduling of Real-Time Systems
SIAM Journal on Computing | 2000-10-18 | Paper |
Pattern Matching in Hypertext
Journal of Algorithms | 2000-10-04 | Paper |
scientific article; zbMATH DE number 1445382 (Why is no real title available?)
| 2000-05-10 | Paper |
scientific article; zbMATH DE number 1445381 (Why is no real title available?)
| 2000-05-10 | Paper |
scientific article; zbMATH DE number 1445379 (Why is no real title available?)
| 2000-05-10 | Paper |
scientific article; zbMATH DE number 1303561 (Why is no real title available?)
| 1999-06-17 | Paper |
Optimal parallel two dimensional text searching on a CREW PRAM
Information and Computation | 1999-03-25 | Paper |
Two-Dimensional Periodicity in Rectangular Arrays
SIAM Journal on Computing | 1998-05-10 | Paper |
A new and versatile method for association generation
Information Systems | 1998-04-13 | Paper |
Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms
SIAM Journal on Computing | 1998-02-10 | Paper |
Optimal Two-Dimensional Compressed Matching
Journal of Algorithms | 1997-10-20 | Paper |
Inverse Pattern Matching
Journal of Algorithms | 1997-10-20 | Paper |
scientific article; zbMATH DE number 1003304 (Why is no real title available?)
| 1997-10-05 | Paper |
Efficient matching of nonrectangular shapes.
Annals of Mathematics and Artificial Intelligence | 1997-05-13 | Paper |
Dynamic dictionary matching
Journal of Computer and System Sciences | 1996-02-26 | Paper |
Improved dynamic dictionary matching
Information and Computation | 1995-08-02 | Paper |
Efficient 2-dimensional approximate matching of half-rectangular figures
Information and Computation | 1995-05-28 | Paper |
scientific article; zbMATH DE number 742992 (Why is no real title available?)
| 1995-04-11 | Paper |
scientific article; zbMATH DE number 432781 (Why is no real title available?)
| 1994-09-20 | Paper |
An Alphabet Independent Approach to Two-Dimensional Pattern Matching
SIAM Journal on Computing | 1994-05-10 | Paper |
scientific article; zbMATH DE number 437564 (Why is no real title available?)
| 1994-01-02 | Paper |
scientific article; zbMATH DE number 465526 (Why is no real title available?)
| 1993-12-12 | Paper |
scientific article; zbMATH DE number 432822 (Why is no real title available?)
| 1993-10-20 | Paper |
Two-dimensional dictionary matching
Information Processing Letters | 1993-05-16 | Paper |
Efficient pattern matching with scaling
Journal of Algorithms | 1992-06-28 | Paper |
Fast parallel and serial multidimensional approximate array matching
Theoretical Computer Science | 1991-01-01 | Paper |
scientific article; zbMATH DE number 4126689 (Why is no real title available?)
| 1990-01-01 | Paper |
A fast feasibility test for relocation problems
European Journal of Operational Research | 1988-01-01 | Paper |
Relocation problems are hard
International Journal of Computer Mathematics | 1988-01-01 | Paper |
Polynomial terse sets
Information and Computation | 1988-01-01 | Paper |
Expressive completeness failure in branching time structures
Journal of Computer and System Sciences | 1987-01-01 | Paper |
A direct linear-time planarity test for unflippable modules
International Journal of Computer Mathematics | 1987-01-01 | Paper |
Preservation of expressive completeness in temporal models
Information and Computation | 1987-01-01 | Paper |
A syntactical definition of the problem
International Journal of Computer Mathematics | 1985-01-01 | Paper |
Separation in nonlinear time models
Information and Control | 1985-01-01 | Paper |
Polynomial computations in non-deterministic loop-programs and PL-programs
International Journal of Computer Mathematics | 1983-01-01 | Paper |
