On the public citation graph
Deterministic parallel list ranking
0 signed · 83 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-1-4684-5511-3_9openalex-snapshot
Optimal Tree Contraction in the EREW Model
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.1007/bfb0040378openalex-snapshot
Optimal parallel evaluation of tree-structured computations by raking (extended abstract)
inferredcites →https://doi.org/10.1016/0890-5401(89)90036-9openalex-snapshot
Faster optimal parallel prefix sums and list ranking
inferredcites →https://doi.org/10.1016/s0019-9958(86)80023-7openalex-snapshot
Deterministic coin tossing with applications to optimal parallel list ranking
inferredcites →https://doi.org/10.1109/sfcs.1985.43openalex-snapshot
Parallel tree contraction and its application
inferredcites →https://doi.org/10.1137/0214061openalex-snapshot
An Efficient Parallel Biconnectivity Algorithm
inferredcites →https://doi.org/10.1137/0217009openalex-snapshot
Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
inferredcites →https://doi.org/10.1137/0218041openalex-snapshot
Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
inferredcites →https://doi.org/10.1145/28395.28429openalex-snapshot
Parallel symmetry-breaking in sparse graphs
inferredcites →https://doi.org/10.1145/800057.808686openalex-snapshot
Randomized speed-ups in parallel computation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jagm.2000.1090openalex-snapshot
Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition
inferred← citeshttps://doi.org/10.1006/jcss.1999.1665openalex-snapshot
Data Independence of Read, Write, and Control Structures in PRAM Computations
inferred← citeshttps://doi.org/10.1006/jpdc.1994.1067openalex-snapshot
An Optimal Parallel Matching Algorithm for Cographs
inferred← citeshttps://doi.org/10.1006/jpdc.1998.1470openalex-snapshot
An Efficient Parallel Algorithm for Maximum Matching for Some Classes of Graphs
inferred← citeshttps://doi.org/10.1006/jpdc.1998.1508openalex-snapshot
Practical Parallel List Ranking
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_266openalex-snapshot
Improved parallel depth-first search in undirected planar graphs
inferred← citeshttps://doi.org/10.1007/3-540-61626-8_104openalex-snapshot
List ranking on interconnection networks
inferred← citeshttps://doi.org/10.1007/978-3-030-14132-5_11openalex-snapshot
Application of Distance Measurement NLP Methods for Address and Location Matching in Logistics
inferred← citeshttps://doi.org/10.1007/978-3-032-35251-4_40openalex-snapshot
Engineering Scalable Distributed List Ranking
inferred← citeshttps://doi.org/10.1007/978-3-540-27810-8_40openalex-snapshot
External Connected Components
inferred← citeshttps://doi.org/10.1007/978-3-540-45209-6_123openalex-snapshot
Minimizing Global Communication in Parallel List Ranking
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-81-322-1856-2_9openalex-snapshot
Swap Edges of Shortest Path Tree in Parallel
inferred← citeshttps://doi.org/10.1007/978-981-95-0695-8_22openalex-snapshot
An Efficient Parallel List Ranking Algorithm for Graph Concatenation on BSP Graph System
inferred← citeshttps://doi.org/10.1007/bf01192047openalex-snapshot
An optimal parallel algorithm for planar cycle separators
inferred← citeshttps://doi.org/10.1007/bf01758856openalex-snapshot
Parallel methods for visibility and shortest-path problems in simple polygons
inferred← citeshttps://doi.org/10.1007/bf01944354openalex-snapshot
Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree
inferred← citeshttps://doi.org/10.1007/bf02189329openalex-snapshot
Constructing arrangements optimally in parallel
inferred← citeshttps://doi.org/10.1007/bfb0030847openalex-snapshot
Conservative algorithms for parallel and sequential 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/s00453-001-0077-8openalex-snapshot
One-by-One Cleaning for Practical Parallel List Ranking
inferred← citeshttps://doi.org/10.1007/s004539910013openalex-snapshot
Parallel Algorithms for Maximum Matching in Complements of Interval Graphs and Related Problems
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90117-eopenalex-snapshot
A parallel algorithm for edge-coloring of graphs with edge-disjoint cycles
inferred← citeshttps://doi.org/10.1016/0020-0190(94)90104-xopenalex-snapshot
Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00069-oopenalex-snapshot
Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees
inferred← citeshttps://doi.org/10.1016/0022-0000(93)90042-uopenalex-snapshot
Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00128-zopenalex-snapshot
Optimal parallel algorithm for Brooks' colouring bounded degree graphs in logarithmic time on EREW PRAM
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50005-xopenalex-snapshot
Deterministic Parallel Computational Geometry
inferred← citeshttps://doi.org/10.1016/j.jpdc.2010.01.007openalex-snapshot
An efficient parallel algorithm for building the separating tree
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00101-0openalex-snapshot
An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs
inferred← citeshttps://doi.org/10.1016/s0167-8191(98)00092-1openalex-snapshot
Language and library support for practical PRAM programming
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/s0304-3975(97)00285-5openalex-snapshot
More general parallel tree contraction: Register allocation and broadcasting in a tree
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/10637199508915484openalex-snapshot
A COST-OPTIMAL EREW BREADTH-FIRST ALGORITHM FOR ORDERED TREES, WITH APPLICATIONS∗
inferred← citeshttps://doi.org/10.1103/physreve.55.6211openalex-snapshot
Parallel algorithm and dynamic exponent for diffusion-limited aggregation
inferred← citeshttps://doi.org/10.1109/34.184775openalex-snapshot
Efficient parallel processing of image contours
inferred← citeshttps://doi.org/10.1109/71.539733openalex-snapshot
A time- and cost-optimal algorithm for interlocking sets-with applications
inferred← citeshttps://doi.org/10.1109/71.888641openalex-snapshot
A simple parallel algorithm to draw cubic graphs
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/icpads.1994.590315openalex-snapshot
Parallel algorithms for verification and sensitivity analysis of minimum spanning trees
inferred← citeshttps://doi.org/10.1109/icpp.1996.537384openalex-snapshot
A time- and cost-optimal algorithm for overlap graphs, with applications
inferred← citeshttps://doi.org/10.1109/ipps.1994.288279openalex-snapshot
PRAM algorithms for static dictionary compression
inferred← citeshttps://doi.org/10.1109/ipps.1996.508073openalex-snapshot
Parallel implementation of Bouvka's minimum spanning tree algorithm
inferred← citeshttps://doi.org/10.1109/ipps.1999.760430openalex-snapshot
A time-optimal solution for the path cover problem on cographs
inferred← citeshttps://doi.org/10.1109/spdp.1991.218215openalex-snapshot
Lower bounds and parallel algorithms for planar orthogonal grid drawings
inferred← citeshttps://doi.org/10.1137/0222032openalex-snapshot
Linear-Processor NC Algorithms for Planar Directed Graphs I: Strongly Connected Components
inferred← citeshttps://doi.org/10.1137/0222033openalex-snapshot
Linear-Processor NC Algorithms for Planar Directed Graphs II: Directed Spanning Trees
inferred← citeshttps://doi.org/10.1137/0406037openalex-snapshot
Efficient Detection and Protection of Information in Cross Tabulated Tables I: Linear Invariant Test
inferred← citeshttps://doi.org/10.1137/090759112openalex-snapshot
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings
inferred← citeshttps://doi.org/10.1137/s0097539792227077openalex-snapshot
Planar Strong Connectivity Helps in Parallel Depth-First Search
inferred← citeshttps://doi.org/10.1137/s0097539795289859openalex-snapshot
Parallel Algorithms with Optimal Speedup for Bounded Treewidth
inferred← citeshttps://doi.org/10.1137/s0097539799352449openalex-snapshot
Parallel Integer Sorting Is More Efficient Than Parallel Comparison Sorting on Exclusive Write PRAMs
inferred← citeshttps://doi.org/10.1137/s0895480191221453openalex-snapshot
Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs
inferred← citeshttps://doi.org/10.1142/s0129054122500071openalex-snapshot
More Efficient Parallel Integer Sorting
inferred← citeshttps://doi.org/10.1142/s0129054199000034openalex-snapshot
PARALLEL VERTEX COLOURING OF INTERVAL GRAPHS
inferred← citeshttps://doi.org/10.1145/100216.100237openalex-snapshot
Towards overcoming the transitive-closure bottleneck: efficient parallel algorithms for planar digraphs
inferred← citeshttps://doi.org/10.1145/1186810.1186812openalex-snapshot
The string edit distance matching problem with moves
inferred← citeshttps://doi.org/10.1145/140901.141917openalex-snapshot
A parallel algorithm for computing minimum spanning trees
inferred← citeshttps://doi.org/10.1145/165231.157380openalex-snapshot
Fast deterministic approximate and exact parallel sorting
inferred← citeshttps://doi.org/10.1145/3210377.3210393openalex-snapshot
Parallel Minimum Cuts in Near-linear Work and Low Depth
inferred← citeshttps://doi.org/10.1145/3460890openalex-snapshot
Parallel Minimum Cuts in Near-linear Work and Low Depth
inferred← citeshttps://doi.org/10.1145/97444.97696openalex-snapshot
Efficient parallel computation of arrangements of hyperplanes in d dimensions
inferred← citeshttps://doi.org/10.24203/ijcit.v11i4.278openalex-snapshot
Sorting Real Numbers in Constant Time Using n^2/log^cn Processors
inferred← citeshttps://doi.org/10.3929/ethz-a-010361860openalex-snapshot
On Optimal Algorithms for List Ranking in the Parallel External Memory Model with Applications to Treewidth and other Elementary Graph Problems
inferred← citeshttps://doi.org/10.4208/cicp.010415.110915aopenalex-snapshot
Efficient Implementation of Smoothed Particle Hydrodynamics (SPH) with Plane Sweep Algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.2002.05034openalex-snapshot
Uniform Linked Lists Contraction
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.