On the public citation graph
Efficient PRAM simulation on a distributed memory machine
0 signed · 99 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/3-540-51498-8_9openalex-snapshot
New simulations between CRCW PRAMs
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.1007/bf01762109openalex-snapshot
Simulations among concurrent-write PRAMs
inferredcites →https://doi.org/10.1007/bfb0017146openalex-snapshot
Efficient simulations between concurrent-read concurrent-write pram models
inferredcites →https://doi.org/10.1007/bfb0023830openalex-snapshot
Leaders election without conflict resolution rule
inferredcites →https://doi.org/10.1007/bfb0032018openalex-snapshot
A new universal class of hash functions and dynamic hashing in real time
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)90192-kopenalex-snapshot
A complexity theory of efficient parallel algorithms
inferredcites →https://doi.org/10.1016/b978-0-444-88071-0.50023-0openalex-snapshot
General Purpose Parallel Architectures
inferredcites →https://doi.org/10.1017/cbo9781107359949.008openalex-snapshot
On the method of bounded differences
inferredcites →https://doi.org/10.1109/sfcs.1988.21968openalex-snapshot
Dynamic Perfect Hashing: Upper and Lower Bounds
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/sfcs.1991.185438openalex-snapshot
Towards a theory of nearly constant time parallel algorithms
inferredcites →https://doi.org/10.1137/0217037openalex-snapshot
Relations between Concurrent-Write Models of Parallel Computation
inferredcites →https://doi.org/10.1145/100216.100229openalex-snapshot
How to distribute a dictionary in a complete network
inferredcites →https://doi.org/10.1145/103418.103453openalex-snapshot
Converting high probability into nearly-constant time---with applications to parallel hashing
inferredcites →https://doi.org/10.1145/113379.113384openalex-snapshot
Fast and reliable parallel hashing
inferredcites →https://doi.org/10.1145/12130.12146openalex-snapshot
Parallel hashing---an efficient implementation of shared memory
inferredcites →https://doi.org/10.1145/828.1892openalex-snapshot
Efficient Schemes for Parallel Communication
inferredcites →https://doi.org/10.5555/127787.127837openalex-snapshot
Fast hashing on a PRAM—designing by expectation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rsa.20602openalex-snapshot
Balls into bins via local search: Cover time and maximum load
inferred← citeshttps://doi.org/10.1002/sec.1261openalex-snapshot
SAFE‐CROWD: secure task allocation for collaborative mobile social network
inferred← citeshttps://doi.org/10.1006/inco.1997.2642openalex-snapshot
Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures
inferred← citeshttps://doi.org/10.1006/jpdc.1998.1483openalex-snapshot
Packet Routing in Fixed-Connection Networks: A Survey
inferred← citeshttps://doi.org/10.1006/jpdc.1998.1508openalex-snapshot
Practical Parallel List Ranking
inferred← citeshttps://doi.org/10.1007/11523468_14openalex-snapshot
Balanced Allocation and Dictionaries with Tightly Packed Constant Size Bins
inferred← citeshttps://doi.org/10.1007/3-540-49116-3_6openalex-snapshot
Memory Organization Schemes for Large Shared Data: A Randomized Solution for Distributed Memory Machines
inferred← citeshttps://doi.org/10.1007/3-540-62592-5_62openalex-snapshot
On the drift of short schedules
inferred← citeshttps://doi.org/10.1007/978-3-540-30551-4_48openalex-snapshot
Approximated Two Choices in Randomized Load Balancing
inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_39openalex-snapshot
A Method for Creating Near-Optimal Instances of a Certified Write-All Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-540-45198-3_21openalex-snapshot
Perfectly Balanced Allocation
inferred← citeshttps://doi.org/10.1007/978-3-540-85363-3_45openalex-snapshot
The Power of Choice in a Generalized Pólya Urn Model
inferred← citeshttps://doi.org/10.1007/978-3-642-04128-0_1openalex-snapshot
Some Open Questions Related to Cuckoo Hashing
inferred← citeshttps://doi.org/10.1007/978-3-642-60831-5_22openalex-snapshot
Parallel Computing in Paderborn: The SFB 376 “Massive Parallelism — Algorithms, Design Methods, Applications”
inferred← citeshttps://doi.org/10.1007/978-3-662-48653-5_36openalex-snapshot
Locally Optimal Load Balancing
inferred← citeshttps://doi.org/10.1007/bf01940869openalex-snapshot
Introduction to special issue on randomized and derandomized algorithms
inferred← citeshttps://doi.org/10.1007/bfb0002716openalex-snapshot
Static and dynamic data management in networks
inferred← citeshttps://doi.org/10.1007/s00446-005-0149-0openalex-snapshot
Distributed scheduling for disconnected cooperation
inferred← citeshttps://doi.org/10.1007/s00446-014-0225-4openalex-snapshot
Tight bounds for parallel randomized load balancing
inferred← citeshttps://doi.org/10.1007/s00446-017-0320-4openalex-snapshot
Self-stabilizing repeated balls-into-bins
inferred← citeshttps://doi.org/10.1007/s00446-022-00437-7openalex-snapshot
Stochastic coordination in heterogeneous load balancing systems
inferred← citeshttps://doi.org/10.1016/j.jpdc.2010.03.012openalex-snapshot
Thinning protocols for routing h -relations over shared media
inferred← citeshttps://doi.org/10.1016/j.matcom.2024.08.034openalex-snapshot
An asymptotically optimal algorithm for generating bin cardinalities
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.10.015openalex-snapshot
A tight analysis and near-optimal instances of the algorithm of Anderson and Woll
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.02.054openalex-snapshot
Balanced allocation and dictionaries with tightly packed constant size bins
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.09.026openalex-snapshot
Parallel Load Balancing on constrained client-server topologies
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00326-7openalex-snapshot
On the drift of short schedules
inferred← citeshttps://doi.org/10.1017/s096354831400073xopenalex-snapshot
Orientability Thresholds for Random Hypergraphs
inferred← citeshttps://doi.org/10.1080/00207160802132871openalex-snapshot
Two-way chaining for non-uniform distributions
inferred← citeshttps://doi.org/10.1109/ccgrid.2001.923260openalex-snapshot
A general scheduling framework for parallel execution environments
inferred← citeshttps://doi.org/10.1109/chinacom.2013.6694661openalex-snapshot
STORE: Simple task offloading and reassignment for mobile social network
inferred← citeshttps://doi.org/10.1109/chinacom.2014.7054315openalex-snapshot
SAFE-CROWD: Secure task allocation for collaborative mobile social network
inferred← citeshttps://doi.org/10.1109/etfa.2009.5347067openalex-snapshot
On the use of hash tables in real-time applications
inferred← citeshttps://doi.org/10.1109/icycs.2008.465openalex-snapshot
Multiple-Choice Allocations with Fixed Densities
inferred← citeshttps://doi.org/10.1109/ipdps49936.2021.00031openalex-snapshot
Efficient Distributed Algorithms in the k-machine model via PRAM Simulations
inferred← citeshttps://doi.org/10.1109/pact.1998.727176openalex-snapshot
Athapascan-1: On-line building data flow graph in a parallel language
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646108openalex-snapshot
Randomized allocation processes
inferred← citeshttps://doi.org/10.1109/tpds.2022.3146195openalex-snapshot
The Supermarket Model with Known and Predicted Service Times
inferred← citeshttps://doi.org/10.1137/1.9781611973105.2openalex-snapshot
Balls into Bins via Local Search
inferred← citeshttps://doi.org/10.1137/1.9781611977073.74openalex-snapshot
Balanced Allocations: Caching and Packing, Twinning and Thinning
inferred← citeshttps://doi.org/10.1137/22m1541800openalex-snapshot
The Power of Two Choices in Graphical Allocation
inferred← citeshttps://doi.org/10.1137/23m1552231openalex-snapshot
The Power of Filling in Balanced Allocations
inferred← citeshttps://doi.org/10.1137/s0097539703428014openalex-snapshot
A Work-Optimal Deterministic Algorithm for the Certified Write-All Problem with a Nontrivial Number of Asynchronous Processors
inferred← citeshttps://doi.org/10.1145/1993636.1993639openalex-snapshot
Tight bounds for parallel randomized load balancing
inferred← citeshttps://doi.org/10.1145/2486159.2486191openalex-snapshot
Balls-into-bins with nearly optimal load distribution
inferred← citeshttps://doi.org/10.1145/2755573.2755584openalex-snapshot
Self-Stabilizing Repeated Balls-into-Bins
inferred← citeshttps://doi.org/10.1145/276698.276790openalex-snapshot
Randomized protocols for low-congestion circuit routing in multistage interconnection networks
inferred← citeshttps://doi.org/10.1145/2967360.2967365openalex-snapshot
Optimizing Hash-based Distributed Storage Using Client Choices
inferred← citeshttps://doi.org/10.1145/341800.341813openalex-snapshot
Infinite parallel job allocation (extended abstract)
inferred← citeshttps://doi.org/10.1145/3465084.3467923openalex-snapshot
Stochastic Coordination in Heterogeneous Load Balancing Systems
inferred← citeshttps://doi.org/10.1145/3490148.3538593openalex-snapshot
Balanced Allocations in Batches
inferred← citeshttps://doi.org/10.1145/3519270.3538428openalex-snapshot
Balanced Allocations with the Choice of Noise
inferred← citeshttps://doi.org/10.1145/3519935.3519995openalex-snapshot
The power of two choices in graphical allocation
inferred← citeshttps://doi.org/10.1145/3558481.3591088openalex-snapshot
Balanced Allocations in Batches: The Tower of Two Choices
inferred← citeshttps://doi.org/10.1145/3673900openalex-snapshot
An Improved Drift Theorem for Balanced Allocations
inferred← citeshttps://doi.org/10.1145/380752.380836openalex-snapshot
On the cell probe complexity of membership and perfect hashing
inferred← citeshttps://doi.org/10.1145/780542.780634openalex-snapshot
Almost random graphs with simple hash functions
inferred← citeshttps://doi.org/10.1145/872035.872075openalex-snapshot
A work-optimal deterministic algorithm for the asynchronous certified write-all problem
inferred← citeshttps://doi.org/10.1155/2014/463876openalex-snapshot
eCOTS: Efficient and Cooperative Task Sharing for Large-Scale Smart City Sensing Application
inferred← citeshttps://doi.org/10.21203/rs.3.rs-1947527/v1openalex-snapshot
Templing and Temple Search-Same Height Hashing
inferred← citeshttps://doi.org/10.3929/ethz-a-006517282openalex-snapshot
Synchronization and symmetry breaking in distributed systems
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2014.187openalex-snapshot
Balls into bins via local search: cover time and maximum load
inferred← citeshttps://doi.org/10.5555/2627817.2627819openalex-snapshot
Balls into bins via local search
inferred← citeshttps://doi.org/10.5555/2755753.2755808openalex-snapshot
A cyber-physical systems approach to personalized medicine: challenges and opportunities for noc-based multicore platforms
inferred← citeshttps://doi.org/10.5555/2872599.2872621openalex-snapshot
A study of manycore shared memory architecture as a way to build SOC applications
inferred← citeshttps://doi.org/10.82308/45910openalex-snapshot
Two-way hashing with separate chaining and linear probing
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.