The following pages link to Amihood Amir (Q287044):
Displaying 50 items.
- An improved deterministic algorithm for generating different many-element random samples (Q287046) (← links)
- Configurations and minority in the string consensus problem (Q289911) (← links)
- Efficient special cases of pattern matching with swaps (Q293429) (← links)
- Online timestamped text indexing (Q294884) (← links)
- On the hardness of the consensus string problem (Q396596) (← links)
- Towards a theory of patches (Q414472) (← links)
- Quasi-distinct parsing and optimal compression methods (Q417983) (← links)
- A PTAS for the square tiling problem (Q476839) (← links)
- Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings (Q507391) (← links)
- Approximate string matching with stuck address bits (Q551176) (← links)
- The submatrices character count problem: An efficient solution using separable values (Q598188) (← links)
- Efficient algorithms for consensus string problems minimizing both distance sum and radius (Q719265) (← links)
- Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances (Q732031) (← links)
- Faster two dimensional scaled matching (Q848963) (← links)
- Faster two-dimensional pattern matching with rotations (Q859847) (← links)
- Pattern matching with address errors: rearrangement distances (Q923879) (← links)
- Computing similarity of run-length encoded strings with affine gap penalty (Q932322) (← links)
- Property matching and weighted matching (Q932325) (← links)
- Let sleeping files lie: Pattern matching in Z-compressed files. (Q960470) (← links)
- Parameterized matching on non-linear structures (Q989510) (← links)
- Real two dimensional scaled matching (Q1024780) (← links)
- Approximate string matching with address bit errors (Q1038472) (← links)
- Preservation of expressive completeness in temporal models (Q1090324) (← links)
- A fast feasibility test for relocation problems (Q1099778) (← links)
- Polynomial terse sets (Q1104077) (← links)
- Expressive completeness failure in branching time structures (Q1109759) (← links)
- Two-dimensional dictionary matching (Q1209347) (← links)
- Optimal parallel two dimensional text searching on a CREW PRAM (Q1271473) (← links)
- Dynamic dictionary matching (Q1337462) (← links)
- Efficient matching of nonrectangular shapes. (Q1354075) (← links)
- A new and versatile method for association generation (Q1384178) (← links)
- Inplace run-length 2d compressed search. (Q1401164) (← links)
- Overlap matching. (Q1401926) (← links)
- Some connections between bounded query classes and non-uniform complexity. (Q1426008) (← links)
- Real scaled matching (Q1606937) (← links)
- String cadences (Q1676299) (← links)
- Period recovery of strings over the Hamming and edit distances (Q1698696) (← links)
- Efficient text fingerprinting via Parikh mapping (Q1827267) (← links)
- Approximate swapped matching. (Q1853034) (← links)
- Two-dimensional pattern matching with rotations (Q1884920) (← links)
- Efficient 2-dimensional approximate matching of half-rectangular figures (Q1891128) (← links)
- Improved dynamic dictionary matching (Q1893741) (← links)
- Multidimensional period recovery (Q2144266) (← links)
- Finding patterns and periods in Cartesian tree matching (Q2207506) (← links)
- Dynamic and internal longest common substring (Q2211363) (← links)
- Online recognition of dictionary with one gap (Q2216131) (← links)
- Towards a real time algorithm for parameterized longest common prefix computation (Q2220836) (← links)
- Fast parallel and serial multidimensional approximate array matching (Q2277849) (← links)
- Two-dimensional maximal repetitions (Q2297850) (← links)
- Finding periods in Cartesian tree matching (Q2301735) (← links)
