On the public citation graph

Tightly controlled linear hashing without separate overflow storage

https://doi.org/10.1007/bf01932837

0 signed · 19 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.1007/bf01931695openalex-snapshot

Dynamic hashing

inferredcites →https://doi.org/10.1145/320083.320092openalex-snapshot

Extendible hashing—a fast access method for dynamic files

inferredcites →https://doi.org/10.1145/362375.362385openalex-snapshot

General performance analysis of key-to-address transformation methods using an abstract file concept

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-19074-0_60openalex-snapshot

Multilevel trie hashing

inferred← citeshttps://doi.org/10.1007/bf01935368openalex-snapshot

Partial match retrieval using recursive linear hashing

inferred← citeshttps://doi.org/10.1007/s00453-007-9155-xopenalex-snapshot

Optimality in External Memory Hashing

inferred← citeshttps://doi.org/10.1016/0020-0255(90)90026-7openalex-snapshot

Concurrent operations in linear hashing

inferred← citeshttps://doi.org/10.1016/0020-0255(93)90126-7openalex-snapshot

Concurrent operations in multi-attribute linear hashing

inferred← citeshttps://doi.org/10.1016/0020-0255(95)00048-topenalex-snapshot

Climbing hashing for expansible files

inferred← citeshttps://doi.org/10.1016/0306-4379(92)90032-iopenalex-snapshot

Linear-density hashing with dynamic overflow sharing

inferred← citeshttps://doi.org/10.1016/0306-4379(93)90030-5openalex-snapshot

Dynamic hashing with distributed overflow space: A file organization with good insertion performance

inferred← citeshttps://doi.org/10.1016/0306-4379(94)90005-1openalex-snapshot

Performance of linear hashing schemes for primary key retrieval

inferred← citeshttps://doi.org/10.1109/69.824617openalex-snapshot

Linear spiral hashing for expansible files

inferred← citeshttps://doi.org/10.1109/69.91065openalex-snapshot

Multilevel extendible hashing: a file structure for very large databases

inferred← citeshttps://doi.org/10.1145/101306.101308openalex-snapshot

A compendium of key search references

inferred← citeshttps://doi.org/10.1145/114325.103714openalex-snapshot

A dynamic hash method with signature

inferred← citeshttps://doi.org/10.1145/1270.1285openalex-snapshot

Recursive linear hashing

inferred← citeshttps://doi.org/10.1145/3148.3324openalex-snapshot

Linear hashing with overflow-handling by linear probing

inferred← citeshttps://doi.org/10.1145/46157.330532openalex-snapshot

Dynamic hashing schemes

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.