On the public citation graph
Efficient parallel algorithms for graph problems
0 signed · 123 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/bf01762121openalex-snapshot
The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time
inferredcites →https://doi.org/10.1109/sfcs.1984.715896openalex-snapshot
Finding biconnected componemts and computing tree functions in logarithmic parallel time
inferredcites →https://doi.org/10.1109/sfcs.1985.43openalex-snapshot
Parallel tree contraction and its application
inferredcites →https://doi.org/10.1109/sfcs.1985.53openalex-snapshot
Solving tree problems on a mesh-connected processor array
inferredcites →https://doi.org/10.1109/sfcs.1986.10openalex-snapshot
Approximate and exact parallel scheduling with applications to list, tree and graph problems
inferredcites →https://doi.org/10.1145/12130.12151openalex-snapshot
Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms
inferredcites →https://doi.org/10.1145/800057.808686openalex-snapshot
Randomized speed-ups in parallel computation
inferredcites →https://doi.org/10.1145/800220.806703openalex-snapshot
On parallel searching (Extended Abstract)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1997.2632openalex-snapshot
Improved Parallel Integer Sorting without Concurrent Writing
inferred← citeshttps://doi.org/10.1006/jagm.2000.1146openalex-snapshot
Optimal Randomized EREW PRAM Algorithms for Finding Spanning Forests
inferred← citeshttps://doi.org/10.1006/jpdc.1994.1067openalex-snapshot
An Optimal Parallel Matching Algorithm for Cographs
inferred← citeshttps://doi.org/10.1007/11596110_13openalex-snapshot
Parallel Reductions: An Application of Adaptive Algorithm Selection
inferred← citeshttps://doi.org/10.1007/3-540-17220-3_23openalex-snapshot
Optimal speedups for parallel pattern matching in trees
inferred← citeshttps://doi.org/10.1007/3-540-18088-5_28openalex-snapshot
Term matching on parallel computers
inferred← citeshttps://doi.org/10.1007/3-540-52921-7_58openalex-snapshot
Parallel algorithms for linked list and beyond
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-53504-7_97openalex-snapshot
Parallel Breadth-first and Breadth-depth traversals of general trees
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_151openalex-snapshot
Fast parallel generation of random permutations
inferred← citeshttps://doi.org/10.1007/978-0-387-09766-4_35openalex-snapshot
Speculative Parallelization of Loops
inferred← citeshttps://doi.org/10.1007/978-1-4684-5511-3_11openalex-snapshot
Randomized Parallel Computation
inferred← citeshttps://doi.org/10.1007/978-3-540-74742-0_15openalex-snapshot
Techniques for Designing Efficient Parallel Graph Algorithms for SMPs and Multicore Processors
inferred← citeshttps://doi.org/10.1007/978-3-642-58214-1_30openalex-snapshot
An Optimal Parallel Algorithm for Channel-Assignment
inferred← citeshttps://doi.org/10.1007/978-3-642-85838-3_100openalex-snapshot
An Optimal Parallel Algorithm for Channel-Assignment
inferred← citeshttps://doi.org/10.1007/978-3-662-04303-5_2openalex-snapshot
The Design of Efficient Parallel Algorithms
inferred← citeshttps://doi.org/10.1007/978-981-95-2885-1_8openalex-snapshot
Cost-Efficient Hashing Index for Cloud Systems
inferred← citeshttps://doi.org/10.1007/978-981-95-2885-1_9openalex-snapshot
Mitigating Asymmetric Read and Write Costs in System Design
inferred← citeshttps://doi.org/10.1007/bf01228509openalex-snapshot
Optimal parallel algorithms for multiple updates of minimum spanning trees
inferred← citeshttps://doi.org/10.1007/bf01952784openalex-snapshot
Optimal parallel quicksort on EREW PRAM
inferred← citeshttps://doi.org/10.1007/bf02577866openalex-snapshot
A scalable method for run-time loop parallelization
inferred← citeshttps://doi.org/10.1007/bfb0012867openalex-snapshot
Optimal time bounds for parallel term matching
inferred← citeshttps://doi.org/10.1007/bfb0015428openalex-snapshot
More efficient parallel flow algorithms
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/bfb0046711openalex-snapshot
ITU-Land ESPRIT project: A parallel DSS for environmental impact assessment
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90214-3openalex-snapshot
A unified approach to parallel depth-first traversals of general trees
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90226-8openalex-snapshot
Radix sort on the hypercube
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/0167-8191(92)90061-bopenalex-snapshot
Parallel algorithms for finding the most vital edge with respect to minimum spanning tree
inferred← citeshttps://doi.org/10.1016/0167-8191(93)90052-mopenalex-snapshot
Applications of reconfigurable meshes to constant-time computations
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90035-7openalex-snapshot
An efficient parallel algorithm for updating minimum spanning trees
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90058-3openalex-snapshot
Techniques for parallel manipulation of sparse matrices
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/0743-1066(89)90014-9openalex-snapshot
Term matching on parallel computers
inferred← citeshttps://doi.org/10.1016/0743-7315(89)90005-1openalex-snapshot
Parallel algorithms for computing linked list prefix
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90019-xopenalex-snapshot
Approximate parallel scheduling. II. Applications to logarithmic-time optimal parallel graph algorithms
inferred← citeshttps://doi.org/10.1016/0890-5401(92)90075-qopenalex-snapshot
Tight complexity bounds for term matching problems
inferred← citeshttps://doi.org/10.1016/j.jalgor.2003.11.005openalex-snapshot
Parallel algorithms for P4-comparability graphs
inferred← citeshttps://doi.org/10.1016/j.jpdc.2005.03.011openalex-snapshot
A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)
inferred← citeshttps://doi.org/10.1016/s0019-9958(86)80023-7openalex-snapshot
Deterministic coin tossing with applications to optimal parallel list ranking
inferred← citeshttps://doi.org/10.1016/s0167-8191(05)80054-7openalex-snapshot
Parallel computation of matchings in trees
inferred← citeshttps://doi.org/10.1016/s0167-8191(97)00056-2openalex-snapshot
Parallel automatic adaptive analysis
inferred← citeshttps://doi.org/10.1016/s0167-8191(98)00024-6openalex-snapshot
Run-time parallelization: Its time has come
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00068-3openalex-snapshot
A time-optimal solution for the path cover problem on cographs
inferred← citeshttps://doi.org/10.1016/s0747-7171(08)80023-5openalex-snapshot
Parallel tree pattern matching
inferred← citeshttps://doi.org/10.1021/acs.jcim.5c00010openalex-snapshot
ThermoSeek: An Integrated Web Resource for Sequence and Structural Analysis of Proteins from Thermophilic Species
inferred← citeshttps://doi.org/10.1023/a:1015365901501openalex-snapshot
Parallel Self-Index Integer Sorting
inferred← citeshttps://doi.org/10.1080/00207169308804183openalex-snapshot
Optimal parallel colouring algorithms for totally decomposable graphs
inferred← citeshttps://doi.org/10.1080/10637199408915409openalex-snapshot
AN EFFICIENT EREW ALGORITHM FOR MINIMUM PATH COVER AND HAMILTONICITY ON COGRAPHS
inferred← citeshttps://doi.org/10.1080/10637199408915464openalex-snapshot
AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗
inferred← citeshttps://doi.org/10.1080/10637199508915506openalex-snapshot
THE MAXIMUM WEIGHT PERFECT MATCHING PROBLEM FOR COMPLETE WEIGHTED GRAPHS IS IN PC∗†
inferred← citeshttps://doi.org/10.1109/31.1744openalex-snapshot
Divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model
inferred← citeshttps://doi.org/10.1109/71.139209openalex-snapshot
Optimal parallel algorithms for problems modeled by a family of intervals
inferred← citeshttps://doi.org/10.1109/71.752782openalex-snapshot
The LRPD test: speculative run-time parallelization of loops with privatization and reduction parallelization
inferred← citeshttps://doi.org/10.1109/hicss.1993.284100openalex-snapshot
An efficient EREW algorithm for minimum path cover and Hamiltonicity on cographs
inferred← citeshttps://doi.org/10.1109/hipc.2013.6799108openalex-snapshot
A new parallel algorithm for connected components in dynamic graphs
inferred← citeshttps://doi.org/10.1109/icci.1992.227665openalex-snapshot
Consistent linear speedup in parallel alpha-beta search
inferred← citeshttps://doi.org/10.1109/icci.1992.227693openalex-snapshot
An efficient parallel algorithm for the assignment problem on the plane
inferred← citeshttps://doi.org/10.1109/icpp.2005.55openalex-snapshot
On the Architectural Requirements for Efficient Execution of Graph Algorithms
inferred← citeshttps://doi.org/10.1109/icpr.1988.28256openalex-snapshot
Algorithms for massively parallel image processing architectures
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1302951openalex-snapshot
A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)(extended abstract )
inferred← citeshttps://doi.org/10.1109/ipps.1995.395934openalex-snapshot
A note on reducing parallel model simulations to integer sorting
inferred← citeshttps://doi.org/10.1109/ipps.1995.395955openalex-snapshot
Parallelizing while loops for multiprocessor systems
inferred← citeshttps://doi.org/10.1109/pact.2001.953304openalex-snapshot
Architectural support for parallel reductions in scalable shared-memory multiprocessors
inferred← citeshttps://doi.org/10.1109/pccc.1992.200594openalex-snapshot
Integer sorting in O(1) time on an n*n reconfigurable mesh
inferred← citeshttps://doi.org/10.1109/secon.1991.147799openalex-snapshot
Cost-optimal parallel algorithms for traversing trees
inferred← citeshttps://doi.org/10.1109/spdp.1990.143503openalex-snapshot
The maximum weight perfect matching problem for complete weighted graphs is in PC
inferred← citeshttps://doi.org/10.1109/spdp.1991.218186openalex-snapshot
An optimal parallel matching algorithm for cographs
inferred← citeshttps://doi.org/10.1109/spdp.1992.242746openalex-snapshot
Fast parallel algorithm for the single link heuristics of hierarchical clustering
inferred← citeshttps://doi.org/10.1109/tpds.2006.131openalex-snapshot
An Adaptive Algorithm Selection Framework for Reduction Parallelization
inferred← citeshttps://doi.org/10.1137/0406041openalex-snapshot
Fast Parallel Recognition of Ultrametrics and Tree Metrics
inferred← citeshttps://doi.org/10.1145/12130.12151openalex-snapshot
Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms
inferred← citeshttps://doi.org/10.1145/140901.141917openalex-snapshot
A parallel algorithm for computing minimum spanning trees
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/2000807.2000814openalex-snapshot
Fast computation of small cuts via cycle space sampling
inferred← citeshttps://doi.org/10.1145/224538.224553openalex-snapshot
Run-time methods for parallelizing partially parallel loops
inferred← citeshttps://doi.org/10.1145/2591635.2667180openalex-snapshot
Adaptive reduction parallelization techniques
inferred← citeshttps://doi.org/10.1145/2612669.2612692openalex-snapshot
A simple and practical linear-work parallel algorithm for connectivity
inferred← citeshttps://doi.org/10.1145/3018787openalex-snapshot
Shared-Memory Parallelism Can Be Simple, Fast, and Scalable
inferred← citeshttps://doi.org/10.1145/3018787.3018791openalex-snapshot
Internally Deterministic Parallelism: Techniques and Algorithms
inferred← citeshttps://doi.org/10.1145/3018787.3018792openalex-snapshot
Deterministic Parallelism in Sequential Iterative Algorithms
inferred← citeshttps://doi.org/10.1145/3018787.3018793openalex-snapshot
A Deterministic Phase-Concurrent Parallel Hash Table
inferred← citeshttps://doi.org/10.1145/3018787.3018794openalex-snapshot
Priority Updates: A Contention-Reducing Primitive for Deterministic Programming
inferred← citeshttps://doi.org/10.1145/3018787.3018795openalex-snapshot
Ligra: A Lightweight Graph Processing Framework for Shared Memory
inferred← citeshttps://doi.org/10.1145/3018787.3018796openalex-snapshot
Ligra+: Adding Compression to Ligra
inferred← citeshttps://doi.org/10.1145/3018787.3018797openalex-snapshot
Linear-Work Parallel Graph Connectivity
inferred← citeshttps://doi.org/10.1145/3018787.3018798openalex-snapshot
Parallel and Cache-Oblivious Triangle Computations
inferred← citeshttps://doi.org/10.1145/3018787.3018799openalex-snapshot
Parallel Cartesian Tree and Suffix Tree Construction
inferred← citeshttps://doi.org/10.1145/3018787.3018800openalex-snapshot
Parallel Computation of Longest Common Prefixes
inferred← citeshttps://doi.org/10.1145/3018787.3018801openalex-snapshot
Parallel Lempel-Ziv Factorization
inferred← citeshttps://doi.org/10.1145/3018787.3018802openalex-snapshot
Parallel Wavelet Tree Construction
inferred← citeshttps://doi.org/10.1145/3159652.3159696openalex-snapshot
Shortcutting Label Propagation for Distributed Connected Components
inferred← citeshttps://doi.org/10.1145/327164.327169openalex-snapshot
Efficient parallel algorithms for some integer problems
inferred← citeshttps://doi.org/10.1145/3410463.3414657openalex-snapshot
Exploring the Design Space of Static and Incremental Graph Connectivity Algorithms on GPUs
inferred← citeshttps://doi.org/10.1145/50087.50096openalex-snapshot
Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation
inferred← citeshttps://doi.org/10.1145/79147.214077openalex-snapshot
An efficient and fast parallel-connected component algorithm
inferred← citeshttps://doi.org/10.46298/dmtcs.2159openalex-snapshot
On the complexity of edge-colored subgraph partitioning problems in network optimization
inferred← citeshttps://doi.org/10.48550/arxiv.2008.03909openalex-snapshot
ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms
inferred← citeshttps://doi.org/10.5555/1025127.1026016openalex-snapshot
An Adaptive Algorithm Selection Framework
inferred← citeshttps://doi.org/10.5555/313852.314099openalex-snapshot
Optimal randomized EREW PRAM algorithms for finding spanning forests and for other basic graph connectivity problems
inferred← citeshttps://doi.org/10.5555/645988.674301openalex-snapshot
Architectural Support for Parallel Reductions in Scalable Shared-Memory Multiprocessors
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.