Near-Optimal Time-Space Tradeoff for Element Distinctness
- 1 October 1994
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 23 (5) , 966-975
- https://doi.org/10.1137/s0097539788148959
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- A general Sequential Time-Space Tradeoff for Finding Unique ElementsSIAM Journal on Computing, 1991
- A Time-Space Tradeoff for Element DistinctnessSIAM Journal on Computing, 1987
- Two time-space tradeoffs for element distinctnessTheoretical Computer Science, 1986
- A time-space tradeoff for language recognitionTheory of Computing Systems, 1984
- On the time-space tradeoff for sorting with linear queriesTheoretical Computer Science, 1982
- A Time-Space Tradeoff for Sorting on a General Sequential Model of ComputationSIAM Journal on Computing, 1982
- A time-space tradeoff for sorting on non-oblivious machinesJournal of Computer and System Sciences, 1981
- Time-space tradeoffs for computing functions, using connectivity properties of their circuitsJournal of Computer and System Sciences, 1980
- Area-time complexity for VLSIPublished by Association for Computing Machinery (ACM) ,1979
- Selection and sorting with limited storagePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978