Amir, Amihood

Research Professor
Unassigned

Jump to:

About

Publications

Journal Articles
  • Amir A, Iliopoulos CS, Radoszewski J (2017).  Two strings at Hamming distance 1 cannot be both quasiperiodic.  Information Processing Letters.  128.
  • Amir A, Apostolico A, Gagie T, Landau GM (2017).  String cadences.  Theoretical Computer Science.  698.
  • Amir A, Levy A, Lewenstein M, Lubin R, Porat B (2017).  Can we recover the cover?.  Leibniz International Proceedings in Informatics, LIPIcs.  78.
  • Amir A, Levy A, Lubin R, Porat E (2017).  Approximate cover of strings.  Leibniz International Proceedings in Informatics, LIPIcs.  78.
  • Kim J, Amir A, Na JC, Park K, Sim JS (2017).  On Representations of Ternary Order Relations in Numeric Strings.  Mathematics in Computer Science.  11(2).
  • Amir A, Amit M, Landau GM, Sokol D (2017).  Period recovery of strings over the Hamming and edit distances.  Theoretical Computer Science.
  • Amir A, Charalampopoulos P, Iliopoulos CS, Pissis SP, Radoszewski J (2017).  Longest common factor after one edit operation.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  10508 LNCS.
  • Amir A, Kopelowitz T, Levy A, Pettie S, Porat E, Shalom BR (2016).  Mind the gap: Essentially optimal algorithms for online dictionary matching with one gap.  Leibniz International Proceedings in Informatics, LIPIcs.  64.
  • Amir A, Kapah O, Kopelowitz T, Naor M, Porat E (2016).  The family holiday gathering problem or fair and periodic scheduling of independent sets.  Annual ACM Symposium on Parallelism in Algorithms and Architectures.  11-13-July-2016.
  • Amir A, Paryenty H, Roditty L (2016).  Configurations and Minority in the String Consensus Problem.  Algorithmica.  74(4).
  • Amir A, Amit M, Landau GM, Sokol D (2016).  Period recovery over the hamming and edit distances.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  9644.
  • Amir A, Apostolico A, Hirst T, Landau GM, Lewenstein N, Rozenberg L (2015).  Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on run-length encoded strings.  Theoretical Computer Science.
  • Amir A, Levy A, Porat E, Shalom BR (2015).  Dictionary matching with a few gaps.  Theoretical Computer Science.  589.
  • Amir A, Eisenberg E, Levy A (2015).  Approximate periodicity.  Information and Computation.  241.
  • Amir A, Porat B (2015).  On the hardness of optimal vertex relabeling and restricted vertex relabeling.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  9133.
  • Amir A, Apostolico A, Landau GM, Porat E, Sar Shalom O (2015).  A PTAS for the Square Tiling Problem.  Theoretical Computer Science.  562(C).
  • Amir A, Lewenstein M, Thankachan SV (2015).  Range LCP queries revisited.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  9309.
  • Amir A, Butman A, Porat E (2014).  On the relationship between histogram indexing and block-mass indexing.  Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences.  372(2016).
  • Amir A, Apostolico A, Eisenberg E, Landau GM, Levy A, Lewenstein N (2014).  Detecting approximate periodic patterns.  Theoretical Computer Science.  525.
  • Amir A, Levy A, Porat E, Shalom BR (2014).  Dictionary matching with one gap.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  8486 LNCS.
  • Kim J, Amir A, Na JC, Park K, Sim JS (2014).  On representations of ternary order relations in numeric strings.  CEUR Workshop Proceedings.  1146.
  • Amir A, Apostolico A, Hirst T, Landau GM, Lewenstein N, Rozenberg L (2014).  Algorithms for jumbled indexing, Jumbled Border and Jumbled Square on run-length encoded strings.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  8799.
  • Amir A, Ficler J, Krauthgamer R, Roditty L, Sar Shalom O (2014).  Multiply balanced k∈-partitioning.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  8392 LNCS.
  • Amir A, Apostolico A, Landau GM, Levy A, Lewenstein M, Porat E (2014).  Range LCP.  Journal of Computer and System Sciences.  80(7).
  • Amir A, Lewenstein M, Lewenstein N (2014).  Hypertext searching - a survey.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  8001.
  • Amir A, Porat B (2014).  Approximate on-line palindrome recognition, and applications.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  8486 LNCS.
  • Amir A, Chan TM, Lewenstein M, Lewenstein N (2014).  On hardness of jumbled indexing.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  8572 LNCS(PART 1).
  • Amir A, Franceschini G, Grossi R, Kopelowitz T, Lewenstein M, Lewenstein N (2014).  Managing unbounded-length keys in comparison-driven data structures with applications to online indexing?.  SIAM Journal on Computing.  43(4).
  • Amir A, Eisenberg E, Levy A, Lewenstein N (2014).  Closest periodic vectors in Lp spaces.  Theoretical Computer Science.  533.
  • Amir A, Ficler J, Roditty L, Shalom OS (2014).  On the efficiency of the hamming C-centerstring problems.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  8486 LNCS.
  • Amir A, Porat B (2013).  Pattern matching with non overlapping reversals - Approximation and on-line algorithms.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  8283 LNCS.
  • Amir A, Paryenty H, Roditty L (2013).  On the hardness of the Consensus String problem.  Information Processing Letters.  113(10-11).
  • Amir A, Eisenberg E, Levy A, Porat E, Shapira N (2012).  Cycle detection and correction.  ACM Transactions on Algorithms.  9(1).
  • Amir A, Levy A (2012).  Approximate period detection and correction.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  7608 LNCS.
  • Amir A, Paryenty H, Roditty L (2012).  Configurations and minority in the string consensus problem.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  7608 LNCS.
  • Amir A, Parida L (2012).  Combinatorial pattern matching (CPM 2010).  Information and Computation.  213.
  • Amir A, Paryenty H (2012).  Towards a theory of patches.  Journal of Discrete Algorithms.  12.
  • Amir A, Aumann Y, Levy A, Roshko Y (2012).  Quasi-distinct parsing and optimal compression methods.  Theoretical Computer Science.  422.
  • Amir A, Eisenberg E, Levy A, Lewenstein N (2011).  Closest periodic vectors in L p spaces.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  7074 LNCS.
  • Amir A, Apostolico A, Landau GM, Levy A, Lewenstein M, Porat E (2011).  Range LCP.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  7074 LNCS.
  • Amir A, Gotthilf Z, Shalom BR (2011).  Weighted shortest common supersequence.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  7024 LNCS.
  • Amir A, Paryenty H, Roditty L (2011).  Approximations and partial solutions for the consensus sequence problem.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  7024 LNCS.
  • Amir A, Landau GM, Na JC, Park H, Park K, Sim JS (2011).  Efficient algorithms for consensus string problems minimizing both distance sum and radius.  Theoretical Computer Science.  412(39).
  • Amir A, Eisenberg E, Keller O, Levy A, Porat E (2011).  Approximate string matching with stuck address bits.  Theoretical Computer Science.  412(29).
  • Ng J, Amir A, Pevzner PA (2011).  Blocked pattern matching problem and its applications in proteomics.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  6577 LNBI.
  • Amir A, Parida L (2010).  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  6129 LNCS.
  • Amir A, Eisenberg E, Levy A (2010).  Approximate periodicity.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  6506 LNCS(PART 1).
  • Amir A, Eisenberg E, Keller O, Levy A, Porat E (2010).  Approximate string matching with stuck address bits.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  6393 LNCS.
  • Amir A, Apostolico A, Landau GM, Shalom OS (2010).  A PTAS for the square tiling problem.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  6393 LNCS.
  • Amir A, Gotthilf Z, Shalom BR (2010).  Weighted LCS.  Journal of Discrete Algorithms.  8(3).
  • Amir A, Eisenberg E, Levy A, Porat E, Shapira N (2010).  Cycle detection and correction.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  6198 LNCS(PART 1).
  • Amir A, Chencinski E (2010).  Faster two dimensional scaled matching.  Algorithmica (New York).  56(2).
  • Amir A, Gotthilf Z, Shalom BR (2009).  Weighted LCS.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  5874 LNCS.
  • Amir A, Aumann Y, Kapah O, Levy A, Porat E (2009).  Approximate string matching with address bit errors.  Theoretical Computer Science.  410(51).
  • Amir A, Parienty H (2009).  Towards a theory of patches.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  5721 LNCS.
  • Amir A, Landau GM, Na JC, Park H, Park K, Sim JS (2009).  Consensus optimizing both distance sum and radius.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  5721 LNCS.
  • Amir A, Aumann Y, Levy A, Roshko Y (2009).  Quasi-distinct parsing and optimal compression methods.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  5577 LNCS.
  • Amir A, Aumann Y, Indyk P, Levy A, Porat E (2009).  Efficient computations of ℓ1 and ℓ∞ rearrangement distances.  Theoretical Computer Science.  410(43).
  • Amir A, Aumann Y, Benson G, Levy A, Lipsky O, Porat E, Skiena S, Vishne U (2009).  Pattern matching with address errors: Rearrangement distances.  Journal of Computer and System Sciences.  75(6).
  • Amir A, Navarro G (2009).  Parameterized matching on non-linear structures.  Information Processing Letters.  109(15).
  • Amir A, Butman A, Lewenstein M, Porat E (2009).  Real two dimensional scaled matching.  Algorithmica (New York).  53(3).
  • Amir A, Turpin A, Moffat A (2008).  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  5280 LNCS.
  • Amir A, Hartman T, Kapah O, Shalom BR, Tsur D (2008).  Generalized LCS.  Theoretical Computer Science.  409(3).
  • Amir A, Nor I (2008).  Real-time indexing over fixed finite alphabets.  Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms.
  • Amir A, Levy A, Reuveni L (2008).  The practical efficiency of convolutions in pattern matching algorithms.  Fundamenta Informaticae.  84(1).
  • Amir A, Aumann Y, Kapah O, Levy A, Porat E (2008).  Approximate string matching with address bit errors.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  5029 LNCS.
  • Amir A, Chencinski E, Iliopoulos C, Kopelowitz T, Zhang H (2008).  Property matching and weighted matching.  Theoretical Computer Science.  395(2-3).
  • Kim JW, Amir A, Landau GM, Park K (2008).  Computing similarity of run-length encoded strings with affine gap penalty.  Theoretical Computer Science.  395(2-3).
  • Amir A, Turpin A, Moffat A (2008).  Preface.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  5280 LNCS.
  • Amir A, Kapah O, Porat E (2007).  Deterministic length reduction: Fast convolution in sparse data and applications.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  4580 LNCS.
  • Amir A, Hartman T, Kapah O, Shalom BR, Tsur D (2007).  Generalized LCS.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  4726 LNCS.
  • Amir A, Fischer J, Lewenstein M (2007).  Two-dimensional range minimum queries.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  4580 LNCS.
  • Amir A, Aumann Y, Indyk P, Levy A, Porat E (2007).  Efficient computations of ℓ1 and ℓ∞ rearrangement distances.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  4726 LNCS.
  • Amir A, Hartman T, Kapah O, Levy A, Porat E (2007).  On the cost of interchange rearrangement in strings.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  4698 LNCS.
  • Amir A, Nor I (2007).  Generalized function matching.  Journal of Discrete Algorithms.  5(3).
  • Amir A, Gasieniec L, Shalom R (2007).  Improved approximate common interval.  Information Processing Letters.  103(4).
  • Amir A, Butman A, Lewenstein M, Porat E, Tsur D (2007).  Efficient one-dimensional real scaled matching.  Journal of Discrete Algorithms.  5(2 SPEC. ISS.).
  • Amir A, Landau GM, Lewenstein M, Sokol D (2007).  Dynamic text and static pattern matching.  ACM Transactions on Algorithms.  3(2).
  • Amir A, Kapah O, Tsur D (2006).  Faster two-dimensional pattern matching with rotations.  Theoretical Computer Science.  368(3).
  • Amir A, Aumann Y, Lewenstein M, Porat E (2006).  Function matching.  SIAM Journal on Computing.  35(5).
  • Amir A, Eisenberg E, Porat E (2006).  Swap and mismatch edit distance.  Algorithmica (New York).  45(1).
  • Amir A, Aumann Y, Benson G, Levy A, Lipsky O, Porat E, Skiena S, Vishne U (2006).  Pattern matching with address errors: Rearrangement distances.  Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms.
  • Amir A (2006).  Asynchronous Pattern Matching.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  4009 LNCS.
  • Amir A, Chencinski E, Iliopoulos C, Kopelowitz T, Zhang H (2006).  Property matching and weighted matching.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  4009 LNCS.
  • Amir A, Iliopoulos C, Kapah O, Porat E (2006).  Approximate matching in weighted sequences.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  4009 LNCS.
  • Amir A, Chencinski E (2006).  Faster two dimensional scaled matching.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  4009 LNCS.
  • Amir A, Kopelowitz T, Lewenstein M, Lewenstein N (2005).  Towards real-time suffix tree construction.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  3772 LNCS.
  • Amir A (2005).  Theoretical issues of searching aerial photographs: A bird's eye view.  International Journal of Foundations of Computer Science.  16(6).
  • Kim JW, Amir A, Landau GM, Park K (2005).  Computing similarity of run-length encoded strings with affine gap penalty.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  3772 LNCS.
  • Amir A (2005).  Asynchronous pattern matching - metrics (Extended abstract).  Proceedings of the Prague Stringology Conference '05.
  • Amir A, Aumann Y, Feldman R, Fresko M (2005).  Maximal association rules: A tool for mining associations in text.  Journal of Intelligent Information Systems.  25(3).
  • Amir A, Lipsky O, Porat E, Umanski J (2005).  Approximate matching in the L 1 metric.  Lecture Notes in Computer Science.  3537.
  • Aronowitz H, Burshtein D, Amir A (2005).  Speaker indexing in audio archives using Gaussian mixture scoring simulation.  Lecture Notes in Computer Science.  3361.
  • Aronowitz H, Burshtein D, Amir A (2005).  A Session-GMM generative model using test utterance Gaussian mixture modeling for speaker verification.  ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings.  I.
  • Amir A, Nor I (2004).  Generalized function matching.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  3341.
  • Amir A, Eisenberg E, Porat E (2004).  Swap and mismatch edit distance.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  3221.
  • Amir A, Butman A, Lewenstein M, Porat E, Tsur D (2004).  Efficient one dimensional real scaled matching.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  3246.
  • Amir A, Kapah O, Tsur D (2004).  Faster two dimensional pattern matching with rotations.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  3109.
  • Horesh Y, Amir A, Michaeli S, Unger R (2004).  RNAMAT: An efficient method to detect classes of RNA molecules and their structural features.  Annual International Conference of the IEEE Engineering in Medicine and Biology - Proceedings.  26 IV.
  • Amir A, Church KW, Dar E (2004).  The submatrices character count problem: An efficient solution using separable values.  Information and Computation.  190(1).
  • Amir A, Butman A, Crochemore M, M. Landau G, Schaps M (2004).  Two-dimensional pattern matching with rotations.  Theoretical Computer Science.  314(1-2).
  • Amir A, Lewenstein M, Porat E (2004).  Faster algorithms for string matching with k mismatches.  Journal of Algorithms.  50(2).
  • Aronowitz H, Burshtein D, Amir A (2004).  Speaker indexing in audio archives using test Utterance Gaussian mixture modeling.  8th International Conference on Spoken Language Processing, ICSLP 2004.
  • Aronowitz H, Burshtein D, Amir A (2004).  Text independent speaker recognition using speaker dependent word spotting.  8th International Conference on Spoken Language Processing, ICSLP 2004.
  • Amir A, Kashi R, Netanyahu NS, Keim D, Wawryniuk M (2003).  Analyzing high-dimensional data by subspace validity.  Proceedings - IEEE International Conference on Data Mining, ICDM.
  • Amir A, Butman A, Crochemore M, Landau GM, Schaps M (2003).  Two-dimensional pattern matching with rotations.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  2676.
  • Amir A, Aumann Y, Cole R, Lewenstein M, Porat E (2003).  Function matching: Algorithms, applications, and a lower bound.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  2719.
  • Horesh Y, Amir A, Michaeli S, Unger R (2003).  A rapid method for detection of putative RNAi target genes in genomic data.  Bioinformatics.  19(SUPPL. 2).
  • Amir A, Landau GM, Lewenstein M, Sokol D (2003).  Dynamic text and static pattern matching.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  2748.
  • Amir A, Kashi R, Netanyahu NS (2003).  Efficient multidimensional quantitative hypotheses generation.  Proceedings - IEEE International Conference on Data Mining, ICDM.
  • Amir A, Butman A, Lewenstein M, Porat E (2003).  Real two dimensional scaled matching.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  2748.
  • Amir A, Landau GM, Sokol D (2003).  Inplace 2D matching in compressed images.  Journal of Algorithms.  49(2).
  • Amir A, Beigel R, Gasarch W (2003).  Some connections between bounded query classes and non-uniform complexity.  Information and Computation.  186(1).
  • Amir A, Apostolico A, Landau GM, Satta G (2003).  Efficient text fingerprinting via parikh mapping.  Journal of Discrete Algorithms.  1(5-6).
  • Amir A, Cole R, Hariharan R, Lewenstein M, Porat E (2003).  Overlap matching.  Information and Computation.  181(1).
  • Amir A, Landau GM, Sokol D (2003).  Inplace run-length 2d compressed search.  Theoretical Computer Science.  290(3).
  • Amir A, Landau GM, Sokol D (2003).  Inplace 2D matching in compressed images.  Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms.
  • Amir A, Lewenstein M, Porat E (2002).  Approximate swapped matching.  Information Processing Letters.  83(1).
  • Amir A, Landau GM, Ukkonen E (2002).  Online timestamped text indexing.  Information Processing Letters.  82(5).
  • Amir A, Church KW, Dar E (2002).  Separable attributes: A technique for solving the sub matrices character count problem.  Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms.  06-08-January-2002.
  • Amir A, Porat E, Lewenstein M (2001).  Approximate subset matching with Don't Cares.  Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms.
  • Amir A, Cole R, Hariharan R, Lewenstein M, Porat E (2001).  Overlap matching.  Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms.
  • Yadgari J, Amir A, Unger R (2001).  Genetic threading.  Constraints.  6(2-3).
  • Amir A, Kashi R, Netanyahu NS (2001).  Analyzing quantitative databases: Image is everything.  VLDB 2001 - Proceedings of 27th International Conference on Very Large Data Bases.
  • Koren G, Dar E, Amir A (2000).  The power of migration in multiprocessor scheduling of real-time systems.  SIAM Journal on Computing.  30(2).
  • Amir A, Keselman D, Landau GM, Lewenstein M, Lewenstein N, Rodeh M (2000).  Text Indexing and Dictionary Matching with One Error.  Journal of Algorithms.  37(2).
  • Amir A, Aumann Y, Landau GM, Lewenstein M, Lewenstein N (2000).  Pattern Matching with Swaps.  Journal of Algorithms.  37(2).
  • Amir A, Calinescu G (2000).  Alphabet-Independent and Scaled Dictionary Matching.  Journal of Algorithms.  36(1).
  • Amir A, Lewenstein M, Lewenstein N (2000).  Pattern Matching in Hypertext.  Journal of Algorithms.  35(1).
  • Amir A, Butman A, Lewenstein M (2000).  Real Scaled Matching.  Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms.
  • Amir A, Landau GM, Sokol D (2000).  Inplace run-length 2d compressed search.  Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms.
  • Amir A, Lewenstein M, Porat E (2000).  Approximate swapped matching.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  1974.
  • Amir A, Lewenstein M, Porat E (2000).  Faster algorithms for string matching with k mismatches.  Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms.
  • Uliel S, Fliess A, Amir A, Unger R (1999).  A simple algorithm for detecting circular permutations in proteins.  Bioinformatics.  15(11).
  • Amir A, Butman A, Lewenstein M (1999).  Real scaled matching.  Information Processing Letters.  70(4).
  • Amir A, Keselman D, Landau GM, Lewenstein M, Lewenstein N, Rodeh M (1999).  Indexing and dictionary matching with one error (extended abstract).  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  1663.
  • Koren G, Amir A, Dar E (1998).  Power of migration in multi-processor scheduling of real-time systems.  Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms.
  • Amir A, Landau GM, Lewenstein M, Lewenstein N (1998).  Efficient special cases of pattern matching with swaps.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  1448 LNCS.
  • Amir A, Landau GM, Lewenstein M, Lewenstein N (1998).  Efficient special cases of Pattern Matching with Swaps.  Information Processing Letters.  68(3).
  • Amir A, Benson G, Farach-Colton M (1998).  Optimal Parallel Two Dimensional Text Searching on a CREW PRAM.  Information and Computation.  144(1).
  • Amir A, Benson G (1998).  Two-dimensional periodicity in rectangular arrays.  SIAM Journal on Computing.  27(1).
  • Yadgari J, Amir A, Unger R (1998).  Genetic algorithms for protein threading..  Proceedings / ... International Conference on Intelligent Systems for Molecular Biology ; ISMB. International Conference on Intelligent Systems for Molecular Biology.  6.
  • Amir A, Keselman D (1997).  Maximum agreement subtree in a set of evolutionary trees: Metrics and efficient algorithms.  SIAM Journal on Computing.  26(6).
  • Amir A, Aumann Y, Landau GM, Lewenstein M, Lewenstein N (1997).  Pattern matching with swaps.  Annual Symposium on Foundations of Computer Science - Proceedings.
  • Amir A, Feldman R, Kashi R (1997).  A new and versatile method for association generation.  Information Systems.  22(6-7).
  • Amir A, Apostolico A, Lewenstein M (1997).  Inverse Pattern Matching.  Journal of Algorithms.  24(2).
  • Amir A, Benson G, Farach M (1997).  Optimal Two-Dimensional Compressed Matching.  Journal of Algorithms.  24(2).
  • Amir A, Dar E (1997).  An improved deterministic algorithm for generating different many-element random samples.  Information Processing Letters.  62(2).
  • Amir A, Feldman R, Kashi R (1997).  A new and versatile method for association generation.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  1263.
  • Amir A, Lewenstein M, Lewenstein N (1997).  Pattern matching in hypertext.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  1272.
  • Amir A, Dar E (1997).  An improved deterministic algorithm for generalized random sampling.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  1203.
  • Amir A, Benson G, Farach M (1996).  Let sleeping files lie: Pattern matching in Z-compressed files.  Journal of Computer and System Sciences.  52(2).
  • Amir A, Calinescu G (1996).  Alphabet independent and dictionary scaled matching.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  1075.
  • Amir A, Farach M, Idury RM, Lapoutre JA, Schaffer AA (1995).  Improved Dynamic Dictionary Matching.  Information and Computation.  119(2).
  • Amir A, Farach M (1995).  Efficient 2-Dimensional Approximate Matching of Half-Rectangular Figures.  Information and Computation.  118(1).
  • Amir A, Benson G, Farach M (1994).  Alphabet independent approach to two-dimensional pattern matching.  SIAM Journal on Computing.  23(2).
  • Amir A, Farach M, Muthukrishnan S (1994).  Alphabet dependence in parameterized matching.  Information Processing Letters.  49(3).
  • Amir A, Farach M, Galil Z, Giancarlo R, Park K (1994).  Dynamic dictionary matching.  Journal of Computer and System Sciences.  49(2).
  • Amir A, Benson G, Farach M (1994).  Optimal two-dimensional compressed matching.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  820 LNCS.
  • Amir A, Benson G, Farach M (1994).  Let sleeping files lie: Pattern matching in Z-compressed files.  Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms.
  • Amir A, Benson G, Farach M (1993).  Optimal parallel two dimensional pattern matching.  Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1993.
  • Amir A (1993).  A pearl diver deals a poker hand.  International Journal of Computer Mathematics.  48(1-2).
  • Amir A, Farach M, Idury RM, La Poutre JA, Schaeffer AA (1993).  Improved dynamic dictionary matching.  Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms.
  • Amir A, Farach M (1992).  Two-dimensional dictionary matching.  Information Processing Letters.  44(5).
  • Amir A, Benson G, Farach M (1992).  Alphabet independent two dimensional matching.  Conference Proceedings of the Annual ACM Symposium on Theory of Computing.
  • Amir A, Benson G (1992).  Two-dimensional periodicity and its applications.  Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms.  Part F129721.
  • Amir A, Landau GM, Vishkin U (1992).  Efficient pattern matching with scaling.  Journal of Algorithms.  13(1).
  • Amir A, Farach M, Matias Y (1992).  Efficient randomized dictionary matching algorithms.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  644 LNCS.
  • Amir A, Farach M (1991).  Adaptive dictionary matching.  Annual Symposium on Foundations of Computer Science (Proceedings).
  • Amir A, Farach M (1991).  Efficient matching of nonrectangular shapes.  Annals of Mathematics and Artificial Intelligence.  4(3-4).
  • Amir A, Landau GM (1991).  Fast parallel and serial multidimensional approximate array matching.  Theoretical Computer Science.  81(1).
  • Amir A, Mintz D (1991).  An efficient algorithm for generalized random sampling.  Pattern Recognition Letters.  12(11).
  • Amir A, Beigel R, Gasarch WI (1990).  Some connections between bounded query classes and non-uniform complexity.
  • Amir A, Landau GM, Vishkin U (1990).  Efficient pattern matching with scaling.  Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms.  Part F130015.
  • Amir A, Roussopoulos N (1990).  Optimal view caching.  Information Systems.  15(2).
  • Kaplan EH, Amir A (1988).  A fast feasibility test for relocation problems.  European Journal of Operational Research.  35(2).
  • Amir A, Kaplan EH (1988).  Relocation Problems are Hard.  International Journal of Computer Mathematics.  25(2).
  • Amir A, Gasarch WI (1988).  Polynomial terse sets.  Information and Computation.  77(1).
  • Amir A, Gasarch WI (1987).  POLYNOMIAL TERSE SETS..
  • Amir A (1987).  A Direct Linear-Time Planarity Test for Unflippable Modules.  International Journal of Computer Mathematics.  21(3-4).
  • Amir A (1987).  Expressive completeness failure in branching time structures.  Journal of Computer and System Sciences.  34(1).
  • Amir A, Gabbay DM (1987).  Preservation of expressive completeness in temporal models.  Information and Computation.  72(1).
  • Amir A (1985).  Separation in nonlinear time models.  Information and Control.  66(3).
  • Amir A (1985).  A Syntactical Definition of the [Figure presented.] Problem.  International Journal of Computer Mathematics.  17(3-4).
  • Amir A, Choueka Y (1983).  Polynomial Computations in Non-Deterministic Loop-Programs and PL-Programs.  International Journal of Computer Mathematics.  14(3-4).
Back to top