Amihood Amir

From MaRDI portal
Person:287044

Available identifiers

zbMath Open amir.amihoodDBLPa/AAmirWikidataQ6603448 ScholiaQ6603448MaRDI QIDQ287044

List of research outcomes





PublicationDate of PublicationType
On suffix tree detection2024-08-27Paper
On suffix tree detection2024-05-29Paper
Reconstructing parameterized strings from parameterized suffix and LCP arrays2024-02-23Paper
https://portal.mardi4nfdi.de/entity/Q60654732023-11-14Paper
Reconstructing parameterized strings from parameterized suffix and LCP arrays2023-08-04Paper
Searching for a modified pattern in a changing text2023-07-28Paper
https://portal.mardi4nfdi.de/entity/Q60987752023-06-14Paper
Double string tandem repeats2023-04-21Paper
https://portal.mardi4nfdi.de/entity/Q58744282023-02-07Paper
Analysis of the Period Recovery Error Bound2023-02-07Paper
Adaptive Exact Learning in a Mixed-Up World: Dealing with Periodicity, Errors and Jumbled-Index Queries in String Reconstruction2022-12-22Paper
Approximating the Anticover of a String2022-12-22Paper
Multidimensional Period Recovery2022-12-22Paper
Pattern matching in hypertext2022-08-19Paper
Cartesian Tree Matching and Indexing2022-07-18Paper
https://portal.mardi4nfdi.de/entity/Q50888932022-07-18Paper
Multidimensional period recovery2022-06-01Paper
Repetition Detection in a Dynamic String2022-05-11Paper
Longest common substring made fully dynamic2022-05-11Paper
https://portal.mardi4nfdi.de/entity/Q50095592021-08-04Paper
Longest Common Factor After One Edit Operation2021-02-16Paper
Towards a real time algorithm for parameterized longest common prefix computation2021-01-25Paper
Quasi-Periodicity Under Mismatch Errors2020-12-16Paper
Locally Maximal Common Factors as a Tool for Efficient Dynamic String Algorithms.2020-12-16Paper
Online recognition of dictionary with one gap2020-12-15Paper
Dynamic and internal longest common substring2020-11-11Paper
Finding patterns and periods in Cartesian tree matching2020-10-22Paper
https://portal.mardi4nfdi.de/entity/Q51108922020-05-25Paper
https://portal.mardi4nfdi.de/entity/Q51108912020-05-25Paper
Finding periods in Cartesian tree matching2020-02-25Paper
Two-dimensional maximal repetitions2020-02-20Paper
Approximate cover of strings2019-10-07Paper
Can we recover the cover?2019-05-21Paper
Mind the gap!2019-05-17Paper
Optimal two-dimensional compressed matching2019-04-29Paper
Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap2018-04-19Paper
Period recovery of strings over the Hamming and edit distances2018-02-16Paper
String cadences2017-11-06Paper
Two strings at Hamming distance 1 cannot be both quasiperiodic2017-09-19Paper
On representations of ternary order relations in numeric strings2017-07-17Paper
Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings2017-02-06Paper
On the relationship between histogram indexing and block-mass indexing2017-01-13Paper
Online timestamped text indexing2016-06-16Paper
Efficient special cases of pattern matching with swaps2016-06-09Paper
Configurations and minority in the string consensus problem2016-05-31Paper
An improved deterministic algorithm for generating different many-element random samples2016-05-26Paper
Period Recovery over the Hamming and Edit Distances2016-05-03Paper
Dynamic text and static pattern matching2015-09-02Paper
On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling2015-08-20Paper
Dictionary matching with a few gaps2015-06-01Paper
Approximate periodicity2015-05-04Paper
Hypertext Searching - A Survey2015-02-10Paper
Cycle detection and correction2014-12-05Paper
A PTAS for the square tiling problem2014-12-02Paper
Managing unbounded-length keys in comparison-driven data structures with applications to online indexing2014-11-14Paper
On the hardness of the consensus string problem2014-08-13Paper
On Hardness of Jumbled Indexing2014-07-01Paper
Approximate On-line Palindrome Recognition, and Applications2014-06-30Paper
Dictionary Matching with One Gap2014-06-30Paper
On the Efficiency of the Hamming C-Centerstring Problems2014-06-30Paper
Range LCP2014-06-10Paper
Closest periodic vectors in \(L_p\) spaces2014-04-16Paper
Multiply Balanced k −Partitioning2014-03-31Paper
Detecting approximate periodic patterns2014-03-13Paper
Pattern Matching with Non Overlapping Reversals - Approximation and On-line Algorithms2014-01-14Paper
Detecting Approximate Periodic Patterns2013-04-19Paper
Configurations and Minority in the String Consensus Problem2013-04-08Paper
Quasi-distinct parsing and optimal compression methods2012-05-14Paper
Towards a theory of patches2012-05-11Paper
Closest Periodic Vectors in L p Spaces2011-12-16Paper
Range LCP2011-12-16Paper
Weighted shortest common supersequence2011-10-28Paper
Efficient algorithms for consensus string problems minimizing both distance sum and radius2011-10-10Paper
Approximate string matching with stuck address bits2011-07-14Paper
https://portal.mardi4nfdi.de/entity/Q30072402011-06-21Paper
Approximate Periodicity2010-12-09Paper
Cycle Detection and Correction2010-09-07Paper
On the Cost of Interchange Rearrangement in Strings2010-09-06Paper
Parameterized matching on non-linear structures2010-08-20Paper
Weighted LCS2010-08-18Paper
Pattern matching with address errors2010-08-16Paper
https://portal.mardi4nfdi.de/entity/Q35794282010-08-06Paper
String Rearrangement Metrics: A Survey2010-05-04Paper
Algorithms and Data Structures2010-04-20Paper
Algorithms and Data Structures2010-04-20Paper
Two-Dimensional Pattern Matching with Rotations2010-04-06Paper
Improved approximate common interval2010-03-24Paper
Faster two dimensional scaled matching2010-02-23Paper
Weighted LCS2009-12-11Paper
Approximate string matching with address bit errors2009-11-18Paper
Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances2009-10-09Paper
Pattern matching with address errors: rearrangement distances2009-07-24Paper
Quasi-distinct Parsing and Optimal Compression Methods2009-07-07Paper
Real two dimensional scaled matching2009-06-17Paper
The practical efficiency of convolutions in pattern matching algorithms2009-01-28Paper
Generalized LCS2009-01-08Paper
Let sleeping files lie: Pattern matching in Z-compressed files.2008-12-21Paper
On the Cost of Interchange Rearrangement in Strings2008-09-25Paper
Property matching and weighted matching2008-07-10Paper
Computing similarity of run-length encoded strings with affine gap penalty2008-07-10Paper
Two-Dimensional Range Minimum Queries2008-06-17Paper
Approximate String Matching with Address Bit Errors2008-06-17Paper
Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications2008-06-17Paper
Generalized function matching2008-01-11Paper
Efficient one-dimensional real scaled matching2007-10-30Paper
Approximate Matching in Weighted Sequences2007-09-14Paper
Property Matching and Weighted Matching2007-09-14Paper
Faster Two Dimensional Scaled Matching2007-09-14Paper
Asynchronous Pattern Matching2007-09-14Paper
Swap and mismatch edit distance2007-06-21Paper
Faster two-dimensional pattern matching with rotations2007-01-22Paper
String Processing and Information Retrieval2006-10-24Paper
Function Matching2006-06-01Paper
Algorithms and Computation2005-12-22Paper
THEORETICAL ISSUES OF SEARCHING AERIAL PHOTOGRAPHS: A BIRD'S EYE VIEW2005-12-15Paper
Combinatorial Pattern Matching2005-12-14Paper
Combinatorial Pattern Matching2005-09-07Paper
Algorithms – ESA 20042005-08-18Paper
https://portal.mardi4nfdi.de/entity/Q30247762005-07-04Paper
https://portal.mardi4nfdi.de/entity/Q48289592004-11-29Paper
Two-dimensional pattern matching with rotations2004-10-27Paper
Faster algorithms for string matching with k mismatches2004-10-01Paper
Efficient text fingerprinting via Parikh mapping2004-08-06Paper
The submatrices character count problem: An efficient solution using separable values2004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44724532004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44713832004-07-28Paper
Inplace 2D matching in compressed images2004-03-14Paper
Some connections between bounded query classes and non-uniform complexity.2004-03-14Paper
https://portal.mardi4nfdi.de/entity/Q44492302004-02-08Paper
Overlap matching.2003-08-19Paper
Inplace run-length 2d compressed search.2003-08-17Paper
Approximate swapped matching.2003-01-21Paper
Real scaled matching2002-07-25Paper
Overlap matching2002-06-18Paper
Approximate subset matching with don't cares2002-01-30Paper
Genetic threading2001-10-28Paper
Text Indexing and Dictionary Matching with One Error2001-04-02Paper
Alphabet-Independent and Scaled Dictionary Matching2001-03-12Paper
Pattern Matching with Swaps2000-12-19Paper
The Power of Migration in Multiprocessor Scheduling of Real-Time Systems2000-10-18Paper
Pattern Matching in Hypertext2000-10-04Paper
https://portal.mardi4nfdi.de/entity/Q49527022000-05-10Paper
https://portal.mardi4nfdi.de/entity/Q49527052000-05-10Paper
https://portal.mardi4nfdi.de/entity/Q49527042000-05-10Paper
https://portal.mardi4nfdi.de/entity/Q42501861999-06-17Paper
Optimal parallel two dimensional text searching on a CREW PRAM1999-03-25Paper
Two-Dimensional Periodicity in Rectangular Arrays1998-05-10Paper
A new and versatile method for association generation1998-04-13Paper
Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms1998-02-10Paper
Inverse Pattern Matching1997-10-20Paper
Optimal Two-Dimensional Compressed Matching1997-10-20Paper
https://portal.mardi4nfdi.de/entity/Q31289341997-10-05Paper
Efficient matching of nonrectangular shapes.1997-05-13Paper
Dynamic dictionary matching1996-02-26Paper
Improved dynamic dictionary matching1995-08-02Paper
Efficient 2-dimensional approximate matching of half-rectangular figures1995-05-28Paper
https://portal.mardi4nfdi.de/entity/Q47634321995-04-11Paper
https://portal.mardi4nfdi.de/entity/Q31389111994-09-20Paper
An Alphabet Independent Approach to Two-Dimensional Pattern Matching1994-05-10Paper
https://portal.mardi4nfdi.de/entity/Q31404431994-01-02Paper
https://portal.mardi4nfdi.de/entity/Q42719211993-12-12Paper
https://portal.mardi4nfdi.de/entity/Q31389561993-10-20Paper
Two-dimensional dictionary matching1993-05-16Paper
Efficient pattern matching with scaling1992-06-28Paper
Fast parallel and serial multidimensional approximate array matching1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42063931990-01-01Paper
A fast feasibility test for relocation problems1988-01-01Paper
Relocation problems are hard1988-01-01Paper
Polynomial terse sets1988-01-01Paper
Preservation of expressive completeness in temporal models1987-01-01Paper
Expressive completeness failure in branching time structures1987-01-01Paper
A direct linear-time planarity test for unflippable modules1987-01-01Paper
A syntactical definition of the problem1985-01-01Paper
Separation in nonlinear time models1985-01-01Paper
Polynomial computations in non-deterministic loop-programs and PL-programs1983-01-01Paper

Research outcomes over time

This page was built for person: Amihood Amir