On the public citation graph
Parallel heap: An optimal parallel priority queue
0 signed · 80 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/978-3-662-25209-3_19openalex-snapshot
Managing a Parallel Heap Efficiently
inferredcites →https://doi.org/10.1007/bfb0036940openalex-snapshot
Parallel dictionaries on 2–3 trees
inferredcites →https://doi.org/10.1016/0020-0190(84)90128-5openalex-snapshot
An optimal algorithm for parallel selection
inferredcites →https://doi.org/10.1016/0020-0190(89)90138-5openalex-snapshot
Optimal merging and sorting on the EREW PRAM
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.1016/s0020-0190(05)80007-9openalex-snapshot
Parallel priority queues
inferredcites →https://doi.org/10.1109/ipps.1992.223004openalex-snapshot
Parallel heap: improved and simplified
inferredcites →https://doi.org/10.1109/tc.1980.1675680openalex-snapshot
Concurrent Search and Insertion in AVL Trees
inferredcites →https://doi.org/10.1109/tse.1984.5010306openalex-snapshot
Concurrent Maintenance of Binary Search Trees
inferredcites →https://doi.org/10.1137/0218014openalex-snapshot
Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines
inferredcites →https://doi.org/10.1145/63238.63249openalex-snapshot
Concurrent operations on priority queues
inferredcites →https://doi.org/10.1145/84537.84545openalex-snapshot
Parallel discrete event simulation
inferredcites →https://doi.org/10.5555/304238.304334openalex-snapshot
An efficient and scalable parallel algorithm for discrete-event simulation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jpdc.1993.1083openalex-snapshot
Efficient and Scalable PRAM Algorithms for Discrete-Event Simulation of Bounded Degree Networks
inferred← citeshttps://doi.org/10.1006/jpdc.1997.1418openalex-snapshot
O(log logN) Time Algorithms for Hamiltonian Suffix and Min-Max-Pair Heap Operations on the Hypercube
inferred← citeshttps://doi.org/10.1006/jpdc.1998.1425openalex-snapshot
A Parallel Priority Queue with Constant Time Operations
inferred← citeshttps://doi.org/10.1006/jpdc.1998.1429openalex-snapshot
Randomized Priority Queues for Fast Parallel Access
inferred← citeshttps://doi.org/10.1007/3-540-58184-7_141openalex-snapshot
Load balanced priority queues on distributed memory machines
inferred← citeshttps://doi.org/10.1007/3-540-60220-8_67openalex-snapshot
Routing on trees via matchings
inferred← citeshttps://doi.org/10.1007/3-540-60321-2_30openalex-snapshot
Fast priority queues for parallel branch-and-bound
inferred← citeshttps://doi.org/10.1007/978-1-4757-6130-6_7openalex-snapshot
Concurrent Data Structures for Tree Search Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-85665-6_24openalex-snapshot
TSLQueue: An Efficient Lock-Free Design for Priority Queues
inferred← citeshttps://doi.org/10.1007/978-3-031-94962-3_26openalex-snapshot
Parallel Priority Queues for Soft-Sphere Collision Handling
inferred← citeshttps://doi.org/10.1007/978-3-319-20086-6_3openalex-snapshot
A Bulk-Parallel Priority Queue in External Memory with STXXL
inferred← citeshttps://doi.org/10.1007/bfb0024725openalex-snapshot
Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model
inferred← citeshttps://doi.org/10.1007/bfb0027123openalex-snapshot
Building a parallel branch and bound library
inferred← citeshttps://doi.org/10.1016/j.jss.2015.11.043openalex-snapshot
ISODAC: A high performance solution for indexing and searching heterogeneous data
inferred← citeshttps://doi.org/10.1016/j.procs.2019.02.101openalex-snapshot
Implementation and Analysis of Distributed Relaxed Concurrent Queues in Remote Memory Access Model
inferred← citeshttps://doi.org/10.1016/s0167-8191(98)00056-8openalex-snapshot
Multivariate integration on hypercubic and mesh networks
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00572-8openalex-snapshot
Architecture independent parallel selection with applications to parallel priority queues
inferred← citeshttps://doi.org/10.1080/10637199408915469openalex-snapshot
AN EFFICIENT ALGORITHM FOR MANAGING A PARALLEL HEAP∗
inferred← citeshttps://doi.org/10.1109/71.506694openalex-snapshot
Optimal and load balanced mapping of parallel priority queues in hypercubes
inferred← citeshttps://doi.org/10.1109/71.97899openalex-snapshot
Optimal parallel initialization algorithms for a class of priority queues
inferred← citeshttps://doi.org/10.1109/fareastcon.2019.8934183openalex-snapshot
Towards Relaxed Concurrent Data Structures on Distributed Memory Computer Systems
inferred← citeshttps://doi.org/10.1109/hipc.2012.6507490openalex-snapshot
Design and implementation of a parallel priority queue on many-core architectures
inferred← citeshttps://doi.org/10.1109/icapp.1995.472206openalex-snapshot
Using parallel data structures in optimistic discrete event simulation of varying granularity on shared-memory computers
inferred← citeshttps://doi.org/10.1109/icdcs.1996.508013openalex-snapshot
Distributed priority queues on hypercube architectures
inferred← citeshttps://doi.org/10.1109/icpp.1996.537167openalex-snapshot
Parallel and distributed meldable priority queues based on binomial heaps
inferred← citeshttps://doi.org/10.1109/icpp.2008.67openalex-snapshot
A Distributed Context-Free Language Constrained Shortest Path Algorithm
inferred← citeshttps://doi.org/10.1109/ipdps.2000.845994openalex-snapshot
Skiplist-based concurrent priority queues
inferred← citeshttps://doi.org/10.1109/ipdps.2011.372openalex-snapshot
Memory Hierarchy Aware Parallel Priority Based Data Structures
inferred← citeshttps://doi.org/10.1109/ipdps.2016.45openalex-snapshot
Communication Efficient Algorithms for Top-k Selection Problems
inferred← citeshttps://doi.org/10.1109/ipdpsw71298.2026.00138openalex-snapshot
A Multi-Queue Design for High-Performance GPU Priority Queues
inferred← citeshttps://doi.org/10.1109/ipps.1992.223004openalex-snapshot
Parallel heap: improved and simplified
inferred← citeshttps://doi.org/10.1109/ipps.1992.223027openalex-snapshot
Parallel heap operations on EREW PRAM: summary of results
inferred← citeshttps://doi.org/10.1109/pads.2000.847151openalex-snapshot
Parallelizing a sequential logic simulator using an optimistic framework based on a global parallel heap event queue: an experience and performance report
inferred← citeshttps://doi.org/10.1109/spdp.1995.530702openalex-snapshot
Parallel heap: A practical priority queue for fine-to-medium-grained applications on small multiprocessors
inferred← citeshttps://doi.org/10.1109/wsc.1991.185670openalex-snapshot
An efficient and scalable parallel algorithm for discrete-event simulation
inferred← citeshttps://doi.org/10.1109/wsc.2003.1261506openalex-snapshot
SyncSim: a synchronous simple optimistic simulation technique based on a global parallel heap event queue
inferred← citeshttps://doi.org/10.1109/wsc.2007.4419661openalex-snapshot
Optimistic parallel discrete event simulation of the event-based transmission line matrix method
inferred← citeshttps://doi.org/10.1142/s0129054101000564openalex-snapshot
ON THE ROUTING NUMBER OF COMPLETE d-ARY TREES
inferred← citeshttps://doi.org/10.1145/1774088.1774382openalex-snapshot
External sorting for index construction of large semantic web databases
inferred← citeshttps://doi.org/10.1145/2688500.2688523openalex-snapshot
The SprayList: a scalable relaxed priority queue
inferred← citeshttps://doi.org/10.1145/275295.275368openalex-snapshot
Performance of a multiple-entry-node concurrent skew heap on shared-memory multiprocessor
inferred← citeshttps://doi.org/10.1145/2755573.2755616openalex-snapshot
MultiQueues: Simple Relaxed Concurrent Priority Queues
inferred← citeshttps://doi.org/10.1145/2858788.2688523openalex-snapshot
The SprayList: a scalable relaxed priority queue
inferred← citeshttps://doi.org/10.1145/2858788.2688547openalex-snapshot
The lock-free k-LSM relaxed priority queue
inferred← citeshttps://doi.org/10.1145/3210377.3210411openalex-snapshot
Distributionally Linearizable Data Structures
inferred← citeshttps://doi.org/10.1145/3291048openalex-snapshot
A Survey on Agent-based Simulation Using Hardware Accelerators
inferred← citeshttps://doi.org/10.1145/3409964.3461782openalex-snapshot
Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths
inferred← citeshttps://doi.org/10.1145/3472456.3472463openalex-snapshot
BGPQ: A Heap-Based Priority Queue Design for GPUs
inferred← citeshttps://doi.org/10.1145/3626183.3659962openalex-snapshot
Multi Bucket Queues: Efficient Concurrent Priority Scheduling
inferred← citeshttps://doi.org/10.1145/3771738openalex-snapshot
The MultiQueue: A Simple and Fast Relaxed Concurrent Priority Queue
inferred← citeshttps://doi.org/10.32657/10356/68569openalex-snapshot
Windowed fourier transform based fringe pattern analysis techniques
inferred← citeshttps://doi.org/10.4230/lipics.opodis.2018.11openalex-snapshot
Parallel Combining: Benefits of Explicit Synchronization
inferred← citeshttps://doi.org/10.48550/arxiv.1411.1209openalex-snapshot
MultiQueues: Simpler, Faster, and Better Relaxed Concurrent Priority Queues
inferred← citeshttps://doi.org/10.48550/arxiv.1504.00545openalex-snapshot
A Bulk-Parallel Priority Queue in External Memory with STXXL
inferred← citeshttps://doi.org/10.48550/arxiv.1906.06504openalex-snapshot
Accelerating Concurrent Heap on GPUs
inferred← citeshttps://doi.org/10.48550/arxiv.2107.01350openalex-snapshot
Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues
inferred← citeshttps://doi.org/10.5555/1030818.1030933openalex-snapshot
Parallel distributed simulation and modeling methods: SyncSim: a synchronous simple optimistic simulation technique based on a global parallel heap event queue
inferred← citeshttps://doi.org/10.5555/304238.304334openalex-snapshot
An efficient and scalable parallel algorithm for discrete-event simulation
inferred← citeshttps://doi.org/10.5555/336146.336170openalex-snapshot
Parallelizing a sequential logic simulator using an optimistic framework based on a global parallel heap event queue: an experience and performance report
inferred← citeshttps://doi.org/10.57709/7047142openalex-snapshot
FPGA Based Binary Heap Implementation: With an Application to Web Based Anomaly Prioritization
inferred← citeshttps://doi.org/10.70675/35c0180dzc462z4178z90cez1700a6ba85c5openalex-snapshot
Synchronization costs in parallel programs and concurrent data structures
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.