A time-space tradeoff for element distinctness

A. Borodin; F. Fich; F. Meyer auf der Heide; E. Upfal; A. Wigderson

doi:10.1007/3-540-16078-7_89

A time-space tradeoff for element distinctness

A. Borodin
, F. Fich
, F. Meyer auf der Heide
, E. Upfal
, A. Wigderson

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

In “A Time Space Tradeoff for Sorting on non-Oblivious Machines”, Borodin et al. [B - 81] proved that to sort n elements requires TS = Ω(n²) where T=time and S=space on a comparison based branching problem. Although element distinctness and sorting are equivalent problems on a computation tree, the stated tradeoff result does not immediately follow for element distinctness or indeed for any decision problem. In this paper, we are able to show that TS=Ω(n^3/2) for deciding element distinctness (or the sign of a permutation).

Original language	English
Title of host publication	STACS 86 - 3rd Annual Symposium on Theoretical Aspects of Computer Science
Editors	B. Monien, G. Vidal-Naquet
Publisher	Springer Verlag
Pages	353-358
Number of pages	6
ISBN (Print)	9783540160786
DOIs	https://doi.org/10.1007/3-540-16078-7_89
State	Published - 1986
Externally published	Yes
Event	3rd Annual Symposium on Theoretical Aspects of Computer Science, STACS 1986 - Orsay, France Duration: 16 Jan 1986 → 18 Jan 1986

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	210 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	3rd Annual Symposium on Theoretical Aspects of Computer Science, STACS 1986
Country/Territory	France
City	Orsay
Period	16/01/86 → 18/01/86

Bibliographical note

Publisher Copyright:
© 1986, Springer-Verlag.

Access to Document

10.1007/3-540-16078-7_89

Cite this

Borodin, A., Fich, F., Meyer auf der Heide, F., Upfal, E., & Wigderson, A. (1986). A time-space tradeoff for element distinctness. In B. Monien, & G. Vidal-Naquet (Eds.), STACS 86 - 3rd Annual Symposium on Theoretical Aspects of Computer Science (pp. 353-358). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 210 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-16078-7_89

Borodin, A. ; Fich, F. ; Meyer auf der Heide, F. et al. / A time-space tradeoff for element distinctness. STACS 86 - 3rd Annual Symposium on Theoretical Aspects of Computer Science. editor / B. Monien ; G. Vidal-Naquet. Springer Verlag, 1986. pp. 353-358 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{98996f40c5c144a792f837267382f7b8,

title = "A time-space tradeoff for element distinctness",

abstract = "In “A Time Space Tradeoff for Sorting on non-Oblivious Machines”, Borodin et al. [B - 81] proved that to sort n elements requires TS = Ω(n2) where T=time and S=space on a comparison based branching problem. Although element distinctness and sorting are equivalent problems on a computation tree, the stated tradeoff result does not immediately follow for element distinctness or indeed for any decision problem. In this paper, we are able to show that TS=Ω(n3/2) for deciding element distinctness (or the sign of a permutation).",

author = "A. Borodin and F. Fich and \{Meyer auf der Heide\}, F. and E. Upfal and A. Wigderson",

note = "Publisher Copyright: {\textcopyright} 1986, Springer-Verlag.; 3rd Annual Symposium on Theoretical Aspects of Computer Science, STACS 1986 ; Conference date: 16-01-1986 Through 18-01-1986",

year = "1986",

doi = "10.1007/3-540-16078-7\_89",

language = "אנגלית",

isbn = "9783540160786",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "353--358",

editor = "B. Monien and G. Vidal-Naquet",

booktitle = "STACS 86 - 3rd Annual Symposium on Theoretical Aspects of Computer Science",

address = "גרמניה",

}

Borodin, A, Fich, F, Meyer auf der Heide, F, Upfal, E & Wigderson, A 1986, A time-space tradeoff for element distinctness. in B Monien & G Vidal-Naquet (eds), STACS 86 - 3rd Annual Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 210 LNCS, Springer Verlag, pp. 353-358, 3rd Annual Symposium on Theoretical Aspects of Computer Science, STACS 1986, Orsay, France, 16/01/86. https://doi.org/10.1007/3-540-16078-7_89

A time-space tradeoff for element distinctness. / Borodin, A.; Fich, F.; Meyer auf der Heide, F. et al.
STACS 86 - 3rd Annual Symposium on Theoretical Aspects of Computer Science. ed. / B. Monien; G. Vidal-Naquet. Springer Verlag, 1986. p. 353-358 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 210 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A time-space tradeoff for element distinctness

AU - Borodin, A.

AU - Fich, F.

AU - Meyer auf der Heide, F.

AU - Upfal, E.

AU - Wigderson, A.

PY - 1986

Y1 - 1986

N2 - In “A Time Space Tradeoff for Sorting on non-Oblivious Machines”, Borodin et al. [B - 81] proved that to sort n elements requires TS = Ω(n2) where T=time and S=space on a comparison based branching problem. Although element distinctness and sorting are equivalent problems on a computation tree, the stated tradeoff result does not immediately follow for element distinctness or indeed for any decision problem. In this paper, we are able to show that TS=Ω(n3/2) for deciding element distinctness (or the sign of a permutation).

AB - In “A Time Space Tradeoff for Sorting on non-Oblivious Machines”, Borodin et al. [B - 81] proved that to sort n elements requires TS = Ω(n2) where T=time and S=space on a comparison based branching problem. Although element distinctness and sorting are equivalent problems on a computation tree, the stated tradeoff result does not immediately follow for element distinctness or indeed for any decision problem. In this paper, we are able to show that TS=Ω(n3/2) for deciding element distinctness (or the sign of a permutation).

UR - https://www.scopus.com/pages/publications/85034779494

U2 - 10.1007/3-540-16078-7_89

DO - 10.1007/3-540-16078-7_89

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85034779494

SN - 9783540160786

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 353

EP - 358

BT - STACS 86 - 3rd Annual Symposium on Theoretical Aspects of Computer Science

A2 - Monien, B.

A2 - Vidal-Naquet, G.

PB - Springer Verlag

T2 - 3rd Annual Symposium on Theoretical Aspects of Computer Science, STACS 1986

Y2 - 16 January 1986 through 18 January 1986

ER -

Borodin A, Fich F, Meyer auf der Heide F, Upfal E, Wigderson A. A time-space tradeoff for element distinctness. In Monien B, Vidal-Naquet G, editors, STACS 86 - 3rd Annual Symposium on Theoretical Aspects of Computer Science. Springer Verlag. 1986. p. 353-358. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-16078-7_89

A time-space tradeoff for element distinctness

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this