Efficient computations of l (1) and l (infinity) rearrangement distances

A. Amihood, Y Aumann, P Indyk, A. Levy, E Porat

Research output: Contribution to journal › Article › peer-review

Original language	American English
Pages (from-to)	4382-4390
Journal	Theoretical Computer Science
Volume	410
Issue number	43
State	Published - 2009

Cite this

@article{bc154fd68b2f4b78be6b276f592de8c4,

title = "Efficient computations of l (1) and l (infinity) rearrangement distances",

author = "A. Amihood and Y Aumann and P Indyk and A. Levy and E Porat",

year = "2009",

language = "American English",

volume = "410",

pages = "4382--4390",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

number = "43",

}

TY - JOUR

T1 - Efficient computations of l (1) and l (infinity) rearrangement distances

AU - Amihood, A.

AU - Aumann, Y

AU - Indyk, P

AU - Levy, A.

AU - Porat, E

PY - 2009

Y1 - 2009

UR - https://scholar.google.co.il/scholar?q=Efficient+computations+of+l1+and+l+INFINITY++rearrangement+distances&btnG=&hl=en&as_sdt=0%2C5

M3 - Article

SN - 0304-3975

VL - 410

SP - 4382

EP - 4390

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 43

ER -