Permuting Information in Idealized Two-Level Storage

DOI10.1007/978-1-4684-2001-2_10MaRDI QIDQ4999426zbMATH OpenOpenAlexWikidataFDO

Authors Robert W. Floyd

Publication date 6 July 2021

Published in Complexity of Computer Computations (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-1-4684-2001-2_10

zbMATH Keywords

binary expansionBoolean matrixcore memorylarge memorynegligible cost

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Cited in

(7)

• Generalization of Floyd's model of permuting information in idealized two-level storage
• Bounds on the size of merging networks
• A logarithmic lower bound for oblivious RAM (for all Parameters)
• scientific article; zbMATH DE number 647706 (Why is no real title available?)
• Permuting and batched geometric lower bounds in the I/O model
• A logarithmic lower bound for oblivious RAM (for all parameters)
• A survey of polynomial multiplications for lattice-based cryptosystems

This page was built for publication: Permuting Information in Idealized Two-Level Storage

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