On the public citation graph
Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
0 signed · 194 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/bfb0105127openalex-snapshot
Finding the maximum, merging and sorting in a parallel computation model
inferredcites →https://doi.org/10.1016/0022-0000(79)90044-8openalex-snapshot
Universal classes of hash functions
inferredcites →https://doi.org/10.1016/0196-6774(83)90033-0openalex-snapshot
Implementation of simultaneous memory address access in models that forbid it
inferredcites →https://doi.org/10.1016/s0019-9958(83)80003-5openalex-snapshot
Dynamic parallel memories
inferredcites →https://doi.org/10.1145/285930.285983openalex-snapshot
The NYU ultracomputer—designing a MIMD, shared-memory parallel machine
inferredcites →https://doi.org/10.1145/322248.322254openalex-snapshot
Expected Length of the Longest Probe Sequence in Hash Code Searching
inferredcites →https://doi.org/10.1145/356683.356686openalex-snapshot
A Survey of Parallel Machine Organization and Programming
inferredcites →https://doi.org/10.1145/800057.808689openalex-snapshot
A probabilistic relation between desirable and feasible, models of parallel computation
inferredcites →https://doi.org/10.1145/800061.808727openalex-snapshot
A logarithmic time sort for linear size networks
inferredcites →https://doi.org/10.1145/800105.803400openalex-snapshot
Universal classes of hash functions (Extended Abstract)
inferredcites →https://doi.org/10.1145/800133.804336openalex-snapshot
A unified approach to models of synchronous parallel machines
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1096-9128(20000410)12:4<211::aid-cpe477>3.0.co;2-ropenalex-snapshot
PRAM programming: in theory and in practice
inferred← citeshttps://doi.org/10.1006/jagm.1999.1036openalex-snapshot
Self-Simulation for the Passive Optical Star
inferred← citeshttps://doi.org/10.1006/jcom.1998.0498openalex-snapshot
Trade-offs between Communication Throughput and Parallel Time
inferred← citeshttps://doi.org/10.1006/jpdc.1995.1080openalex-snapshot
Horizons of Parallel Computation
inferred← citeshttps://doi.org/10.1006/jpdc.1995.1089openalex-snapshot
A Cost Calculus for Parallel Functional Programming
inferred← citeshttps://doi.org/10.1006/jpdc.1996.1288openalex-snapshot
Optical Routing in Meshes Using the Duplication Model
inferred← citeshttps://doi.org/10.1006/jpdc.1996.1290openalex-snapshot
Optical Interconnectivity in a Scalable Data-Parallel System
inferred← citeshttps://doi.org/10.1006/jpdc.1996.1295openalex-snapshot
RCC-Full: An Effective Network for Parallel Computations
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.2001.1768openalex-snapshot
Scalable Parallel Matrix Multiplication on Distributed Memory Parallel Computers
inferred← citeshttps://doi.org/10.1007/3-540-16078-7_66openalex-snapshot
Input sensitive, optimal parallel randomized algorithms for addition and identification
inferred← citeshttps://doi.org/10.1007/3-540-16078-7_90openalex-snapshot
Parallel machines and their communication theoretical limits
inferred← citeshttps://doi.org/10.1007/3-540-18099-0_24openalex-snapshot
Deterministic simulation of idealized parallel computers on more realistic ones
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_126openalex-snapshot
A complexity theory of efficient parallel algorithms
inferred← citeshttps://doi.org/10.1007/3-540-45718-6_63openalex-snapshot
On the Effectiveness of D-BSP as a Bridging Model of Parallel Computation
inferred← citeshttps://doi.org/10.1007/3-540-45718-6_67openalex-snapshot
Parallel Algorithm Design with Coarse-Grained Synchronization
inferred← citeshttps://doi.org/10.1007/3-540-48910-x_3openalex-snapshot
Software Performance of Universal Hash Functions
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-49248-8_3openalex-snapshot
Cryptographic Primitives for Information Authentication — State of the Art
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_148openalex-snapshot
Structural parallel algorithmics
inferred← citeshttps://doi.org/10.1007/3-540-55488-2_31openalex-snapshot
High performance universal hashing, with applications to shared memory simulations
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_77openalex-snapshot
Polynomial hash functions are reliable
inferred← citeshttps://doi.org/10.1007/3-540-55895-0_441openalex-snapshot
On the practical efficiency of Randomized Shared Memory
inferred← citeshttps://doi.org/10.1007/3-540-56279-6_52openalex-snapshot
Methods in parallel algorithmics and who may need to know them?
inferred← citeshttps://doi.org/10.1007/3-540-56320-2_57openalex-snapshot
Horizons of parallel computation
inferred← citeshttps://doi.org/10.1007/3-540-56503-5_14openalex-snapshot
An O(√n)-worst-case-time solution to the granularity problem
inferred← citeshttps://doi.org/10.1007/3-540-56731-3_2openalex-snapshot
A case for the PRAM as a standard programmer's model
inferred← citeshttps://doi.org/10.1007/3-540-56731-3_3openalex-snapshot
Hashing strategies for simulating shared memory on distributed memory machines
inferred← citeshttps://doi.org/10.1007/3-540-56891-3_1openalex-snapshot
Simulation-based comparison of hash functions for emulated shared memory
inferred← citeshttps://doi.org/10.1007/3-540-57163-9_2openalex-snapshot
Simulations between different models of parallel computers
inferred← citeshttps://doi.org/10.1007/3-540-58184-7_97openalex-snapshot
Simulation of PRAM models on meshes
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_89openalex-snapshot
Improved deterministic PRAM simulation on the mesh
inferred← citeshttps://doi.org/10.1007/3-540-60313-1_135openalex-snapshot
Beyond the worst-case bisection bound: Fast sorting and ranking on meshes
inferred← citeshttps://doi.org/10.1007/3-540-60609-2_1openalex-snapshot
Parallel machine models: How they are and where are they going
inferred← citeshttps://doi.org/10.1007/3-540-60922-9_46openalex-snapshot
Universal hashing and k-wise independent random variables via integer arithmetic without primes
inferred← citeshttps://doi.org/10.1007/3-540-61142-8_621openalex-snapshot
Randomized PRAM simulation using T9000 transputers
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_161openalex-snapshot
Shared-memory simulations on a faulty-memory DMM
inferred← citeshttps://doi.org/10.1007/978-0-387-09766-4_218openalex-snapshot
Models of Computation, Theoretical
inferred← citeshttps://doi.org/10.1007/978-1-4612-1516-5_1openalex-snapshot
A General-Purpose Shared-Memory Model for Parallel Computation
inferred← citeshttps://doi.org/10.1007/978-1-4613-9668-0_39openalex-snapshot
Optimally Universal Parallel Computers
inferred← citeshttps://doi.org/10.1007/978-1-4757-5210-6_2openalex-snapshot
Models for Robust Computation
inferred← citeshttps://doi.org/10.1007/978-3-319-98355-4_15openalex-snapshot
Universal Hashing via Integer Arithmetic Without Primes, Revisited
inferred← citeshttps://doi.org/10.1007/978-3-540-75142-7_6openalex-snapshot
A Denial-of-Service Resistant DHT
inferred← citeshttps://doi.org/10.1007/978-3-642-58049-9_9openalex-snapshot
The Bird-Meertens Formalism as a Parallel Model
inferred← citeshttps://doi.org/10.1007/978-3-642-76309-0_2openalex-snapshot
Überblick über PRAM-Simulationen und ihre Realisierbarkeit
inferred← citeshttps://doi.org/10.1007/978-3-642-82921-5_7openalex-snapshot
The Architecture of Parallel Computers
inferred← citeshttps://doi.org/10.1007/978-3-662-25209-3_2openalex-snapshot
Towards a Single Model of Efficient Computation in Real Parallel Machines
inferred← citeshttps://doi.org/10.1007/978-3-662-48797-6_15openalex-snapshot
Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness
inferred← citeshttps://doi.org/10.1007/bf01185209openalex-snapshot
Locality-preserving hash functions for general purpose parallel computation
inferred← citeshttps://doi.org/10.1007/bf01305311openalex-snapshot
Representing Shared Data on Distributed-Memory Parallel Computers
inferred← citeshttps://doi.org/10.1007/bf01840402openalex-snapshot
A new scheme for the deterministic simulation of PRAMs in VLSI
inferred← citeshttps://doi.org/10.1007/bf01940878openalex-snapshot
Efficient PRAM simulation on a distributed memory machine
inferred← citeshttps://doi.org/10.1007/bf02679451openalex-snapshot
Practical Constructive Schemes for Deterministic Shared-Memory Access
inferred← citeshttps://doi.org/10.1007/bf02679461openalex-snapshot
The Complexity of Deterministic PRAM Simulation on Distributed Memory Machines
inferred← citeshttps://doi.org/10.1007/bfb0016243openalex-snapshot
Deterministic simulation of idealized parallel computers on more realistic ones
inferred← citeshttps://doi.org/10.1007/bfb0020798openalex-snapshot
Actors as a parallel programming model
inferred← citeshttps://doi.org/10.1007/bfb0024719openalex-snapshot
Implementation issues relating to the WPRAM model for scalable computing
inferred← citeshttps://doi.org/10.1007/bfb0032018openalex-snapshot
A new universal class of hash functions and dynamic hashing in real time
inferred← citeshttps://doi.org/10.1007/bfb0032070openalex-snapshot
On parallel hashing and integer sorting
inferred← citeshttps://doi.org/10.1007/bfb0035093openalex-snapshot
Towards a single model of efficient computation in real parallel machines
inferred← citeshttps://doi.org/10.1007/bfb0035768openalex-snapshot
Parallel algorithmic techniques for combinatorial computation
inferred← citeshttps://doi.org/10.1007/bfb0040401openalex-snapshot
Network complexity of sorting and graph problems and simulating CRCW PRAMS by interconnection networks
inferred← citeshttps://doi.org/10.1007/bfb0049425openalex-snapshot
Tight bounds on deterministic PRAM emulations with constant redundancy
inferred← citeshttps://doi.org/10.1007/bfb0058018openalex-snapshot
QSM: A general purpose shared-memory model for parallel computation
inferred← citeshttps://doi.org/10.1007/s00224-008-9099-9openalex-snapshot
Towards a Scalable and Robust DHT
inferred← citeshttps://doi.org/10.1007/s002360050181openalex-snapshot
On the cost-effectiveness of PRAMs
inferred← citeshttps://doi.org/10.1007/s11128-015-1160-4openalex-snapshot
Attacks on quantum key distribution protocols that employ non-ITS authentication
inferred← citeshttps://doi.org/10.1007/s11128-021-03164-3openalex-snapshot
Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security
inferred← citeshttps://doi.org/10.1007/s11128-022-03468-yopenalex-snapshot
Quantum key distribution using universal hash functions over finite fields
inferred← citeshttps://doi.org/10.1007/s11227-009-0319-0openalex-snapshot
Fast and highly scalable parallel computations for fundamental matrix problems on distributed memory systems
inferred← citeshttps://doi.org/10.1007/s11704-007-0016-1openalex-snapshot
Models of parallel computation: a survey and classification
inferred← citeshttps://doi.org/10.1007/springerreference_64663openalex-snapshot
Cryptographic Hash Functions
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90160-3openalex-snapshot
A probabilistic simulation of prams on a bounded degree network
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90135-5openalex-snapshot
Analysis of parallel uniform hashing
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90218-xopenalex-snapshot
Permutations on the Block PRAM
inferred← citeshttps://doi.org/10.1016/0167-6423(93)90014-gopenalex-snapshot
Deriving parallel programs from specifications using cost information
inferred← citeshttps://doi.org/10.1016/0167-739x(92)90071-iopenalex-snapshot
Towards a single model of efficient computation in real parallel machines
inferred← citeshttps://doi.org/10.1016/0196-6774(91)90034-vopenalex-snapshot
On parallel hashing and integer sorting
inferred← citeshttps://doi.org/10.1016/0304-3975(84)90028-8openalex-snapshot
A parallel-design distributed-implementation (PDDI) general-purpose computer
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90192-kopenalex-snapshot
A complexity theory of efficient parallel algorithms
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00292-8openalex-snapshot
Fast rehashing in PRAM emulations
inferred← citeshttps://doi.org/10.1016/0743-7315(87)90040-2openalex-snapshot
Randomized parallel speedups for list ranking
inferred← citeshttps://doi.org/10.1016/0890-5401(88)90039-9openalex-snapshot
Optimal parallel randomized algorithms for sparse addition and identification
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90021-sopenalex-snapshot
Deterministic P-RAM simulation with constant redundancy
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50022-9openalex-snapshot
Parallel Algorithms for Shared-Memory Machines
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50023-0openalex-snapshot
General Purpose Parallel Architectures
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00280-7openalex-snapshot
Algorithms for the parallel alternating direction access machine
inferred← citeshttps://doi.org/10.1023/a:1008103903338openalex-snapshot
Efficient Deterministic and Probabilistic Simulations of PRAMs on Linear Arrays with Reconfigurable Pipelined Bus Systems
inferred← citeshttps://doi.org/10.1080/10637199608915553openalex-snapshot
FAST, EFFICIENT MUTUAL AND SELF SIMULATIONS FOR SHARED MEMORY AND RECONFIGURABLE MESH
inferred← citeshttps://doi.org/10.1109/12.743410openalex-snapshot
A gracefully degrading massively parallel system using the BSP model, and its evaluation
inferred← citeshttps://doi.org/10.1109/18.485725openalex-snapshot
On the cardinality of systematic authentication codes via error-correcting codes
inferred← citeshttps://doi.org/10.1109/2.62092openalex-snapshot
Architecture-independent parallel computation
inferred← citeshttps://doi.org/10.1109/71.532111openalex-snapshot
Fast parallel sorting under LogP: experience with the CM-5
inferred← citeshttps://doi.org/10.1109/71.615440openalex-snapshot
Accounting for memory bank contention and delay in high-bandwidth multiprocessors
inferred← citeshttps://doi.org/10.1109/asap.2006.6openalex-snapshot
A Mesh-of-Trees Interconnection Network for Single-Chip Parallel Processing
inferred← citeshttps://doi.org/10.1109/candar.2013.21openalex-snapshot
The Random Address Shift to Reduce the Memory Access Congestion on the Discrete Memory Machine
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00047openalex-snapshot
Linear Hashing with ℓ∞ guarantees and two-sided Kakeya bounds
inferred← citeshttps://doi.org/10.1109/ftcs.1995.466969openalex-snapshot
Gracefully degrading systems using the bulk-synchronous parallel model with randomised shared memory
inferred← citeshttps://doi.org/10.1109/hicss.1995.375476openalex-snapshot
Models of parallel computation: a survey and synthesis
inferred← citeshttps://doi.org/10.1109/hipc.2013.6799118openalex-snapshot
The super warp architecture with random address shift
inferred← citeshttps://doi.org/10.1109/hoti.2007.11openalex-snapshot
Layout-Accurate Design and Implementation of a High-Throughput Interconnection Network for Single-Chip Parallel Processing
inferred← citeshttps://doi.org/10.1109/icppw.1996.538596openalex-snapshot
What good are shared-memory models?
inferred← citeshttps://doi.org/10.1109/icppw.2014.63openalex-snapshot
Random Address Permute-Shift Technique for the Shared Memory on GPUs
inferred← citeshttps://doi.org/10.1109/ipdps.2000.846000openalex-snapshot
Scalable parallel matrix multiplication on distributed memory parallel computers
inferred← citeshttps://doi.org/10.1109/ipdps47924.2020.00119openalex-snapshot
Engineering Worst-Case Inputs for Pairwise Merge Sort on GPUs
inferred← citeshttps://doi.org/10.1109/ipps.1993.262847openalex-snapshot
Why BSP computers? (bulk-synchronous parallel computers)
inferred← citeshttps://doi.org/10.1109/ipps.1994.288274openalex-snapshot
Can parallel algorithms enhance serial implementation?
inferred← citeshttps://doi.org/10.1109/ipps.1995.395929openalex-snapshot
Parallel algorithms for database operations and a database operation for parallel algorithms
inferred← citeshttps://doi.org/10.1109/istcs.1995.377051openalex-snapshot
Improved optimal shared memory simulations, and the power of reconsideration
inferred← citeshttps://doi.org/10.1109/mppm.1997.715963openalex-snapshot
Parallel programming and complexity analysis using Actors
inferred← citeshttps://doi.org/10.1109/nas.2011.25openalex-snapshot
Request Load Balancing for Highly Skewed Traffic in P2P Networks
inferred← citeshttps://doi.org/10.1109/pmmp.1993.315542openalex-snapshot
On the implementation of virtual shared memory
inferred← citeshttps://doi.org/10.1109/sfcs.1984.715913openalex-snapshot
How To Share Memory In A Distributed System
inferred← citeshttps://doi.org/10.1109/sfcs.1988.21968openalex-snapshot
Dynamic Perfect Hashing: Upper and Lower Bounds
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63450openalex-snapshot
On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185407openalex-snapshot
Efficient algorithms for dynamic allocation of distributed memory
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366860openalex-snapshot
Highly efficient asynchronous execution of large-grained parallel programs
inferred← citeshttps://doi.org/10.1109/spdp.1991.218303openalex-snapshot
On the cost-effectiveness of PRAMs
inferred← citeshttps://doi.org/10.1109/spdp.1993.395475openalex-snapshot
Fast rehashing in PRAM emulations
inferred← citeshttps://doi.org/10.1109/spdp.1995.530690openalex-snapshot
Fast, efficient mutual and self simulations for shared memory and reconfigurable mesh
inferred← citeshttps://doi.org/10.1109/tpds.2007.1027openalex-snapshot
Analysis of Parallel Algorithms for Matrix Chain Product and Matrix Powers on Distributed Memory Systems
inferred← citeshttps://doi.org/10.1117/12.898344openalex-snapshot
Quantum cryptography and authentication with low key-consumption
inferred← citeshttps://doi.org/10.1137/0216053openalex-snapshot
Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
inferred← citeshttps://doi.org/10.1137/s0097539701386216openalex-snapshot
On Universal Classes of Extremely Random Constant-Time Hash Functions
inferred← citeshttps://doi.org/10.1137/s0097539789164765openalex-snapshot
Deterministic Simulations of PRAM s on Bounded Degree Networks
inferred← citeshttps://doi.org/10.1137/s0097539795290507openalex-snapshot
An Optical Simulation of Shared Memory
inferred← citeshttps://doi.org/10.1137/s0097539795294141openalex-snapshot
Communication-Efficient Parallel Sorting
inferred← citeshttps://doi.org/10.1137/s009753979529564xopenalex-snapshot
Contention Resolution in Hashing Based Shared Memory Simulations
inferred← citeshttps://doi.org/10.1137/s0097539797315884openalex-snapshot
Parallel Sorting with Limited Bandwidth
inferred← citeshttps://doi.org/10.1137/s009753979732712xopenalex-snapshot
Constructive, Deterministic Implementation of Shared Memory on Meshes
inferred← citeshttps://doi.org/10.1137/s0097539799358070openalex-snapshot
Tree Search on an Atomic Model for Message Passing
inferred← citeshttps://doi.org/10.1137/s089548019223872xopenalex-snapshot
Chernoff–Hoeffding Bounds for Applications with Limited Independence
inferred← citeshttps://doi.org/10.1140/epjqt/s40507-022-00127-0openalex-snapshot
Authentication of variable length messages in quantum key distribution
inferred← citeshttps://doi.org/10.1142/s0129054103002230openalex-snapshot
A GENERAL PRAM SIMULATION SCHEME FOR CLUSTERED MACHINES
inferred← citeshttps://doi.org/10.1142/s0219749909005729openalex-snapshot
RESPONSE TO "VULNERABILITY OF 'A NOVEL PROTOCOL-AUTHENTICATION ALGORITHM RULING OUT A MAN-IN-THE-MIDDLE ATTACK IN QUANTUM CRYPTOGRAPHY'"
inferred← citeshttps://doi.org/10.1145/100216.100229openalex-snapshot
How to distribute a dictionary in a complete network
inferred← citeshttps://doi.org/10.1145/1148109.1148163openalex-snapshot
Towards a scalable and robust DHT
inferred← citeshttps://doi.org/10.1145/12130.12146openalex-snapshot
Parallel hashing---an efficient implementation of shared memory
inferred← citeshttps://doi.org/10.1145/1281100.1281122openalex-snapshot
Verifying distributed erasure-coded data
inferred← citeshttps://doi.org/10.1145/1281100.1281178openalex-snapshot
A denial-of-service resistant DHT
inferred← citeshttps://doi.org/10.1145/129712.129743openalex-snapshot
Efficient PRAM simulation on a distributed memory machine
inferred← citeshttps://doi.org/10.1145/1378533.1378568openalex-snapshot
Optimal speedup on a low-degree multi-core parallel architecture (LoPRAM)
inferred← citeshttps://doi.org/10.1145/155332.155333openalex-snapshot
LogP: towards a realistic model of parallel computation
inferred← citeshttps://doi.org/10.1145/1583991.1584064openalex-snapshot
A DoS-resilient information system for dynamic data management
inferred← citeshttps://doi.org/10.1145/165231.165245openalex-snapshot
A practical constructive scheme for deterministic shared-memory access
inferred← citeshttps://doi.org/10.1145/165231.165246openalex-snapshot
Simple, efficient shared memory simulations
inferred← citeshttps://doi.org/10.1145/165231.165250openalex-snapshot
Optimal broadcast and summation in the LogP model
inferred← citeshttps://doi.org/10.1145/176979.176984openalex-snapshot
A survey of PRAM simulation techniques
inferred← citeshttps://doi.org/10.1145/181014.181049openalex-snapshot
List ranking and list scan on the Cray C-90
inferred← citeshttps://doi.org/10.1145/181014.181388openalex-snapshot
Constructive deterministic PRAM simulation on a mesh-connected computer
inferred← citeshttps://doi.org/10.1145/181014.181406openalex-snapshot
An optical simulation of shared memory
inferred← citeshttps://doi.org/10.1145/195058.195199openalex-snapshot
Trade-offs between communication throughput and parallel time
inferred← citeshttps://doi.org/10.1145/215399.215425openalex-snapshot
Accounting for memory bank contention and delay in high-bandwidth multiprocessors
inferred← citeshttps://doi.org/10.1145/215399.215431openalex-snapshot
Parallel sorting with limited bandwidth
inferred← citeshttps://doi.org/10.1145/224164.224210openalex-snapshot
Parallelism in sequential functional languages
inferred← citeshttps://doi.org/10.1145/236017.236044openalex-snapshot
Bounds on the separation of two parallel disk models
inferred← citeshttps://doi.org/10.1145/237814.237870openalex-snapshot
Communication-efficient parallel sorting (preliminary version)
inferred← citeshttps://doi.org/10.1145/258492.258500openalex-snapshot
Can shared-memory model serve as a bridging model for parallel computation?
inferred← citeshttps://doi.org/10.1145/341800.341815openalex-snapshot
Efficient, distributed data placement strategies for storage area networks (extended abstract)
inferred← citeshttps://doi.org/10.1145/3749740.3749753openalex-snapshot
A Bridging Model for Parallel Computation
inferred← citeshttps://doi.org/10.1145/72935.72947openalex-snapshot
Deterministic P-RAM simulation with constant redundancy
inferred← citeshttps://doi.org/10.1145/7531.7926openalex-snapshot
How to share memory in a distributed system
inferred← citeshttps://doi.org/10.1146/annurev.cs.03.060188.001313openalex-snapshot
Parallel Algorithmic Techniques For Combinational Computation
inferred← citeshttps://doi.org/10.14529/cmse190304openalex-snapshot
Survey of Parallel Computation Models
inferred← citeshttps://doi.org/10.21236/ada288589openalex-snapshot
A Parallel Complexity Model for Functional Languages.
inferred← citeshttps://doi.org/10.5281/zenodo.1083136openalex-snapshot
A Method Of Authentication For Quantum Networks
inferred← citeshttps://doi.org/10.5555/313559.313797openalex-snapshot
Chernoff-Hoeffding bounds for applications with limited independence
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.