Permuting Information in Idealized Two-Level Storage

DOI10.1007/978-1-4684-2001-2_10zbMath1467.68048OpenAlexW1568228897WikidataQ67224676 ScholiaQ67224676MaRDI QIDQ4999426

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

Boolean matrixbinary expansioncore memorylarge memorynegligible cost

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Related Items (4)

A logarithmic lower bound for oblivious RAM (for all Parameters) ⋮ Bounds on the size of merging networks ⋮ Permuting and Batched Geometric Lower Bounds in the I/O Model ⋮ Generalization of Floyd's model of permuting information in idealized two-level storage

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