Search results for "Avivit Levy"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Amihood Amir, Yonatan Aumann, Avivit Levy, Yuri Roshko	Quasi-distinct parsing and optimal compression methods.	Theor. Comput. Sci.	2012	DBLP DOI BibTeX RDF
1	Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann	On Approximating String Selection Problems with Outliers	CoRR	2012	DBLP BibTeX RDF
1	Amihood Amir, Estrella Eisenberg, Orgad Keller, Avivit Levy, Ely Porat	Approximate string matching with stuck address bits.	Theor. Comput. Sci.	2011	DBLP DOI BibTeX RDF
1	Gad M. Landau, Avivit Levy, Ilan Newman	LCS approximation via embedding into locally non-repetitive strings.	Inf. Comput.	2011	DBLP DOI BibTeX RDF
1	Danny Hermelin, Avivit Levy, Oren Weimann, Raphael Yuster	Distance Oracles for Vertex-Labeled Graphs.	ICALP	2011	DBLP DOI BibTeX RDF
1	Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat	Range LCP.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Amihood Amir, Estrella Eisenberg, Avivit Levy, Noa Lewenstein	Closest Periodic Vectors in L p Spaces.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Amihood Amir, Estrella Eisenberg, Avivit Levy, Ely Porat, Natalie Shapira	Cycle Detection and Correction.	ICALP	2010	DBLP DOI BibTeX RDF
1	Amihood Amir, Avivit Levy	String Rearrangement Metrics: A Survey.	Algorithms and Applications	2010	DBLP DOI BibTeX RDF
1	Amihood Amir, Estrella Eisenberg, Avivit Levy	Approximate Periodicity.	ISAAC	2010	DBLP DOI BibTeX RDF
1	Amihood Amir, Estrella Eisenberg, Orgad Keller, Avivit Levy, Ely Porat	Approximate String Matching with Stuck Address Bits.	SPIRE	2010	DBLP DOI BibTeX RDF
1	Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat	Efficient computations of l1 and l INFINITY rearrangement distances.	Theor. Comput. Sci.	2009	DBLP DOI BibTeX RDF
1	Oren Kapah, Gad M. Landau, Avivit Levy, Nitsan Oz	Interchange rearrangement: The element-cost model.	Theor. Comput. Sci.	2009	DBLP DOI BibTeX RDF
1	Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat	Approximate string matching with address bit errors.	Theor. Comput. Sci.	2009	DBLP DOI BibTeX RDF
1	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.	2009	DBLP DOI BibTeX RDF
1	Amihood Amir, Tzvika Hartman, Oren Kapah, Avivit Levy, Ely Porat	On the Cost of Interchange Rearrangement in Strings.	SIAM J. Comput.	2009	DBLP DOI BibTeX RDF
1	Gad M. Landau, Avivit Levy, Ilan Newman	LCS Approximation via Embedding into Local Non-repetitive Strings.	CPM	2009	DBLP DOI BibTeX RDF
1	Amihood Amir, Yonatan Aumann, Avivit Levy, Yuri Roshko	Quasi-distinct Parsing and Optimal Compression Methods.	CPM	2009	DBLP DOI BibTeX RDF
1	Amihood Amir, Avivit Levy, Liron Reuveni	The Practical Efficiency of Convolutions in Pattern Matching Algorithms.	Fundam. Inform.	2008	DBLP BibTeX RDF
1	Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat	Approximate String Matching with Address Bit Errors.	CPM	2008	DBLP DOI BibTeX RDF
1	Oren Kapah, Gad M. Landau, Avivit Levy, Nitsan Oz	Interchange Rearrangement: The Element-Cost Model.	SPIRE	2008	DBLP DOI BibTeX RDF	Interchange rearrangement, Cost models
1	Amihood Amir, Tzvika Hartman, Oren Kapah, Avivit Levy, Ely Porat	On the Cost of Interchange Rearrangement in Strings.	ESA	2007	DBLP DOI BibTeX RDF
1	Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat	Efficient Computations of l1 and linfinity Rearrangement Distances.	SPIRE	2007	DBLP DOI BibTeX RDF
1	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	DBLP DOI BibTeX RDF
1	Yonatan Aumann, Avivit Kapah-Levy	Cooperative Sharing and Asynchronous Consensus Using Single-Reader Single-Writer Registers.	SODA	1999	DBLP DOI BibTeX RDF

Publications of Avivit Levy Avivit Kapah-Levy ( http://dblp.L3S.de/Authors/Avivit_Levy )