Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Avivit Levy
Avivit Kapah-Levy
2010 – today
- 2012
[j10]Amihood Amir, Estrella Eisenberg, Avivit Levy, Ely Porat, Natalie Shapira: Cycle detection and correction. ACM Transactions on Algorithms 9(1): 13 (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]
- [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 (Eds.): 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
- [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]
- [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 INFINITY 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. Inform. 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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-28 18:10 CET by the dblp team