Permuting Information in Idealized Two-Level Storage

  • Robert W. Floyd
Part of the The IBM Research Symposia Series book series (IRSS)


Assume a computer with a (relatively) slow and large memory consisting of pages, each with a capacity of p records. Available operations for manipulating information in slow memory are limited to selecting two pages, forming a subset, of size at most p, from the union of the two pages, and storing this subset in a third page.


Large Memory Boolean Matrix Binary Expansion Core Memory Negligible Cost 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Plenum Press, New York 1972

Authors and Affiliations

  • Robert W. Floyd
    • 1
  1. 1.Computer Science DepartmentStanford UniversityUSA

Personalised recommendations