On the public citation graph

Locality-preserving hash functions for general purpose parallel computation

https://doi.org/10.1007/bf01185209
0 signed · 45 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.1002/zamm.19720520620openalex-snapshot
C. Forsythe and C. B. Moler, Computer Solution of Linear Algebraic Systems. (Series in Automatic Computation) XI + 148 S. Englewood Cliffs, N.J. 1967. Prentice‐Hall, Inc. Preis geb. 54 s. net
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_10openalex-snapshot
Permuting Information in Idealized Two-Level Storage
inferredcites →https://doi.org/10.1007/bf00264615openalex-snapshot
Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
inferredcites →https://doi.org/10.1016/0020-0190(91)90216-5openalex-snapshot
A caution on universal classes of hash functions
inferredcites →https://doi.org/10.1016/0020-0190(93)90218-xopenalex-snapshot
Permutations on the Block PRAM
inferredcites →https://doi.org/10.1016/0022-0000(79)90044-8openalex-snapshot
Universal classes of hash functions
inferredcites →https://doi.org/10.1016/0304-3975(90)90188-nopenalex-snapshot
Communication complexity of PRAMs
inferredcites →https://doi.org/10.1016/0377-2217(89)90126-4openalex-snapshot
Efficient parallel algorithms
inferredcites →https://doi.org/10.1016/0377-2217(90)90106-lopenalex-snapshot
Efficient parallel algorithms
inferredcites →https://doi.org/10.1016/b978-0-444-88071-0.50022-9openalex-snapshot
Parallel Algorithms for Shared-Memory Machines
inferredcites →https://doi.org/10.1109/fscs.1990.89545openalex-snapshot
A (fairly) simple circuit that (usually) sorts
inferredcites →https://doi.org/10.1109/sfcs.1984.715913openalex-snapshot
How To Share Memory In A Distributed System
inferredcites →https://doi.org/10.1109/sfcs.1987.32openalex-snapshot
How to emulate shared memory
inferredcites →https://doi.org/10.1109/sfcs.1989.63450openalex-snapshot
On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications
inferredcites →https://doi.org/10.1109/spdp.1991.218301openalex-snapshot
A practical hierarchical model of parallel computation
inferredcites →https://doi.org/10.1137/0221063openalex-snapshot
Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers
inferredcites →https://doi.org/10.1145/100216.100229openalex-snapshot
How to distribute a dictionary in a complete network
inferredcites →https://doi.org/10.1145/100216.100231openalex-snapshot
Efficient robust parallel computations
inferredcites →https://doi.org/10.1145/129712.129743openalex-snapshot
Efficient PRAM simulation on a distributed memory machine
inferredcites →https://doi.org/10.1145/3749740.3749751openalex-snapshot
Universal Schemes for Parallel Communication
inferredcites →https://doi.org/10.1145/3749740.3749753openalex-snapshot
A Bridging Model for Parallel Computation
inferredcites →https://doi.org/10.1145/48014.350550openalex-snapshot
Parallel hashing
inferredcites →https://doi.org/10.1145/48529.48535openalex-snapshot
The input/output complexity of sorting and related problems
inferredcites →https://doi.org/10.1145/72935.72937openalex-snapshot
On communication latency in PRAM computations
inferredcites →https://doi.org/10.1145/72935.72954openalex-snapshot
The APRAM: incorporating asynchrony into the PRAM model
inferredcites →https://doi.org/10.1145/72981.72996openalex-snapshot
Efficient parallel algorithms can be made robust
inferredcites →https://doi.org/10.1145/73007.73031openalex-snapshot
Fast computation using faulty hypercubes
inferredcites →https://doi.org/10.1145/97444.97459openalex-snapshot
Fast algorithms for bit-serial routing on a hypercube
inferredcites →https://doi.org/10.1145/97444.97672openalex-snapshot
Asynchronous shared memory parallel computation
inferredcites →https://doi.org/10.1145/97444.97705openalex-snapshot
Fast-fault-tolerant parallel communication and on-line maintenance using information dispersal
inferredcites →https://doi.org/10.21236/ada211910openalex-snapshot
Fast Computation Using Faulty Hypercubes
inferredcites →https://doi.org/10.21236/ada327912openalex-snapshot
How to Share Memory in a Distributed System.
inferredcites →https://doi.org/10.2307/2004501openalex-snapshot
Computer Solution of Linear Algebraic Systems
inferredcites →https://doi.org/10.5287/ora-wrgyrokp4openalex-snapshot
Complexity issues in general purpose parallel computing

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-3-032-26319-3_16openalex-snapshot
Encoding Music for Machine Learning
inferred← citeshttps://doi.org/10.1007/978-981-10-3373-5_53openalex-snapshot
dMDS: Uncover the Hidden Issues of Metadata Server Design
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90218-xopenalex-snapshot
Permutations on the Block PRAM
inferred← citeshttps://doi.org/10.1016/j.jksuci.2024.102060openalex-snapshot
On the security risk of pre-image attack on cancelable biometrics
inferred← citeshttps://doi.org/10.1093/nar/gky1133openalex-snapshot
Open Targets Platform: new developments and updates two years on
inferred← citeshttps://doi.org/10.1109/cec.2011.5949725openalex-snapshot
Multi-level indexing in a distributed self-organized storage system
inferred← citeshttps://doi.org/10.1109/colcomcon.2018.8466729openalex-snapshot
Impact of Metadata Server on a Large Scale File System
inferred← citeshttps://doi.org/10.1109/indusis.2010.5565810openalex-snapshot
Hierarchy-aware ECC model for Cloud
inferred← citeshttps://doi.org/10.1137/s0097539701386216openalex-snapshot
On Universal Classes of Extremely Random Constant-Time Hash Functions
inferred← citeshttps://doi.org/10.48550/arxiv.2005.06963openalex-snapshot
A Survey on Large Scale Metadata Server for Big Data Storage
inferred← citeshttps://doi.org/10.7146/brics.v9i27.21743openalex-snapshot
Simulating Uniform Hashing in Constant Time and Optimal Space
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.