scientific article; zbMATH DE number 4020488

MaRDI QIDQ3763598zbMATH OpenFDO

Authors Alok Aggarwal, Jeffrey Scott Vitter

Publication date 1987

zbMATH Keywords

fast Fourier transformpermutation networkspermuting recordssortingupper and lower bounds

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Algorithms for parallel memory, I: Two-level memories
• scientific article; zbMATH DE number 176491
• scientific article; zbMATH DE number 1792107
• A general lower bound on the I/O-complexity of comparison-based algorithms

Cited in

(12)

• Algorithms for parallel memory, I: Two-level memories
• scientific article; zbMATH DE number 1617279 (Why is no real title available?)
• Lower bounds for external algebraic decision trees
• Strong I/O lower bounds for binomial and FFT computation graphs
• Efficient Bundle Sorting
• scientific article; zbMATH DE number 1445385 (Why is no real title available?)
• Algorithmic Building Blocks for Asymmetric Memories
• The buffer tree: A new technique for optimal I/O-algorithms
• A general lower bound on the I/O-complexity of comparison-based algorithms
• Lower bounds for external memory integer sorting via network coding
• Lower bounds for external memory integer sorting via network coding
• Ranked Document Retrieval in External Memory

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3763598)