Permuting Information in Idealized Two-Level Storage
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.
KeywordsLarge Memory Boolean Matrix Binary Expansion Core Memory Negligible Cost
Unable to display preview. Download preview PDF.