Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An n log n Algorithm to Distribute n Records Optimally in a Sequential Access File

From MaRDI portal
Publication:4999427
Jump to:navigation, search

DOI10.1007/978-1-4684-2001-2_11zbMath1467.68033OpenAlexW193061089MaRDI QIDQ4999427

Vaughan R. Pratt

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_11


Mathematics Subject Classification ID

Analysis of algorithms (68W40) Theory of operating systems (68N25)


Related Items

Methods for the one-dimensional space allocation problem



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4999427&oldid=19453072"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 10:59.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki