On the public citation graph

Optimum Storage Allocation for Initial Loading of a File

0 signed · 26 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/0016-0032(58)90688-4openalex-snapshot
An introduction to probability theory and its applications
inferredcites →https://doi.org/10.1145/357980.357996openalex-snapshot
Scatter storage techniques
inferredcites →https://doi.org/10.1145/362575.362578openalex-snapshot
Key-to-address transform techniques
inferredcites →https://doi.org/10.1147/sj.22.0086openalex-snapshot
File organization and addressing
inferredcites →https://doi.org/10.1147/sj.22.0112openalex-snapshot
Note on random addressing techniques
inferredcites →https://doi.org/10.2307/2279333openalex-snapshot
Poisson's Exponential Binomial Limit.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-1-4612-5798-1_12openalex-snapshot
Linear Probing and Related Problems
inferred← citeshttps://doi.org/10.1007/bf02136030openalex-snapshot
Hashing with Overflow Indexing
inferred← citeshttps://doi.org/10.1016/0306-4379(75)90023-xopenalex-snapshot
Analysis of collisions when hashing by division
inferred← citeshttps://doi.org/10.1016/0306-4379(78)90024-8openalex-snapshot
Formulation of choice criterions for file organizations
inferred← citeshttps://doi.org/10.1016/0306-4379(79)90002-4openalex-snapshot
Overflow handling in hashing tables: A hybrid approach
inferred← citeshttps://doi.org/10.1016/0306-4379(83)90007-8openalex-snapshot
Analysis of linear probing with buckets
inferred← citeshttps://doi.org/10.1016/b978-0-08-027202-3.50023-7openalex-snapshot
A NETWORK STRUCTURE STUDY OF THE ERRORS IN DATABASES
inferred← citeshttps://doi.org/10.1145/2157.322407openalex-snapshot
Analysis of Uniform Hashing
inferred← citeshttps://doi.org/10.1145/319540.319564openalex-snapshot
New file organization based on dynamic hashing
inferred← citeshttps://doi.org/10.1145/322154.322159openalex-snapshot
Performance Measures for Ordered Lists in Random-Access Files
inferred← citeshttps://doi.org/10.1145/322203.322209openalex-snapshot
A New Approach to the Analysis of Linear Probing Schemes
inferred← citeshttps://doi.org/10.1145/356643.356645openalex-snapshot
Hash Table Methods
inferred← citeshttps://doi.org/10.1145/359060.359077openalex-snapshot
Optimal storage allocation for serial files
inferred← citeshttps://doi.org/10.1145/359436.359438openalex-snapshot
Improving the access time for random access files
inferred← citeshttps://doi.org/10.1145/4372.4377openalex-snapshot
A probability model for overflow sufficiency in small hash tables
inferred← citeshttps://doi.org/10.1145/4372.4378openalex-snapshot
The P 2 algorithm for dynamic calculation of quantiles and histograms without storing observations
inferred← citeshttps://doi.org/10.1145/509252.509280openalex-snapshot
A procedure for the determination of attribute access probabilities
inferred← citeshttps://doi.org/10.1147/rd.171.0027openalex-snapshot
Optimum Storage Allocation for a File in Steady State
inferred← citeshttps://doi.org/10.1147/sj.153.0253openalex-snapshot
Data base systems [Readings]
inferred← citeshttps://doi.org/10.1147/sj.163.0208openalex-snapshot
Data structures and data accessing in data base systems past, present, future
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.