NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.
Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.
An official website of the United States government
Here’s how you know
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
Algorithms and Data Structures for New Models of Computation
Published
Author(s)
Paul Black, David W. Flater, Irena Bojanova
Abstract
In the early days of computer science, the community settled on a simple standard model of computing and a basic canon of general purpose algorithms and data structures suited to that model. With isochronous computing, heterogeneous multiprocessors, flash memory, energy-aware computing, cache and other anisotropic memory, distributed computing, streaming environments, functional languages, graphics coprocessors, and so forth, the basic canon of algorithms and data structures is not enough. Software developers know of real-world constraints and new models of computation and use them to design effective algorithms and data structures. These constraints motivate the development of elegant algorithms with broad utility. As examples, we present four algorithms that were motivated by specific constraints, but are generally useful: reservoir sampling, majority of a stream, B-heap, and compacting an array in Theta(log n) time.
Black, P.
, Flater, D.
and Bojanova, I.
(2021),
Algorithms and Data Structures for New Models of Computation, IT Professional (IEEE), [online], https://doi.org/10.1109/MITP.2020.3042858, https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=931070
(Accessed October 2, 2025)