I/O-Space Trade-Offs

We define external memory (or I/O) models which capture space complexity and develop a general technique for deriving I/O-space trade-offs in these models from internal memory model time-space tradeoffs. Using this technique we show strong I/O-space product lower bounds for Sorting and Element Distinctness. We also develop new space efficient external memory Sorting algorithms.

• Type: Conference
• Year: 2000
• Where: SWAT
• Authors: Lars Arge, Jakob Pagter
• Keywords: Algorithms, External Memory, Memory Model Time-space, Memory Sorting Algorithms, SWAT 2000