Amihood Amir

ORCID

Publication Activity (10 Years)

Years Active: 1985-2024
Publications (10 Years): 68

Top Venues

Publications

Amihood Amir, Eitan Kondratovsky, Avivit Levy
On suffix tree detection. Theor. Comput. Sci. 1012 (2024)
Amihood Amir, Michael Itzhaki
Reconstructing General Matching Graphs. CPM (2024)
Amihood Amir, Eitan Kondratovsky, Gad M. Landau, Shoshana Marcus, Dina Sokol
Reconstructing parameterized strings from parameterized suffix and LCP arrays. Theor. Comput. Sci. 981 (2024)
Amihood Amir, Michael Itzhaki
Explicit Combinatoric Structures of Palindromes and Chromatic Number of Restriction Graphs. CoRR (2024)
Ora Amir, Amihood Amir, Aviezri Fraenkel, David Sarne
On the Practical Power of Automata in Pattern Matching. SN Comput. Sci. 5 (4) (2024)
Amihood Amir, Eitan Kondratovsky, Avivit Levy
On Suffix Tree Detection. SPIRE (2023)
Amihood Amir, Ayelet Butman, Gad M. Landau, Shoshana Marcus, Dina Sokol
Double String Tandem Repeats. Algorithmica 85 (1) (2023)
Ora Amir, Amihood Amir, Aviezri Fraenkel, David Sarne
On the Practical Power of Automata in Pattern Matching. CoRR (2022)
Amihood Amir, Concettina Guerra, Eitan Kondratovsky, Gad M. Landau, Shoshana Marcus, Dina Sokol
Reconstructing Parameterized Strings from Parameterized Suffix and LCP Arrays. SPIRE (2022)
Amihood Amir, Ayelet Butman, Eitan Kondratovsky, Avivit Levy, Dina Sokol
Multidimensional Period Recovery. Algorithmica 84 (6) (2022)
Amihood Amir, Itai Boneh, Eitan Kondratovsky
The k-Mappability Problem Revisited. CPM (2021)
Rami Cohen, Oren Sar Shalom, Dietmar Jannach, Amihood Amir
A Black-Box Attack Model for Visually-Aware Recommender Systems. WSDM (2021)
Amihood Amir, Eitan Kondratovsky
Towards a real time algorithm for parameterized longest common prefix computation. Theor. Comput. Sci. 852 (2021)
Amihood Amir, Itai Boneh, Eitan Kondratovsky
The k-mappability problem revisited. CoRR (2021)
Amihood Amir, Itai Boneh
Dynamic Suffix Array with Sub-linear update time and Poly-logarithmic Lookup Time. CoRR (2021)
Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom
Online recognition of dictionary with one gap. Inf. Comput. 275 (2020)
Rami Cohen, Oren Sar Shalom, Dietmar Jannach, Amihood Amir
A Black-Box Attack Model for Visually-Aware Recommender Systems. CoRR (2020)
Amihood Amir, Ayelet Butman, Eitan Kondratovsky, Avivit Levy, Dina Sokol
Multidimensional Period Recovery. SPIRE (2020)
Amihood Amir, Ayelet Butman, Gad M. Landau, Shoshana Marcus, Dina Sokol
Double String Tandem Repeats. CPM (2020)
Amihood Amir, Itai Boneh, Michael Itzhaki, Eitan Kondratovsky
Analysis of the Period Recovery Error Bound. ESA (2020)
Ramtin Afshar, Amihood Amir, Michael T. Goodrich, Pedro Matias
Adaptive Exact Learning in a Mixed-Up World: Dealing with Periodicity, Errors, and Jumbled-Index Queries in String Reconstruction. CoRR (2020)
Amihood Amir, Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski
Dynamic and Internal Longest Common Substring. Algorithmica 82 (12) (2020)
Amihood Amir, Gad M. Landau, Shoshana Marcus, Dina Sokol
Two-dimensional maximal repetitions. Theor. Comput. Sci. 812 (2020)
Sung Gwan Park, Magsarjav Bataa, Amihood Amir, Gad M. Landau, Kunsoo Park
Finding patterns and periods in Cartesian tree matching. Theor. Comput. Sci. 845 (2020)
Ramtin Afshar, Amihood Amir, Michael T. Goodrich, Pedro Matias
Adaptive Exact Learning in a Mixed-Up World: Dealing with Periodicity, Errors and Jumbled-Index Queries in String Reconstruction. SPIRE (2020)
Amihood Amir, Itai Boneh
Update Query Time Trade-off for dynamic Suffix Arrays. CoRR (2020)
Amihood Amir, Itai Boneh, Eitan Kondratovsky
Approximating the Anticover of a String. SPIRE (2020)
Amihood Amir, Itai Boneh
Update Query Time Trade-Off for Dynamic Suffix Arrays. ISAAC (2020)
Amihood Amir, Avivit Levy, Moshe Lewenstein, Ronit Lubin, Benny Porat
Can We Recover the Cover? Algorithmica 81 (7) (2019)
Amihood Amir, Tsvi Kopelowitz, Avivit Levy, Seth Pettie, Ely Porat, B. Riva Shalom
Mind the Gap! - Online Dictionary Matching with One Gap. Algorithmica 81 (6) (2019)
Amihood Amir, Avivit Levy, Ronit Lubin, Ely Porat
Approximate cover of strings. Theor. Comput. Sci. 793 (2019)
Amihood Amir, Itai Boneh
Dynamic Palindrome Detection. CoRR (2019)
Amihood Amir, Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski
Longest Common Substring Made Fully Dynamic. ESA (2019)
Amihood Amir, Itai Boneh, Panagiotis Charalampopoulos, Eitan Kondratovsky
Repetition Detection in a Dynamic String. ESA (2019)
Sung Gwan Park, Amihood Amir, Gad M. Landau, Kunsoo Park
Cartesian Tree Matching and Indexing. CoRR (2019)
Amihood Amir, Eitan Kondratovsky
Sufficient Conditions for Efficient Indexing Under Different Matchings. CPM (2019)
Magsarjav Bataa, Sung Gwan Park, Amihood Amir, Gad M. Landau, Kunsoo Park
Finding Periods in Cartesian Tree Matching. IWOCA (2019)
Sung Gwan Park, Amihood Amir, Gad M. Landau, Kunsoo Park
Cartesian Tree Matching and Indexing. CPM (2019)
Amihood Amir, Eitan Kondratovsky
Searching for a Modified Pattern in a Changing Text. SPIRE (2018)
Amihood Amir, Itai Boneh
Locally Maximal Common Factors as a Tool for Efficient Dynamic String Algorithms. CPM (2018)
Amihood Amir, Mika Amit, Gad M. Landau, Dina Sokol
Period recovery of strings over the Hamming and edit distances. Theor. Comput. Sci. 710 (2018)
Amihood Amir, Avivit Levy, Ely Porat
Quasi-Periodicity Under Mismatch Errors. CPM (2018)
Amihood Amir, Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski
Longest Common Factor Made Fully Dynamic. CoRR (2018)
Oren Sar Shalom, Haggai Roitman, Amihood Amir, Alexandros Karatzoglou
Collaborative Filtering Method for Handling Diverse and Repetitive User-Item Interactions. HT (2018)
Amihood Amir, Gad M. Landau, Shoshana Marcus, Dina Sokol
Two-Dimensional Maximal Repetitions. ESA (2018)
Xinrui Zhou, Amihood Amir, Concettina Guerra, Gad M. Landau, Jarek Rossignac
EDoP Distance Between Sets of Incomplete Permutations: Application to Bacteria Classification Based on Gene Order. J. Comput. Biol. 25 (11) (2018)
Amihood Amir, Avivit Levy, Ronit Lubin, Ely Porat
Approximate Cover of Strings. CPM (2017)
Amihood Amir, Avivit Levy, Moshe Lewenstein, Ronit Lubin, Benny Porat
Can We Recover the Cover?. CPM (2017)
Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom
Online Recognition of Dictionary with One Gap. Stringology (2017)
Amihood Amir, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski
Longest Common Factor After One Edit Operation. SPIRE (2017)
Jinil Kim, Amihood Amir, Joong Chae Na, Kunsoo Park, Jeong Seop Sim
On Representations of Ternary Order Relations in Numeric Strings. Math. Comput. Sci. 11 (2) (2017)
Oren Sar Shalom, Haggai Roitman, Yishay Mansour, Amihood Amir
A User Re-Modeling Approach to Item Recommendation using Complex Usage Data. ICTIR (2017)
Amihood Amir, Alberto Apostolico, Travis Gagie, Gad M. Landau
String cadences. Theor. Comput. Sci. 698 (2017)
Amihood Amir, Costas S. Iliopoulos, Jakub Radoszewski
Two strings at Hamming distance 1 cannot be both quasiperiodic. Inf. Process. Lett. 128 (2017)
Amihood Amir, Costas S. Iliopoulos, Jakub Radoszewski
Two strings at Hamming distance 1 cannot be both quasiperiodic. CoRR (2017)
Amihood Amir, Alberto Apostolico, Travis Gagie, Gad M. Landau
String Cadences. CoRR (2016)
Amihood Amir, Oren Kapah, Tsvi Kopelowitz, Moni Naor, Ely Porat
The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets. SPAA (2016)
Amihood Amir, Haim Paryenty, Liam Roditty
Configurations and Minority in the String Consensus Problem. Algorithmica 74 (4) (2016)
Amihood Amir, Mika Amit, Gad M. Landau, Dina Sokol
Period Recovery over the Hamming and Edit Distances. LATIN (2016)
Amihood Amir, Tsvi Kopelowitz, Avivit Levy, Seth Pettie, Ely Porat, B. Riva Shalom
Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap. ISAAC (2016)
Amihood Amir, Alberto Apostolico, Tirza Hirst, Gad M. Landau, Noa Lewenstein, Liat Rozenberg
Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on run-length encoded strings. Theor. Comput. Sci. 656 (2016)
Amihood Amir, Alberto Apostolico, Gad M. Landau, Ely Porat, Oren Sar Shalom
A PTAS for the Square Tiling Problem. Theor. Comput. Sci. 562 (2015)
Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom
Dictionary matching with a few gaps. Theor. Comput. Sci. 589 (2015)
Amihood Amir, Moshe Lewenstein, Sharma V. Thankachan
Range LCP Queries Revisited. SPIRE (2015)
Oren Sar Shalom, Shlomo Berkovsky, Royi Ronen, Elad Ziklik, Amihood Amir
Data Quality Matters in Recommender Systems. RecSys (2015)
Amihood Amir, Estrella Eisenberg, Avivit Levy
Approximate periodicity. Inf. Comput. 241 (2015)
Amihood Amir, Tsvi Kopelowitz, Avivit Levy, Seth Pettie, Ely Porat, B. Riva Shalom
Online Dictionary Matching with One Gap. CoRR (2015)
Amihood Amir, Benny Porat
On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling. CPM (2015)
Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat
Range LCP. J. Comput. Syst. Sci. 80 (7) (2014)
Amihood Amir, Timothy M. Chan, Moshe Lewenstein, Noa Lewenstein
On Hardness of Jumbled Indexing. CoRR (2014)
Amihood Amir, Estrella Eisenberg, Avivit Levy, Noa Lewenstein
spaces. Theor. Comput. Sci. 533 (2014)
Amihood Amir, Jessica Ficler, Liam Roditty, Oren Sar Shalom
On the Efficiency of the Hamming C-Centerstring Problems. CPM (2014)
Amihood Amir, Gianni Franceschini, Roberto Grossi, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein
Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing. SIAM J. Comput. 43 (4) (2014)
Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom
Dictionary Matching with One Gap. CoRR (2014)
Amihood Amir, Benny Porat
Approximate On-line Palindrome Recognition, and Applications. CPM (2014)
Amihood Amir, Oren Kapah, Tsvi Kopelowitz, Moni Naor, Ely Porat
The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets. CoRR (2014)
Amihood Amir, Timothy M. Chan, Moshe Lewenstein, Noa Lewenstein
On Hardness of Jumbled Indexing. ICALP (1) (2014)
Amihood Amir, Alberto Apostolico, Estrella Eisenberg, Gad M. Landau, Avivit Levy, Noa Lewenstein
Detecting approximate periodic patterns. Theor. Comput. Sci. 525 (2014)
Jinil Kim, Amihood Amir, Joong Chae Na, Kunsoo Park, Jeong Seop Sim
On Representations of Ternary Order Relations in Numeric Strings. ICABD (2014)
Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom
Dictionary Matching with One Gap. CPM (2014)
Amihood Amir, Moshe Lewenstein, Noa Lewenstein
Hypertext Searching - A Survey. Language, Culture, Computation (1) (2014)
Amihood Amir, Alberto Apostolico, Tirza Hirst, Gad M. Landau, Noa Lewenstein, Liat Rozenberg
Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on Run-Length Encoded Strings. SPIRE (2014)
Amihood Amir, Jessica Ficler, Robert Krauthgamer, Liam Roditty, Oren Sar Shalom
Multiply Balanced k -Partitioning. LATIN (2014)
Amihood Amir, Oren Kapah, Ely Porat, Amir Rothschild
Polynomials: a new tool for length reduction in binary discrete convolutions. CoRR (2014)
Amihood Amir, Benny Porat
Pattern Matching with Non Overlapping Reversals - Approximation and On-line Algorithms. ISAAC (2013)
Amihood Amir, Haim Paryenty, Liam Roditty
On the hardness of the Consensus String problem. Inf. Process. Lett. 113 (10-11) (2013)
Amihood Amir, Gianni Franceschini, Roberto Grossi, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein
Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to On-Line Indexing. CoRR (2013)
Amihood Amir, Laxmi Parida
Combinatorial Pattern Matching (CPM 2010). Inf. Comput. 213 (2012)
Amihood Amir, Avivit Levy
Approximate Period Detection and Correction. SPIRE (2012)
Amihood Amir, Alberto Apostolico, Estrella Eisenberg, Gad M. Landau, Avivit Levy, Noa Lewenstein
Detecting Approximate Periodic Patterns. MedAlg (2012)
Amihood Amir, Yonatan Aumann, Avivit Levy, Yuri Roshko
Quasi-distinct parsing and optimal compression methods. Theor. Comput. Sci. 422 (2012)
Amihood Amir, Estrella Eisenberg, Avivit Levy, Ely Porat, Natalie Shapira
Cycle detection and correction. ACM Trans. Algorithms 9 (1) (2012)
Amihood Amir, Haim Parienty
Towards a theory of patches. J. Discrete Algorithms 12 (2012)
Amihood Amir, Haim Paryenty, Liam Roditty
Configurations and Minority in the String Consensus Problem. SPIRE (2012)
Amihood Amir, Haim Parienty, Liam Roditty
Approximations and Partial Solutions for the Consensus Sequence Problem. SPIRE (2011)
Amihood Amir, Zvi Gotthilf, B. Riva Shalom
Weighted Shortest Common Supersequence. SPIRE (2011)
Amihood Amir, Estrella Eisenberg, Avivit Levy, Noa Lewenstein
Closest Periodic Vectors in L p Spaces. ISAAC (2011)
Amihood Amir, Estrella Eisenberg, Orgad Keller, Avivit Levy, Ely Porat
Approximate string matching with stuck address bits. Theor. Comput. Sci. 412 (29) (2011)
Amihood Amir, Gad M. Landau, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim
Efficient algorithms for consensus string problems minimizing both distance sum and radius. Theor. Comput. Sci. 412 (39) (2011)
Julio Ng, Amihood Amir, Pavel A. Pevzner
Blocked Pattern Matching Problem and Its Applications in Proteomics. RECOMB (2011)

Amihood Amir.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Amihood Amir