On the public citation graph

Parallel retrieval of scattered information

https://doi.org/10.1007/bfb0035775
0 signed · 22 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/0890-5401(87)90062-9openalex-snapshot
Towards optimal parallel bucket sorting
inferredcites →https://doi.org/10.1016/0890-5401(88)90039-9openalex-snapshot
Optimal parallel randomized algorithms for sparse addition and identification
inferredcites →https://doi.org/10.1016/0890-5401(89)90036-9openalex-snapshot
Faster optimal parallel prefix sums and list ranking
inferredcites →https://doi.org/10.1137/0215006openalex-snapshot
Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
inferredcites →https://doi.org/10.1137/0216053openalex-snapshot
Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
inferredcites →https://doi.org/10.1145/7902.7907openalex-snapshot
Parallel free-text search on the connection machine system
inferredcites →https://doi.org/10.1146/annurev.cs.03.060188.001313openalex-snapshot
Parallel Algorithmic Techniques For Combinational Computation

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-53487-3_42openalex-snapshot
The power of collision: Randomized parallel algorithms for chaining and integer sorting
inferred← citeshttps://doi.org/10.1007/3-540-55488-2_34openalex-snapshot
Complexity of Boolean functions on PRAMs - Lower bound techniques
inferred← citeshttps://doi.org/10.1007/3-540-55706-7_3openalex-snapshot
Retrieval of scattered information by EREW, CREW and CRCW PRAMs
inferred← citeshttps://doi.org/10.1007/bf01268141openalex-snapshot
Retrieval of scattered information by EREW, CREW, and CRCW PRAMs
inferred← citeshttps://doi.org/10.1007/bfb0032071openalex-snapshot
The parallel simplicity of compaction and chaining
inferred← citeshttps://doi.org/10.1007/s002240000070openalex-snapshot
Lower Bounds for Randomized Exclusive Write PRAMs
inferred← citeshttps://doi.org/10.1016/0022-0000(92)90006-5openalex-snapshot
Processor-time tradeoffs in PRAM simulations
inferred← citeshttps://doi.org/10.1016/0196-6774(91)90034-vopenalex-snapshot
On parallel hashing and integer sorting
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90031-vopenalex-snapshot
Improved deterministic parallel integer sorting
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80003-0openalex-snapshot
Exact lower time bounds for computing Boolean functions on CREW PRAMs
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185438openalex-snapshot
Towards a theory of nearly constant time parallel algorithms
inferred← citeshttps://doi.org/10.1137/s0097539791224030openalex-snapshot
The Random Adversary: A Lower-Bound Technique for Randomized Parallel Algorithms
inferred← citeshttps://doi.org/10.1145/103418.103453openalex-snapshot
Converting high probability into nearly-constant time---with applications to parallel hashing
inferred← citeshttps://doi.org/10.1145/215399.215454openalex-snapshot
Lower bounds for randomized exclusive write PRAMs
inferred← citeshttps://doi.org/10.1145/97444.97678openalex-snapshot
Exact time bounds for computing boolean functions on PRAMs without simultaneous writes
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.