B. Riva Shalom

According to our database, B. Riva Shalom authored at least 24 papers between 2004 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

A Guide to Similarity Measures.

Avivit Levy, B. Riva Shalom, Michal Chalamish

CoRR, 2024

Burst Edit Distance.

Itai Boneh, Shay Golan, Avivit Levy, Ely Porat, B. Riva Shalom

Proceedings of the String Processing and Information Retrieval, 2024

A Multi-clustering Unbiased Relative Prediction Recommendation Scheme for Data with Hidden Multiple Overlaps.

Avivit Levy, Michal Chalamish, B. Riva Shalom, Guy Sharir, Opal Peltzman, Sivan Salzmann

Proceedings of the Intelligent Computing, 2024

2022

A Comparative Study of Dictionary Matching with Gaps: Limitations, Techniques and Challenges.

Avivit Levy, B. Riva Shalom

Algorithmica, 2022

Partial Permutations Comparison, Maintenance and Applications.

Avivit Levy, Ely Porat, B. Riva Shalom

Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

2021

Parameterized dictionary matching and recognition with one gap.

B. Riva Shalom

Theor. Comput. Sci., 2021

2020

Online parameterized dictionary matching with one gap.

Avivit Levy, B. Riva Shalom

Theor. Comput. Sci., 2020

Online recognition of dictionary with one gap.

Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom

Inf. Comput., 2020

2019

Mind the Gap! - Online Dictionary Matching with One Gap.

Amihood Amir, Tsvi Kopelowitz, Avivit Levy, Seth Pettie, Ely Porat, B. Riva Shalom

Algorithmica, 2019

2018

Parameterized Dictionary Matching with One Gap.

B. Riva Shalom

Proceedings of the Prague Stringology Conference 2018, 2018

2016

LCSk: A refined similarity measure.

Gary Benson, Avivit Levy, S. Maimoni, D. Noifeld, B. Riva Shalom

Theor. Comput. Sci., 2016

Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap.

Amihood Amir, Tsvi Kopelowitz, Avivit Levy, Seth Pettie, Ely Porat, B. Riva Shalom

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

2015

Dictionary matching with a few gaps.

Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom

Theor. Comput. Sci., 2015

Online Dictionary Matching with One Gap.

Amihood Amir, Tsvi Kopelowitz, Avivit Levy, Seth Pettie, Ely Porat, B. Riva Shalom

CoRR, 2015

2014

Dictionary Matching with One Gap.

Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom

Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

2013

Longest Common Subsequence in k Length Substrings.

Gary Benson, Avivit Levy, B. Riva Shalom

Proceedings of the Similarity Search and Applications - 6th International Conference, 2013

2011

Weighted Shortest Common Supersequence.

Amihood Amir, Zvi Gotthilf, B. Riva Shalom

Proceedings of the String Processing and Information Retrieval, 2011

2010

Weighted LCS.

Amihood Amir, Zvi Gotthilf, B. Riva Shalom

J. Discrete Algorithms, 2010

String matching with up to k swaps and mismatches.

Ohad Lipsky, Benny Porat, Ely Porat, B. Riva Shalom, Asaf Tsur

Inf. Comput., 2010

2008

Generalized LCS.

Amihood Amir, Tzvika Hartman, Oren Kapah, B. Riva Shalom, Dekel Tsur

Theor. Comput. Sci., 2008

2007

Searching for a set of correlated patterns.

Shmuel T. Klein, B. Riva Shalom, Yair Kaufman

J. Discrete Algorithms, 2007

Improved approximate common interval.

Amihood Amir, Leszek Gasieniec, B. Riva Shalom

Inf. Process. Lett., 2007

Approximate String Matching with Swap and Mismatch.

Ohad Lipsky, Benny Porat, Ely Porat, B. Riva Shalom, Asaf Tsur

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2004

Searching for a Set of Correlated Patterns.

Shmuel T. Klein, B. Riva Shalom

Proceedings of the String Processing and Information Retrieval, 2004