{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,23]],"date-time":"2026-09-23T17:38:14Z","timestamp":1790185094056,"version":"4.1.0"},"reference-count":12,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1994,10]]},"abstract":"<jats:p>It was conjectured in Borodin et al. [J. Comput. System Sci., 22 (1981), pp. 351\u2013364] that to solve the element distinctness problem requires $TS = \\Omega (n^2 )$ on a comparison-based branching program using space S and time T, which, if true, would be close to optimal since $TS = O((n\\log n)^2 )$ is achievable. Recently, Borodin et al. [SIAM J. Comput.,16 (1987), pp. 97\u201399] showed that $TS = \\Omega (n^{{3 \/ 2}} (\\log n)^{{1 \/ 2}} )$. This paper presents a near-optimal tradeoff $TS = \\Omega (n^{2 - \\epsilon (n)} )$, where $ \\epsilon (n) = O({1 \/ {(\\log n)^{{1 \/ 2}} }})$.<\/jats:p>","DOI":"10.1137\/s0097539788148959","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:39:46Z","timestamp":1109227186000},"page":"966-975","source":"Crossref","is-referenced-by-count":19,"title":["Near-Optimal Time-Space Tradeoff for Element Distinctness"],"prefix":"10.1137","volume":"23","author":[{"given":"Andrew Chi-Chih","family":"Yao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"RB","doi-asserted-by":"publisher","DOI":"10.1137\/0220017"},{"key":"RBC","doi-asserted-by":"publisher","DOI":"10.1137\/0211022"},{"key":"RBFMUW","doi-asserted-by":"publisher","DOI":"10.1137\/0216007"},{"key":"RBFKLT","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(81)90037-4"},{"key":"RC","unstructured":"A. Cobham,  The recognition problem for the set of perfect squares, Research paper, RC-1704, IBM Watson Research Center, Yorktown Heights, NY,  1966, April"},{"key":"RDG","doi-asserted-by":"publisher","DOI":"10.1007\/BF01744430"},{"key":"RK","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(86)90150-7"},{"key":"RMP","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1978.32"},{"key":"RTH","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804401"},{"key":"RTO","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(80)90056-2"},{"key":"RU","volume-title":"Computational Aspects of VLSI","author":"Ullman J. D.","year":"1984"},{"key":"RY","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(82)90060-3"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S0097539788148959","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:43:07Z","timestamp":1787337787000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/S0097539788148959"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":12,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["10.1137\/S0097539788148959"],"URL":"https:\/\/doi.org\/10.1137\/s0097539788148959","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}