default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAvivit Levy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j26]Avivit Levy, Adi Barash, Chen Zaguri, Ariel Hadad, Polina Polsky:
Improving deep learning based bluespotted ribbontail ray (Taeniura Lymma) recognition. Ecol. Informatics 82: 102737 (2024)- [j25]Amihood Amir, Eitan Kondratovsky, Avivit Levy
:
On suffix tree detection. Theor. Comput. Sci. 1012: 114728 (2024) - [c33]Avivit Levy, Dana Shapira:
Computation over APT Compressed Data. DCC 2024: 153-162 - [c32]Itai Boneh, Shay Golan, Avivit Levy, Ely Porat, B. Riva Shalom:
Burst Edit Distance. SPIRE 2024: 41-56 - [i5]Avivit Levy, B. Riva Shalom, Michal Chalamish:
A Guide to Similarity Measures. CoRR abs/2408.07706 (2024) - 2023
- [c31]Amihood Amir, Eitan Kondratovsky, Avivit Levy:
On Suffix Tree Detection. SPIRE 2023: 14-27 - 2022
- [j24]Avivit Levy, B. Riva Shalom:
A Comparative Study of Dictionary Matching with Gaps: Limitations, Techniques and Challenges. Algorithmica 84(3): 590-638 (2022) - [j23]Amihood Amir, Ayelet Butman, Eitan Kondratovsky, Avivit Levy, Dina Sokol:
Multidimensional Period Recovery. Algorithmica 84(6): 1490-1510 (2022) - [c30]Avivit Levy, Ely Porat, B. Riva Shalom:
Partial Permutations Comparison, Maintenance and Applications. CPM 2022: 10:1-10:17 - 2021
- [c29]Avivit Levy:
Exploiting Pseudo-locality of Interchange Distance. SPIRE 2021: 227-240 - 2020
- [j22]Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom:
Online recognition of dictionary with one gap. Inf. Comput. 275: 104633 (2020) - [j21]Avivit Levy, B. Riva Shalom:
Online parameterized dictionary matching with one gap. Theor. Comput. Sci. 845: 208-229 (2020) - [c28]Amihood Amir, Ayelet Butman, Eitan Kondratovsky, Avivit Levy, Dina Sokol:
Multidimensional Period Recovery. SPIRE 2020: 115-130
2010 – 2019
- 2019
- [j20]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): 2123-2157 (2019) - [j19]Amihood Amir, Avivit Levy, Moshe Lewenstein, Ronit Lubin, Benny Porat:
Can We Recover the Cover? Algorithmica 81(7): 2857-2875 (2019) - [j18]Amihood Amir, Avivit Levy, Ronit Lubin, Ely Porat:
Approximate cover of strings. Theor. Comput. Sci. 793: 59-69 (2019) - [c27]Avivit Levy, B. Riva Shalom:
Online Parameterized Dictionary Matching with One Gap. Stringology 2019: 41-55 - 2018
- [c26]Amihood Amir, Avivit Levy, Ely Porat:
Quasi-Periodicity Under Mismatch Errors. CPM 2018: 4:1-4:15 - 2017
- [c25]Amihood Amir, Avivit Levy, Moshe Lewenstein, Ronit Lubin, Benny Porat:
Can We Recover the Cover?. CPM 2017: 25:1-25:15 - [c24]Amihood Amir, Avivit Levy, Ronit Lubin, Ely Porat:
Approximate Cover of Strings. CPM 2017: 26:1-26:14 - [c23]Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom:
Online Recognition of Dictionary with One Gap. Stringology 2017: 3-17 - 2016
- [j17]Gary Benson, Avivit Levy, S. Maimoni, D. Noifeld, B. Riva Shalom:
LCSk: A refined similarity measure. Theor. Comput. Sci. 638: 11-26 (2016) - [c22]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: 12:1-12:12 - 2015
- [j16]Amihood Amir, Estrella Eisenberg, Avivit Levy:
Approximate periodicity. Inf. Comput. 241: 215-226 (2015) - [j15]Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom:
Dictionary matching with a few gaps. Theor. Comput. Sci. 589: 34-46 (2015) - [i4]Amihood Amir, Tsvi Kopelowitz, Avivit Levy, Seth Pettie, Ely Porat, B. Riva Shalom:
Online Dictionary Matching with One Gap. CoRR abs/1503.07563 (2015) - 2014
- [j14]Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat:
Range LCP. J. Comput. Syst. Sci. 80(7): 1245-1253 (2014) - [j13]Amihood Amir, Alberto Apostolico, Estrella Eisenberg, Gad M. Landau, Avivit Levy, Noa Lewenstein:
Detecting approximate periodic patterns. Theor. Comput. Sci. 525: 60-67 (2014) - [j12]Amihood Amir, Estrella Eisenberg, Avivit Levy, Noa Lewenstein:
Closest periodic vectors in Lp spaces. Theor. Comput. Sci. 533: 26-36 (2014) - [c21]Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom:
Dictionary Matching with One Gap. CPM 2014: 11-20 - [i3]Gary Benson, Avivit Levy, B. Riva Shalom:
Longest Common Subsequence in k-length substrings. CoRR abs/1402.2097 (2014) - [i2]Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom:
Dictionary Matching with One Gap. CoRR abs/1408.2350 (2014) - 2013
- [j11]Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann:
On approximating string selection problems with outliers. Theor. Comput. Sci. 498: 107-114 (2013) - [c20]Gary Benson, Avivit Levy, B. Riva Shalom:
Longest Common Subsequence in k Length Substrings. SISAP 2013: 257-265 - 2012
- [j10]Amihood Amir, Estrella Eisenberg, Avivit Levy, Ely Porat, Natalie Shapira:
Cycle detection and correction. ACM Trans. Algorithms 9(1): 13:1-13:20 (2012) - [j9]Amihood Amir, Yonatan Aumann, Avivit Levy, Yuri Roshko:
Quasi-distinct parsing and optimal compression methods. Theor. Comput. Sci. 422: 1-14 (2012) - [c19]Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann:
On Approximating String Selection Problems with Outliers. CPM 2012: 427-438 - [c18]Amihood Amir, Alberto Apostolico, Estrella Eisenberg, Gad M. Landau, Avivit Levy, Noa Lewenstein:
Detecting Approximate Periodic Patterns. MedAlg 2012: 1-12 - [c17]Amihood Amir, Avivit Levy:
Approximate Period Detection and Correction. SPIRE 2012: 1-15 - [c16]Martin Charles Golumbic, Michal Stern, Avivit Levy, Gila Morgenstern:
Student Poster Session. WG 2012: 4-6 - [e1]Martin Charles Golumbic, Michal Stern, Avivit Levy, Gila Morgenstern:
Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers. Lecture Notes in Computer Science 7551, Springer 2012, ISBN 978-3-642-34610-1 [contents] - [i1]Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann:
On Approximating String Selection Problems with Outliers. CoRR abs/1202.2820 (2012) - 2011
- [j8]Gad M. Landau, Avivit Levy, Ilan Newman:
LCS approximation via embedding into locally non-repetitive strings. Inf. Comput. 209(4): 705-716 (2011) - [j7]Amihood Amir, Estrella Eisenberg, Orgad Keller, Avivit Levy, Ely Porat:
Approximate string matching with stuck address bits. Theor. Comput. Sci. 412(29): 3537-3544 (2011) - [c15]Danny Hermelin, Avivit Levy, Oren Weimann, Raphael Yuster:
Distance Oracles for Vertex-Labeled Graphs. ICALP (2) 2011: 490-501 - [c14]Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat:
Range LCP. ISAAC 2011: 683-692 - [c13]Amihood Amir, Estrella Eisenberg, Avivit Levy, Noa Lewenstein:
Closest Periodic Vectors in L p Spaces. ISAAC 2011: 714-723 - 2010
- [c12]Amihood Amir, Avivit Levy:
String Rearrangement Metrics: A Survey. Algorithms and Applications 2010: 1-33 - [c11]Amihood Amir, Estrella Eisenberg, Avivit Levy, Ely Porat, Natalie Shapira:
Cycle Detection and Correction. ICALP (1) 2010: 43-54 - [c10]Amihood Amir, Estrella Eisenberg, Avivit Levy:
Approximate Periodicity. ISAAC (1) 2010: 25-36 - [c9]Amihood Amir, Estrella Eisenberg, Orgad Keller, Avivit Levy, Ely Porat:
Approximate String Matching with Stuck Address Bits. SPIRE 2010: 395-405
2000 – 2009
- 2009
- [j6]Amihood Amir, Yonatan Aumann, Gary Benson, Avivit Levy, Ohad Lipsky, Ely Porat, Steven Skiena, Uzi Vishne:
Pattern matching with address errors: Rearrangement distances. J. Comput. Syst. Sci. 75(6): 359-370 (2009) - [j5]Amihood Amir, Tzvika Hartman, Oren Kapah, Avivit Levy, Ely Porat:
On the Cost of Interchange Rearrangement in Strings. SIAM J. Comput. 39(4): 1444-1461 (2009) - [j4]Oren Kapah, Gad M. Landau, Avivit Levy, Nitsan Oz:
Interchange rearrangement: The element-cost model. Theor. Comput. Sci. 410(43): 4315-4326 (2009) - [j3]Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat:
Efficient computations of l1 and l∞ rearrangement distances. Theor. Comput. Sci. 410(43): 4382-4390 (2009) - [j2]Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat:
Approximate string matching with address bit errors. Theor. Comput. Sci. 410(51): 5334-5346 (2009) - [c8]Amihood Amir, Yonatan Aumann, Avivit Levy, Yuri Roshko:
Quasi-distinct Parsing and Optimal Compression Methods. CPM 2009: 12-25 - [c7]Gad M. Landau, Avivit Levy, Ilan Newman:
LCS Approximation via Embedding into Local Non-repetitive Strings. CPM 2009: 92-105 - 2008
- [j1]Amihood Amir, Avivit Levy, Liron Reuveni:
The Practical Efficiency of Convolutions in Pattern Matching Algorithms. Fundam. Informaticae 84(1): 1-15 (2008) - [c6]Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat:
Approximate String Matching with Address Bit Errors. CPM 2008: 118-129 - [c5]Oren Kapah, Gad M. Landau, Avivit Levy, Nitsan Oz:
Interchange Rearrangement: The Element-Cost Model. SPIRE 2008: 224-235 - 2007
- [c4]Amihood Amir, Tzvika Hartman, Oren Kapah, Avivit Levy, Ely Porat:
On the Cost of Interchange Rearrangement in Strings. ESA 2007: 99-110 - [c3]Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat:
Efficient Computations of l1 and linfinity Rearrangement Distances. SPIRE 2007: 39-49 - 2006
- [c2]Amihood Amir, Yonatan Aumann, Gary Benson, Avivit Levy, Ohad Lipsky, Ely Porat, Steven Skiena, Uzi Vishne:
Pattern matching with address errors: rearrangement distances. SODA 2006: 1221-1229
1990 – 1999
- 1999
- [c1]Yonatan Aumann, Avivit Kapah-Levy:
Cooperative Sharing and Asynchronous Consensus Using Single-Reader Single-Writer Registers. SODA 1999: 61-70
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
