On the public citation graph

Optimal parallel algorithms for expression tree evaluation and list ranking

https://doi.org/10.1007/bfb0040377
0 signed · 42 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/bf01762121openalex-snapshot
The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time
inferredcites →https://doi.org/10.1016/0020-0190(85)90025-0openalex-snapshot
On efficient parallel strong orientation
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.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.1145/2157.322410openalex-snapshot
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
inferredcites →https://doi.org/10.1145/28395.28429openalex-snapshot
Parallel symmetry-breaking in sparse graphs
inferredcites →https://doi.org/10.1145/321812.321815openalex-snapshot
The Parallel Evaluation of General Arithmetic Expressions
inferredcites →https://doi.org/10.1145/321906.321911openalex-snapshot
On the Parallel Evaluation of Certain Arithmetic Expressions
inferredcites →https://doi.org/10.1145/3318.3478openalex-snapshot
Optimal parallel generation of a computation tree form
inferredcites →https://doi.org/10.21236/ada198233openalex-snapshot
Parallel Symmetry-Breaking in Sparse Graphs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-55328-2_3openalex-snapshot
An environment for parallel algebraic computation
inferred← citeshttps://doi.org/10.1007/3-540-55706-7_6openalex-snapshot
An optimal parallel algorithm for computing a near-optimal order of matrix multiplications
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_247openalex-snapshot
Parallel construction of quadtrees and quality triangulations
inferred← citeshttps://doi.org/10.1007/3-540-57811-0_9openalex-snapshot
Parallel pruning decomposition (PDS) and biconnected components of graphs
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-7091-9076-0_4openalex-snapshot
Basic Parallel Algorithms in Graph Theory
inferred← citeshttps://doi.org/10.1007/bf01294130openalex-snapshot
An efficient parallel algorithm for shortest paths in planar layered digraphs
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/bfb0024747openalex-snapshot
Efficient parallel algorithms for scheduling with tree precedence constraints
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/0022-0000(92)90003-2openalex-snapshot
Parallel restructuring and evaluation of expressions
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90326-wopenalex-snapshot
On optimal parallel computations for sequences of brackets
inferred← citeshttps://doi.org/10.1016/s0747-7171(08)80023-5openalex-snapshot
Parallel tree pattern matching
inferred← citeshttps://doi.org/10.1109/ipps.1992.223035openalex-snapshot
A near-optimal parallel algorithm for edge-coloring outerplanar graphs
inferred← citeshttps://doi.org/10.1109/pesgm40551.2019.8974025openalex-snapshot
Mass Expression Evaluation Parallel Algorithm Based on ‘Expression Forest’ and Its Application in Power System Calculation
inferred← citeshttps://doi.org/10.1109/recosoc.2016.7533894openalex-snapshot
The selector-tree network: A new self-routing and non-blocking interconnection network
inferred← citeshttps://doi.org/10.1109/spdp.1992.242747openalex-snapshot
A divide and conquer approach to shortest paths in planar layered digraphs
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/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.1142/s0218195999000303openalex-snapshot
PARALLEL CONSTRUCTION OF QUADTREES AND QUALITY TRIANGULATIONS
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/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/97444.97696openalex-snapshot
Efficient parallel computation of arrangements of hyperplanes in d dimensions
inferred← citeshttps://doi.org/10.1146/annurev.cs.03.060188.001313openalex-snapshot
Parallel Algorithmic Techniques For Combinational Computation
inferred← citeshttps://doi.org/10.12694/scpe.v18i1.1230openalex-snapshot
Efficient Parallel Tree Reductions on Distributed Memory Environments
inferred← citeshttps://doi.org/10.21236/ada200521openalex-snapshot
Parallel Restructuring and Evaluation of Expressions
inferred← citeshttps://doi.org/10.5555/127787.127821openalex-snapshot
Efficient sequential and parallel algorithms for computing recovery points in trees and paths
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.