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 Optimal Drum Scheduling Algorithm

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

DOI10.1109/T-C.1972.223472zbMath0244.68005OpenAlexW2107092025MaRDI QIDQ5656371

Samuel H. Fuller

Publication date: 1972

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/t-c.1972.223472



Mathematics Subject Classification ID

General topics in the theory of software (68N01) Algorithms in computer science (68W99)


Related Items (2)

The optimum execution order of queries in linear storage ⋮ New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization




This page was built for publication: An Optimal Drum Scheduling Algorithm

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