On the public citation graph

Deterministic parallel list ranking

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.

Claim with ORCID

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.

See reference health

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.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.1109/sfcs.1985.9openalex-snapshot

An optimal parallel algorithm for integer sorting

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.1109/tc.1985.6312202openalex-snapshot

The power of parallel prefix

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/12130.12151openalex-snapshot

Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel 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.1002/scj.4690240101openalex-snapshot

An optimal parallel algorithm for finding shortest paths inside simple polygons

inferred← citeshttps://doi.org/10.1002/scj.4690240503openalex-snapshot

A parallel algorithm for tree pattern matching

inferred← citeshttps://doi.org/10.1006/jagm.1996.0018openalex-snapshot

A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube

inferred← citeshttps://doi.org/10.1006/jagm.1996.0022openalex-snapshot

Efficient Algorithms for Finding a Core of a Tree with a Specified Length

inferred← citeshttps://doi.org/10.1006/jpdc.2000.1678openalex-snapshot

Prefix Computations on Symmetric Multiprocessors

inferred← citeshttps://doi.org/10.1007/3-540-48518-x_3openalex-snapshot

Designing Practical Efficient Algorithms for Symmetric Multiprocessors

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-53504-7_100openalex-snapshot

A parallel algorithm for path-min queries in trees

inferred← citeshttps://doi.org/10.1007/3-540-53504-7_101openalex-snapshot

Efficient deterministic parallel algorithms for integer sorting

inferred← citeshttps://doi.org/10.1007/3-540-54233-7_148openalex-snapshot

Structural parallel algorithmics

inferred← citeshttps://doi.org/10.1007/3-540-54945-5_77openalex-snapshot

On finding a smallest augmentation to biconnect a graph (Extended abstract)

inferred← citeshttps://doi.org/10.1007/978-1-4757-3609-0_6openalex-snapshot

Parallel Graph Algorithms for Coarse-Grained Multicomputers

inferred← citeshttps://doi.org/10.1007/978-1-4899-0715-8_15openalex-snapshot

Massively Parallel Processing of Image Contours

inferred← citeshttps://doi.org/10.1007/978-3-322-91230-5_2openalex-snapshot

Effiziente Einbettungen baumartiger Graphen in den Hyperwürfel

inferred← citeshttps://doi.org/10.1007/978-3-642-13374-9_2openalex-snapshot

The STAPL pList

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-44465-8_33openalex-snapshot

On the Complexity of List Ranking in the Parallel External Memory Model

inferred← citeshttps://doi.org/10.1007/978-3-7091-9076-0_4openalex-snapshot

Basic Parallel Algorithms in Graph Theory

inferred← citeshttps://doi.org/10.1007/bf01185406openalex-snapshot

Parallel integer sorting using small operations

inferred← citeshttps://doi.org/10.1007/bf01190159openalex-snapshot

Finding least-weight subsequences with fewer processors

inferred← citeshttps://doi.org/10.1007/bf01762121openalex-snapshot

The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time

inferred← citeshttps://doi.org/10.1007/bf01941685openalex-snapshot

Sweep Methods for Parallel Computational Geometry

inferred← citeshttps://doi.org/10.1007/bf02189329openalex-snapshot

Constructing arrangements optimally in parallel

inferred← citeshttps://doi.org/10.1007/bf02523239openalex-snapshot

Parallel algorithms for the hamiltonian cycle and hamiltonian path problems in semicomplete bipartite digraphs

inferred← citeshttps://doi.org/10.1007/bf02700044openalex-snapshot

Randomized parallel list ranking for distributed memory multiprocessors

inferred← citeshttps://doi.org/10.1007/bfb0009495openalex-snapshot

StUSPACE(log n) ⊂-DSPACE(log2 n/log log n)

inferred← citeshttps://doi.org/10.1007/bfb0024747openalex-snapshot

Efficient parallel algorithms for scheduling with tree precedence constraints

inferred← citeshttps://doi.org/10.1007/bfb0027774openalex-snapshot

Randomized parallel list ranking for distributed memory multiprocesors

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/s00224-001-1008-4openalex-snapshot

Polynomially Improved Efficiency for Fast Parallel Single-Source Lexicographic Depth-First Search, Breadth-First Search, and Topological-First Search

inferred← citeshttps://doi.org/10.1007/s00373-002-0520-xopenalex-snapshot

Local Nature of Brooks? Colouring for Degree 3 Graphs

inferred← citeshttps://doi.org/10.1016/0020-0190(89)90139-7openalex-snapshot

A note on adaptive parallel sorting

inferred← citeshttps://doi.org/10.1016/0020-0190(90)90015-popenalex-snapshot

A parallel algorithm for eliminating cycles in undirected graphs

inferred← citeshttps://doi.org/10.1016/0020-0190(92)90056-2openalex-snapshot

An optimal parallel algorithm for computing furthest neighbors in a tree

inferred← citeshttps://doi.org/10.1016/0020-0190(92)90240-vopenalex-snapshot

Sorting on PRAMs with reconfigurable buses

inferred← citeshttps://doi.org/10.1016/0020-0190(94)90130-9openalex-snapshot

An optimal parallel algorithm for maximal matching

inferred← citeshttps://doi.org/10.1016/0020-0255(93)90088-4openalex-snapshot

Parallel search algorithms for graphs and trees

inferred← citeshttps://doi.org/10.1016/0031-3203(91)90090-ropenalex-snapshot

Parallel (pram erew) algorithms for contour-based 2D shape recognition

inferred← citeshttps://doi.org/10.1016/0166-218x(90)90083-oopenalex-snapshot

Parallel recognition of complement reducible graphs and cotree construction

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-8655(90)90118-lopenalex-snapshot

Parallel algorithms for contour extraction and coding on an EREW PRAM computer

inferred← citeshttps://doi.org/10.1016/0167-8655(91)90413-gopenalex-snapshot

Parallel computable contour based feature strings for 2-D shape recognition

inferred← citeshttps://doi.org/10.1016/0304-3975(92)90332-aopenalex-snapshot

Optimal parallel algorithms for forest and term matching

inferred← citeshttps://doi.org/10.1016/0304-3975(94)00189-popenalex-snapshot

Optimal parallel algorithms for path problems on planar graphs

inferred← citeshttps://doi.org/10.1016/0304-3975(95)00186-7openalex-snapshot

Reliable computations on faulty EREW PRAM

inferred← citeshttps://doi.org/10.1016/0304-3975(96)00034-5openalex-snapshot

Efficient massively parallel implementation of some combinatorial algorithms

inferred← citeshttps://doi.org/10.1016/0890-5401(90)90034-fopenalex-snapshot

Optimal parallel algorithms on planar graphs

inferred← citeshttps://doi.org/10.1016/0890-5401(91)90031-vopenalex-snapshot

Improved deterministic parallel integer sorting

inferred← citeshttps://doi.org/10.1016/0890-5401(92)90041-dopenalex-snapshot

Parallel recognition of series-parallel graphs

inferred← citeshttps://doi.org/10.1016/0925-7721(93)90029-6openalex-snapshot

An optimal parallel algorithm using exclusive read/writes for the rectilinear Voronoi diagram

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-044482537-7/50019-xopenalex-snapshot

Parallel Computational Geometry: An Approach using Randomization

inferred← citeshttps://doi.org/10.1016/b978-044482587-2/50152-xopenalex-snapshot

Real-Time Connected Component Labeling on One-Dimensional Array Processors based on Content-Addressable Memory

inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80002-9openalex-snapshot

Finding level-ancestors in trees

inferred← citeshttps://doi.org/10.1016/s0164-1212(00)00069-8openalex-snapshot

List ranking on processor arrays

inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00221-8openalex-snapshot

Computing Prüfer codes efficiently in parallel

inferred← citeshttps://doi.org/10.1080/10637199808947384openalex-snapshot

RANDOMIZED OPTIMAL LIST RANKING ON COARSE-GRAINED PARALLEL COMPUTERS WITH O(log p) COMMUNICATION PHASES

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/12.93747openalex-snapshot

An optimal linked list prefix algorithm on a local memory computer

inferred← citeshttps://doi.org/10.1109/34.159904openalex-snapshot

Parallel architectures and algorithms for image component labeling

inferred← citeshttps://doi.org/10.1109/34.184775openalex-snapshot

Efficient parallel processing of image contours

inferred← citeshttps://doi.org/10.1109/5.163410openalex-snapshot

Parallel techniques for computational geometry

inferred← citeshttps://doi.org/10.1109/fmpc.1992.234904openalex-snapshot

Efficient algorithms for locating a core of a tree network with a specified length

inferred← citeshttps://doi.org/10.1109/ftxs49593.2019.00011openalex-snapshot

Self-stabilizing Connected Components

inferred← citeshttps://doi.org/10.1109/hicss.1993.284104openalex-snapshot

The optimal location of a structured facility in a tree network

inferred← citeshttps://doi.org/10.1109/hipc.1998.737971openalex-snapshot

A simple optimal list ranking algorithm

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/ipdps.2010.5470440openalex-snapshot

Parallel external memory graph algorithms

inferred← citeshttps://doi.org/10.1109/ipdps49936.2021.00032openalex-snapshot

Euler Meets GPU: Practical Graph Algorithms with Theoretical Guarantees

inferred← citeshttps://doi.org/10.1109/ipps.1991.153761openalex-snapshot

Optimal EREW parallel algorithms for connectivity, ear decomposition and st-numbering of planar graphs

inferred← citeshttps://doi.org/10.1109/ipps.1993.262880openalex-snapshot

Towards optimal parallel radix sorting

inferred← citeshttps://doi.org/10.1109/ipps.1995.395892openalex-snapshot

Efficient routing and message bounds for optimal parallel algorithms

inferred← citeshttps://doi.org/10.1109/ipps.1999.760427openalex-snapshot

Prefix computations on symmetric multiprocessors

inferred← citeshttps://doi.org/10.1109/mwscas.1993.342986openalex-snapshot

Sorting on reconfigurable multiple bus machines

inferred← citeshttps://doi.org/10.1109/secon.1991.147799openalex-snapshot

Cost-optimal parallel algorithms for traversing trees

inferred← citeshttps://doi.org/10.1109/sfcs.1989.63477openalex-snapshot

Sorting on a parallel pointer machine with applications to set expression evaluation

inferred← citeshttps://doi.org/10.1109/sfcs.1989.63478openalex-snapshot

Recursive *-tree parallel data-structure

inferred← citeshttps://doi.org/10.1109/sfcs.1989.63492openalex-snapshot

Efficient parallel algorithms for testing connectivity and finding disjoint s-t paths in graphs

inferred← citeshttps://doi.org/10.1109/sfcs.1991.185440openalex-snapshot

A deterministic parallel algorithm for planar graphs isomorphism

inferred← citeshttps://doi.org/10.1109/spdp.1991.218186openalex-snapshot

An optimal parallel matching algorithm for 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.1109/spdp.1995.530688openalex-snapshot

Parallel search in matrices with sorted columns

inferred← citeshttps://doi.org/10.1137/0220022openalex-snapshot

Efficient Parallel Algorithms for Testing k and Finding Disjoint s - t Paths in Graphs

inferred← citeshttps://doi.org/10.1137/0220045openalex-snapshot

Parallel Transitive Closure and Point Location in Planar Structures

inferred← citeshttps://doi.org/10.1137/0220066openalex-snapshot

An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph

inferred← citeshttps://doi.org/10.1137/0220070openalex-snapshot

Parallel Tree Contraction Part 2: Further Applications

inferred← citeshttps://doi.org/10.1137/0221063openalex-snapshot

Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers

inferred← citeshttps://doi.org/10.1137/0222017openalex-snapshot

Recursive Star-Tree Parallel Data Structure

inferred← citeshttps://doi.org/10.1137/0404034openalex-snapshot

Optimal Parallel Algorithms for Region Labeling and Medial Axis Transform of Binary Images

inferred← citeshttps://doi.org/10.1137/1.9781611975499.8openalex-snapshot

Batch-Parallel Euler Tour Trees

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/109648.109665openalex-snapshot

Randomized parallel algorithms for trapezoidal diagrams

inferred← citeshttps://doi.org/10.1145/113379.113395openalex-snapshot

Constructing arrangements optimally in parallel (preliminary version)

inferred← citeshttps://doi.org/10.1145/129712.129762openalex-snapshot

Planar separators and parallel polygon triangulation (preliminary version)

inferred← citeshttps://doi.org/10.1145/140901.141933openalex-snapshot

O( n log log n )-work parallel algorithms for straight-line grid embeddings of planar graphs

inferred← citeshttps://doi.org/10.1145/165231.165261openalex-snapshot

An efficient parallel algorithm for the single function coarsest partition problem

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/1869790.1869796openalex-snapshot

Privacy-preserving data-oblivious geometric algorithms for geographic data

inferred← citeshttps://doi.org/10.1145/226643.226670openalex-snapshot

Sorting on a parallel pointer machine with applications to set expression evaluation

inferred← citeshttps://doi.org/10.1145/72935.72953openalex-snapshot

A more practical PRAM model

inferred← citeshttps://doi.org/10.1145/72935.72961openalex-snapshot

Matching partition a linked list and its optimization

inferred← citeshttps://doi.org/10.1145/75427.75462openalex-snapshot

An optimal linked list prefix algorithms on a local memory computer

inferred← citeshttps://doi.org/10.1145/97444.97695openalex-snapshot

Generalized sweep methods for parallel computational geometry

inferred← citeshttps://doi.org/10.1145/98524.98539openalex-snapshot

Parallel methods for visibility and shortest path problems in simple polygons (preliminary version)

inferred← citeshttps://doi.org/10.1146/annurev.cs.03.060188.001313openalex-snapshot

Parallel Algorithmic Techniques For Combinational Computation

inferred← citeshttps://doi.org/10.1364/ao.32.006425openalex-snapshot

Free-space optical mesh-connected bus networks using wavelength-division multiple access

inferred← citeshttps://doi.org/10.4218/etrij.99.0199.0203openalex-snapshot

An Efficient Parallel Algorithm for the Single Function Coarsest Partition Problem on the EREW PRAM

inferred← citeshttps://doi.org/10.5555/127787.127821openalex-snapshot

Efficient sequential and parallel algorithms for computing recovery points in trees and paths

inferred← citeshttps://doi.org/10.5555/127787.127824openalex-snapshot

On finding minimal 2-connected subgraphs

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.