| Year |
Citation |
Score |
| 2021 |
Amir A, Kondratovsky E. Towards a real time algorithm for parameterized longest common prefix computation Theoretical Computer Science. 852: 132-137. DOI: 10.1016/j.tcs.2020.11.023 |
0.319 |
|
| 2020 |
Park SG, Bataa M, Amir A, Landau GM, Park K. Finding patterns and periods in Cartesian tree matching Theoretical Computer Science. DOI: 10.1016/J.Tcs.2020.09.014 |
0.527 |
|
| 2020 |
Amir A, Landau GM, Marcus S, Sokol D. Two-Dimensional Maximal Repetitions Theoretical Computer Science. 812: 49-61. DOI: 10.1016/J.Tcs.2019.07.006 |
0.422 |
|
| 2020 |
Amir A, Charalampopoulos P, Pissis SP, Radoszewski J. Dynamic and Internal Longest Common Substring Algorithmica. 1-37. DOI: 10.1007/S00453-020-00744-0 |
0.408 |
|
| 2019 |
Amir A, Levy A, Lubin R, Porat E. Approximate cover of strings Theoretical Computer Science. 793: 59-69. DOI: 10.1016/J.Tcs.2019.05.020 |
0.35 |
|
| 2019 |
Amir A, Levy A, Lewenstein M, Lubin R, Porat B. Can We Recover the Cover Algorithmica. 81: 2857-2875. DOI: 10.1007/S00453-019-00559-8 |
0.398 |
|
| 2018 |
Zhou X, Amir A, Guerra C, Landau G, Rossignac J. EDoP Distance Between Sets of Incomplete Permutations: Application to Bacteria Classification Based on Gene Order. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. PMID 30113868 DOI: 10.1089/Cmb.2018.0063 |
0.313 |
|
| 2017 |
Amir A, Amit M, Landau GM, Sokol D. Period recovery of strings over the Hamming and edit distances Theoretical Computer Science. 710: 2-18. DOI: 10.1016/J.Tcs.2017.10.026 |
0.361 |
|
| 2017 |
Amir A, Iliopoulos CS, Radoszewski J. Two strings at Hamming distance 1 cannot be both quasiperiodic Information Processing Letters. 128: 54-57. DOI: 10.1016/J.Ipl.2017.08.005 |
0.326 |
|
| 2016 |
Amir A, Paryenty H, Roditty L. Configurations and Minority in the String Consensus Problem Algorithmica. 74: 1267-1292. DOI: 10.1007/S00453-015-9996-7 |
0.46 |
|
| 2015 |
Amir A, Apostolico A, Hirst T, Landau GM, Lewenstein N, Rozenberg L. Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on run-length encoded strings Theoretical Computer Science. DOI: 10.1016/J.Tcs.2016.04.030 |
0.457 |
|
| 2015 |
Amir A, Levy A, Porat E, Shalom BR. Dictionary matching with a few gaps Theoretical Computer Science. 589: 34-46. DOI: 10.1016/J.Tcs.2015.04.011 |
0.362 |
|
| 2015 |
Amir A, Apostolico A, Landau GM, Porat E, Sar Shalom O. A PTAS for the Square Tiling Problem Theoretical Computer Science. 562: 33-45. DOI: 10.1016/J.Tcs.2014.09.012 |
0.388 |
|
| 2015 |
Amir A, Eisenberg E, Levy A. Approximate periodicity Information and Computation. 241: 215-226. DOI: 10.1016/J.Ic.2015.02.004 |
0.434 |
|
| 2014 |
Amir A, Butman A, Porat E. On the relationship between histogram indexing and block-mass indexing. Philosophical Transactions. Series a, Mathematical, Physical, and Engineering Sciences. 372: 20130132. PMID 24751866 DOI: 10.1098/Rsta.2013.0132 |
0.472 |
|
| 2014 |
Amir A, Eisenberg E, Levy A, Lewenstein N. Closest periodic vectors in Lp spaces Theoretical Computer Science. 533: 26-36. DOI: 10.1016/J.Tcs.2014.03.019 |
0.423 |
|
| 2014 |
Amir A, Apostolico A, Eisenberg E, Landau GM, Levy A, Lewenstein N. Detecting approximate periodic patterns Theoretical Computer Science. 525: 60-67. DOI: 10.1016/J.Tcs.2013.05.001 |
0.534 |
|
| 2013 |
Amir A, Paryenty H, Roditty L. On the hardness of the Consensus String problem Information Processing Letters. 113: 371-374. DOI: 10.1016/J.Ipl.2013.02.016 |
0.385 |
|
| 2012 |
Amir A, Eisenberg E, Levy A, Porat E, Shapira N. Cycle detection and correction Acm Transactions On Algorithms. 9: 13. DOI: 10.1145/2390176.2390189 |
0.421 |
|
| 2012 |
Amir A, Aumann Y, Levy A, Roshko Y. Quasi-distinct parsing and optimal compression methods Theoretical Computer Science. 422: 1-14. DOI: 10.1016/J.Tcs.2011.11.022 |
0.315 |
|
| 2012 |
Amir A, Paryenty H. Towards a theory of patches Journal of Discrete Algorithms. 12: 61-73. DOI: 10.1016/J.Jda.2011.12.022 |
0.502 |
|
| 2012 |
Amir A, Parida L. Preface: Combinatorial Pattern Matching (CPM 2010) Information & Computation. 213: 1. DOI: 10.1016/J.Ic.2012.02.001 |
0.365 |
|
| 2011 |
Amir A, Landau GM, Na JC, Park H, Park K, Sim JS. Efficient algorithms for consensus string problems minimizing both distance sum and radius Theoretical Computer Science. 412: 5239-5246. DOI: 10.1016/J.Tcs.2011.05.034 |
0.49 |
|
| 2011 |
Amir A, Eisenberg E, Keller O, Levy A, Porat E. Approximate string matching with stuck address bits Theoretical Computer Science. 412: 3537-3544. DOI: 10.1016/J.Tcs.2011.02.044 |
0.442 |
|
| 2010 |
Amir A, Gotthilf Z, Shalom BR. Weighted LCS Journal of Discrete Algorithms. 8: 273-281. DOI: 10.1016/J.Jda.2010.02.001 |
0.39 |
|
| 2010 |
Amir A, Chencinski E. Faster Two Dimensional Scaled Matching Algorithmica. 56: 214-234. DOI: 10.1007/S00453-008-9173-3 |
0.523 |
|
| 2010 |
Amir A, Parida L. Combinatorial Pattern Matching Lecture Notes in Computer Science. 6129. DOI: 10.1007/978-3-642-13509-5 |
0.364 |
|
| 2009 |
Amir A, Hartman T, Kapah O, Levy A, Porat E. On the Cost of Interchange Rearrangement in Strings Siam Journal On Computing. 39: 1444-1461. DOI: 10.1137/080712969 |
0.325 |
|
| 2009 |
Amir A, Aumann Y, Kapah O, Levy A, Porat E. Approximate string matching with address bit errors Theoretical Computer Science. 410: 5334-5346. DOI: 10.1016/J.Tcs.2009.09.010 |
0.451 |
|
| 2009 |
Amir A, Aumann Y, Indyk P, Levy A, Porat E. Efficient computations of ℓ1 and ℓ∞ rearrangement distances Theoretical Computer Science. 410: 4382-4390. DOI: 10.1016/J.Tcs.2009.07.019 |
0.502 |
|
| 2009 |
Amir A, Aumann Y, Benson G, Levy A, Lipsky O, Porat E, Skiena S, Vishne U. Pattern matching with address errors: Rearrangement distances Journal of Computer and System Sciences. 75: 359-370. DOI: 10.1016/J.Jcss.2009.03.001 |
0.667 |
|
| 2009 |
Amir A, Navarro G. Parameterized matching on non-linear structures Information Processing Letters. 109: 864-867. DOI: 10.1016/J.Ipl.2009.04.012 |
0.477 |
|
| 2009 |
Amir A, Butman A, Lewenstein M, Porat E. Real Two Dimensional Scaled Matching Algorithmica. 53: 314-336. DOI: 10.1007/S00453-007-9021-X |
0.416 |
|
| 2008 |
Amir A, Hartman T, Kapah O, Shalom BR, Tsur D. Generalized LCS Theoretical Computer Science. 409: 438-449. DOI: 10.1016/J.Tcs.2008.08.037 |
0.426 |
|
| 2008 |
Kim JW, Amir A, Landau GM, Park K. Computing similarity of run-length encoded strings with affine gap penalty Theoretical Computer Science. 395: 268-282. DOI: 10.1016/J.Tcs.2008.01.008 |
0.52 |
|
| 2008 |
Amir A, Chencinski E, Iliopoulos C, Kopelowitz T, Zhang H. Property matching and weighted matching Theoretical Computer Science. 395: 298-310. DOI: 10.1016/J.Tcs.2008.01.006 |
0.445 |
|
| 2007 |
Amir A, Landau GM, Lewenstein M, Sokol D. Dynamic text and static pattern matching Acm Transactions On Algorithms. 3: 19. DOI: 10.1145/1240233.1240242 |
0.536 |
|
| 2007 |
Amir A, Nor I. Generalized function matching Journal of Discrete Algorithms. 5: 514-523. DOI: 10.1016/J.Jda.2006.10.001 |
0.425 |
|
| 2007 |
Amir A, Butman A, Lewenstein M, Porat E, Tsur D. Efficient one-dimensional real scaled matching Journal of Discrete Algorithms. 5: 205-211. DOI: 10.1016/J.Jda.2006.03.017 |
0.509 |
|
| 2006 |
Amir A, Kapah O, Tsur D. Faster two-dimensional pattern matching with rotations Theoretical Computer Science. 368: 196-204. DOI: 10.1016/J.Tcs.2006.09.012 |
0.547 |
|
| 2006 |
Amir A, Eisenberg E, Porat E. Swap and mismatch edit distance Algorithmica. 45: 109-120. DOI: 10.1007/S00453-005-1192-8 |
0.443 |
|
| 2005 |
Amir A. Theoretical Issues Of Searching Aerial Photographs: A Bird'S Eye View International Journal of Foundations of Computer Science. 16: 1075-1097. DOI: 10.1142/S0129054105003662 |
0.446 |
|
| 2004 |
Amir A, Butman A, Crochemore M, Landau GM, Schaps M. Two-dimensional pattern matching with rotations Theoretical Computer Science. 314: 173-187. DOI: 10.1016/J.Tcs.2003.10.039 |
0.505 |
|
| 2004 |
Amir A, Church KW, Dar E. The submatrices character count problem: an efficient solution using separable values Information & Computation. 190: 100-116. DOI: 10.1016/J.Ic.2003.12.001 |
0.44 |
|
| 2003 |
Amir A, Apostolico A, Landau GM, Satta G. Efficient text fingerprinting via parikh mapping Journal of Discrete Algorithms. 1: 409-421. DOI: 10.1016/S1570-8667(03)00035-2 |
0.402 |
|
| 2003 |
Amir A, Beigel R, Gasarch W. Some connections between bounded query classes and non-uniform complexity Information & Computation. 186: 104-139. DOI: 10.1016/S0890-5401(03)00091-9 |
0.34 |
|
| 2003 |
Amir A, Landau GM, Sokol D. Inplace run-length 2d compressed search Theoretical Computer Science. 290: 1361-1383. DOI: 10.1016/S0304-3975(02)00041-5 |
0.486 |
|
| 2003 |
Amir A, Landau GM, Sokol D. Inplace 2D matching in compressed images Journal of Algorithms. 49: 240-261. DOI: 10.1016/S0196-6774(03)00088-9 |
0.516 |
|
| 2002 |
Amir A, Lewenstein M, Porat E. Approximate swapped matching Information Processing Letters. 83: 33-39. DOI: 10.1016/S0020-0190(01)00302-7 |
0.526 |
|
| 2002 |
Amir A, Landau GM, Ukkonen E. Online timestamped text indexing Information Processing Letters. 82: 253-259. DOI: 10.1016/S0020-0190(01)00275-7 |
0.416 |
|
| 2000 |
Koren G, Dar E, Amir A. The Power of Migration in Multiprocessor Scheduling of Real-Time Systems Siam Journal On Computing. 30: 511-527. DOI: 10.1137/S0097539797326241 |
0.304 |
|
| 2000 |
Amir A, Aumann Y, Landau GM, Lewenstein M, Lewenstein N. Pattern Matching with Swaps Journal of Algorithms. 37: 247-266. DOI: 10.1006/Jagm.2000.1120 |
0.414 |
|
| 2000 |
Amir A, Keselman D, Landau GM, Lewenstein M, Lewenstein N, Rodeh M. Text Indexing and Dictionary Matching with One Error Journal of Algorithms. 37: 309-325. DOI: 10.1006/Jagm.2000.1104 |
0.502 |
|
| 2000 |
Amir A, Călinescu G. Alphabet-Independent and Scaled Dictionary Matching Journal of Algorithms. 36: 34-62. DOI: 10.1006/Jagm.2000.1081 |
0.525 |
|
| 2000 |
Amir A, Lewenstein M, Lewenstein N. Pattern Matching in Hypertext Journal of Algorithms. 35: 82-99. DOI: 10.1006/Jagm.1999.1063 |
0.485 |
|
| 1999 |
Amir A, Butman A, Lewenstein M. Real scaled matching Information Processing Letters. 70: 185-190. DOI: 10.1016/S0020-0190(99)00060-5 |
0.384 |
|
| 1998 |
Amir A, Benson G. Two-Dimensional Periodicity in Rectangular Arrays Siam Journal On Computing. 27: 90-106. DOI: 10.1137/S0097539795298321 |
0.704 |
|
| 1998 |
Amir A, Landau GM, Lewenstein M, Lewenstein N. Efficient special cases of Pattern Matching with Swaps Information Processing Letters. 68: 125-132. DOI: 10.1016/S0020-0190(98)00151-3 |
0.473 |
|
| 1998 |
Amir A, Benson G, Farach-Colton M. Optimal parallel two dimension text searching on a CREW PRAM4 Information & Computation. 144: 1-17. DOI: 10.1006/Inco.1998.2705 |
0.747 |
|
| 1997 |
Amir A, Keselman D. Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms Siam Journal On Computing. 26: 1656-1669. DOI: 10.1137/S0097539794269461 |
0.441 |
|
| 1997 |
Amir A, Feldman R, Kashi R. A new and versatile method for association generation Information Systems. 22: 333-347. DOI: 10.1016/S0306-4379(97)00021-5 |
0.406 |
|
| 1997 |
Amir A, Dar E. An improved deterministic algorithm for generating different many-element random samples Information Processing Letters. 62: 95-101. DOI: 10.1016/S0020-0190(97)00047-1 |
0.494 |
|
| 1997 |
Amir A, Benson G, Farach M. Optimal Two-Dimensional Compressed Matching Journal of Algorithms. 24: 354-379. DOI: 10.1006/Jagm.1997.0860 |
0.647 |
|
| 1997 |
Amir A, Apostolico A, Lewenstein M. Inverse Pattern Matching Journal of Algorithms. 24: 325-339. DOI: 10.1006/Jagm.1996.0850 |
0.455 |
|
| 1996 |
Amir A, Calinescu G. Alphabet independent and dictionary scaled matching Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1075: 320-334. DOI: 10.1007/3-540-61258-0_23 |
0.44 |
|
| 1996 |
Amir A, Benson G, Farach M. Let sleeping files lie: Pattern matching in Z-compressed files Journal of Computer and System Sciences. 52: 299-307. DOI: 10.1006/Jcss.1996.0023 |
0.696 |
|
| 1995 |
Amir A, Farach M, Idury RM, Lapoutre JA, Schaffer AA. Improved Dynamic Dictionary Matching Information & Computation. 119: 258-282. DOI: 10.1006/Inco.1995.1090 |
0.52 |
|
| 1995 |
Amir A, Farach M. Efficient 2-Dimensional Approximate Matching of Half-Rectangular Figures Information & Computation. 118: 1-11. DOI: 10.1006/Inco.1995.1047 |
0.551 |
|
| 1994 |
Amir A, Benson G, Farach M. An Alphabet Independent Approach to Two-Dimensional Pattern Matching Siam Journal On Computing. 23: 313-323. DOI: 10.1137/S0097539792226321 |
0.711 |
|
| 1994 |
Amir A, Farach M, Galil Z, Giancarlo R, Park K. Dynamic dictionary matching Journal of Computer and System Sciences. 49: 208-222. DOI: 10.1016/S0022-0000(05)80047-9 |
0.421 |
|
| 1994 |
Amir A, Farach M, Muthukrishnan S. Alphabet dependence in parameterized matching Information Processing Letters. 49: 111-115. DOI: 10.1016/0020-0190(94)90086-8 |
0.545 |
|
| 1993 |
Amir A. A pearl diver deals a poker hand International Journal of Computer Mathematics. 48: 11-14. DOI: 10.1080/00207169308804187 |
0.442 |
|
| 1992 |
Amir A, Landau GM, Vishkin U. Efficient pattern matching with scaling Journal of Algorithms. 13: 2-32. DOI: 10.1016/0196-6774(92)90003-U |
0.568 |
|
| 1992 |
Amir A, Farach M. Two-dimensional dictionary matching Information Processing Letters. 44: 233-239. DOI: 10.1016/0020-0190(92)90206-B |
0.539 |
|
| 1991 |
Amir A, Landau GM. Fast parallel and serial multidimensional approximate array matching Theoretical Computer Science. 81: 97-115. DOI: 10.1016/0304-3975(91)90318-V |
0.526 |
|
| 1991 |
Amir A, Mintz D. An efficient algorithm for generalized random sampling Pattern Recognition Letters. 12: 683-686. DOI: 10.1016/0167-8655(91)90005-7 |
0.443 |
|
| 1991 |
Amir A, Farach M. Efficient matching of nonrectangular shapes Annals of Mathematics and Artificial Intelligence. 4: 211-224. DOI: 10.1007/Bf01531057 |
0.487 |
|
| 1990 |
Amir A, Roussopoulos N. Optimal view caching Information Systems. 15: 169-171. DOI: 10.1016/0306-4379(90)90032-K |
0.3 |
|
| 1990 |
Amir A, Landau GM. Fast parallel and serial multidimensional approximate array matching Sequence. 3-24. DOI: 10.1007/978-1-4612-3352-7_1 |
0.444 |
|
| 1988 |
Amir A, Gasarch WI. Polynomial terse sets Information & Computation. 77: 37-56. DOI: 10.1016/0890-5401(88)90044-2 |
0.323 |
|
| 1988 |
Kaplan EH, Amir A. A fast feasibility test for relocation problems European Journal of Operational Research. 35: 201-206. DOI: 10.1016/0377-2217(88)90030-6 |
0.355 |
|
| 1987 |
Amir A. A direct linear-time planarity test for unflippable modules International Journal of Computer Mathematics. 21: 277-290. DOI: 10.1080/00207168708803570 |
0.383 |
|
| 1985 |
Amir A, Choceka Y. A syntactical definition of the problem International Journal of Computer Mathematics. 17: 217-228. DOI: 10.1080/00207168508803464 |
0.311 |
|
| Show low-probability matches. |