Time-space tradeoffs for set operations

DOI10.1016/0304-3975(93)90352-TzbMath0777.68049OpenAlexW2077518665MaRDI QIDQ1210542

David Peleg, Boaz Patt-Shamir

Publication date: 30 August 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(93)90352-t

zbMATH Keywords

lower boundtime-space tradeoffbranching programs

Mathematics Subject Classification ID

Cites Work

• On the time-space tradeoff for sorting with linear queries
• Time-space tradeoffs for matrix multiplication and the discrete Fourier transform on any general sequential random-access computer
• Two time-space tradeoffs for element distinctness
• A time-space tradeoff for sorting on non-oblivious machines
• A Time-Space Tradeoff for Element Distinctness
• A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation

This page was built for publication: Time-space tradeoffs for set operations