On the public citation graph

Optimal parallel evaluation of tree-structured computations by raking (extended abstract)

https://doi.org/10.1007/bfb0040378
0 signed · 56 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/3-540-16766-8_21openalex-snapshot
Efficient parallel evaluation of straight-line code and arithmetic circuits
inferredcites →https://doi.org/10.1007/3-540-17179-7_28openalex-snapshot
An optimal parallel algorithm for dynamic expression evaluation and its applications
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/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.1145/3318.3478openalex-snapshot
Optimal parallel generation of a computation tree form
inferredcites →https://doi.org/10.4064/am-19-3-4-569-577openalex-snapshot
Remarks on pebble games on 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-36265-7_7openalex-snapshot
Evaluating Arithmetic Expressions Using Tree Contraction: A Fast and Scalable Parallel Implementation for Symmetric Multiprocessors (SMPs)
inferred← citeshttps://doi.org/10.1007/3-540-53414-8_43openalex-snapshot
Optimal parallel 3-colouring algorithm for rooted trees and its application
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_148openalex-snapshot
Structural parallel algorithmics
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-57155-8_266openalex-snapshot
Improved parallel depth-first search in undirected planar graphs
inferred← citeshttps://doi.org/10.1007/3-540-57273-2_64openalex-snapshot
Optimal tree contraction on the hypercube and related networks
inferred← citeshttps://doi.org/10.1007/3-540-62559-3_12openalex-snapshot
More general parallel tree contraction: Register allocation and broadcasting in a tree
inferred← citeshttps://doi.org/10.1007/3-540-62592-5_81openalex-snapshot
Tree contractions and evolutionary trees
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/bf01187019openalex-snapshot
Visibility with a moving point of view
inferred← citeshttps://doi.org/10.1007/bf01759076openalex-snapshot
Deterministic parallel list ranking
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/bfb0024747openalex-snapshot
Efficient parallel algorithms for scheduling with tree precedence constraints
inferred← citeshttps://doi.org/10.1007/pl00009179openalex-snapshot
Tree-Based Parallel Algorithm Design
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90045-wopenalex-snapshot
Optimal parallel 3-coloring algorithm for rooted trees and its applications
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/j.jpdc.2003.08.004openalex-snapshot
Parallel algorithms for Hamiltonian problems on quasi-threshold graphs
inferred← citeshttps://doi.org/10.1016/j.jpdc.2004.09.001openalex-snapshot
Parallel algorithms for tree accumulations
inferred← citeshttps://doi.org/10.1016/j.procs.2011.04.002openalex-snapshot
A Practical Tree Contraction Algorithm for Parallel Skeletons on Trees of Unbounded Degree
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(97)00285-5openalex-snapshot
More general parallel tree contraction: Register allocation and broadcasting in a tree
inferred← citeshttps://doi.org/10.1109/5.163410openalex-snapshot
Parallel techniques for computational geometry
inferred← citeshttps://doi.org/10.1109/hicss.1994.323270openalex-snapshot
Efficient parallel algorithms on chordal graphs with a sparse tree representation
inferred← citeshttps://doi.org/10.1109/hicss.1994.323271openalex-snapshot
Optimal expression evaluation and term matching on the Boolean hypercube and on hypercubic networks
inferred← citeshttps://doi.org/10.1109/hipc.1997.634483openalex-snapshot
An optimal parallel algorithm for the all-nearest-foreign-neighbors problem in arbitrary dimensions
inferred← citeshttps://doi.org/10.1109/ispan.1994.367138openalex-snapshot
A parallel algorithm for the single step searching problem
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.1993.366854openalex-snapshot
Optimal parallel all-nearest-neighbors using the well-separated pair decomposition
inferred← citeshttps://doi.org/10.1137/0220070openalex-snapshot
Parallel Tree Contraction Part 2: Further Applications
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/s0097539792227077openalex-snapshot
Planar Strong Connectivity Helps in Parallel Depth-First Search
inferred← citeshttps://doi.org/10.1137/s0097539793260775openalex-snapshot
An Efficient Parallel Algorithm for the General Planar Monotone Circuit Value Problem
inferred← citeshttps://doi.org/10.1137/s0895480191221453openalex-snapshot
Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs
inferred← citeshttps://doi.org/10.1145/129712.129766openalex-snapshot
A decomposition of multi-dimensional point-sets with applications to k-nearest-neighbors and n-body potential fields (preliminary version)
inferred← citeshttps://doi.org/10.1145/140901.140913openalex-snapshot
Optimal routing of parentheses on the hypercube
inferred← citeshttps://doi.org/10.1145/140901.140916openalex-snapshot
Optimal dynamic scheduling of task tree on constant-dimensional architectures
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/164360.164409openalex-snapshot
Efficient parallel evaluation of CSG tree using fixed number of processors
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/181014.181050openalex-snapshot
Dynamic parallel tree contraction (extended abstract)
inferred← citeshttps://doi.org/10.1145/195613.195617openalex-snapshot
Parallel algorithms for evaluating sequences of set-manipulation operations
inferred← citeshttps://doi.org/10.1145/200836.200853openalex-snapshot
A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
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/3087556.3087595openalex-snapshot
Brief Announcement
inferred← citeshttps://doi.org/10.1145/341800.341818openalex-snapshot
A no-busy-wait balanced tree parallel algorithmic paradigm
inferred← citeshttps://doi.org/10.1145/97444.97695openalex-snapshot
Generalized sweep methods for parallel computational geometry
inferred← citeshttps://doi.org/10.1504/ijhpcn.2006.013490openalex-snapshot
Real-time minimum vertex cover for two-terminal series-parallel graphs
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.