On the public citation graph
Optimal and Near-Optimal Scheduling Algorithms for Batched Processing in Linear Storage
0 signed · 20 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_11openalex-snapshot
An n log n Algorithm to Distribute n Records Optimally in a Sequential Access File
inferredcites →https://doi.org/10.1007/bf00979370openalex-snapshot
Near-optimal heuristics for an assignment problem in mass storage
inferredcites →https://doi.org/10.1016/s0019-9958(72)90211-2openalex-snapshot
Minimizing expected travel time on geometrical patterns by optimal probability rearrangements
inferredcites →https://doi.org/10.1109/tsmc.1973.4309295openalex-snapshot
Introduction to Stochastic Processes
inferredcites →https://doi.org/10.1137/0204023openalex-snapshot
Near-Optimal Solutions to a 2-Dimensional Placement Problem
inferredcites →https://doi.org/10.1145/320473.320487openalex-snapshot
Batched searching of sequential and tree structured files
inferredcites →https://doi.org/10.1145/321765.321775openalex-snapshot
Placement of Records on a Secondary Storage Device to Minimize Access Time
inferredcites →https://doi.org/10.1145/321784.321790openalex-snapshot
On the Optimality of the Probability Ranking Scheme in Storage Applications
inferredcites →https://doi.org/10.1145/322077.322085openalex-snapshot
Dynamic Placement of Records in Linear Storage
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bfb0022496openalex-snapshot
On some discrete optimization problems in mass storage systems
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90083-aopenalex-snapshot
The optimum execution order of queries in linear storage
inferred← citeshttps://doi.org/10.1109/69.940734openalex-snapshot
Segmented information dispersal (SID) data layouts for digital video servers
inferred← citeshttps://doi.org/10.1109/smc53992.2023.10393915openalex-snapshot
Carousel Storage and Picking Scheduling Issues: A Review
inferred← citeshttps://doi.org/10.1109/tse.1987.233515openalex-snapshot
On Multiple Random Accesses and Physical Data Placement in Dynamic Files
inferred← citeshttps://doi.org/10.1111/j.1467-9574.2010.00454.xopenalex-snapshot
A survey on performance analysis of warehouse carousel systems
inferred← citeshttps://doi.org/10.1137/0209017openalex-snapshot
Voronoui Diagrams in $L_1 (L_\infty )$ Metrics with 2-Dimensional Storage Applications
inferred← citeshttps://doi.org/10.1145/356810.356814openalex-snapshot
Minimizing Expected Head Movement in One-Dimensional and Two-Dimensional Mass Storage Systems
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.