On the public citation graph
Tree-Based Parallel Algorithm Design
0 signed · 30 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/bfb0040372openalex-snapshot
Subtree isomorphism is in random NC
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/0020-0190(90)90196-5openalex-snapshot
A simple randomized parallel algorithm for list-ranking
inferredcites →https://doi.org/10.1016/0022-0000(88)90006-2openalex-snapshot
An efficient parallel algorithm for planarity
inferredcites →https://doi.org/10.1016/0196-6774(89)90017-5openalex-snapshot
A simple parallel tree contraction algorithm
inferredcites →https://doi.org/10.1016/0304-3975(82)90092-5openalex-snapshot
The maximum flow problem is log space complete for P
inferredcites →https://doi.org/10.1016/0743-1066(84)90022-0openalex-snapshot
On the sequential nature of unification
inferredcites →https://doi.org/10.1016/0743-7315(87)90035-9openalex-snapshot
Parallel algorithms for message decomposition
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.1986.10openalex-snapshot
Approximate and exact parallel scheduling with applications to list, tree and graph problems
inferredcites →https://doi.org/10.1109/sfcs.1986.9openalex-snapshot
An optimal randomized parallel algorithm for finding connected components in a graph
inferredcites →https://doi.org/10.1137/0217044openalex-snapshot
Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits
inferredcites →https://doi.org/10.1145/28395.28423openalex-snapshot
Dynamic parallel complexity of computational circuits
inferredcites →https://doi.org/10.1145/321607.321620openalex-snapshot
The Generation of Optimal Code for Arithmetic Expressions
inferredcites →https://doi.org/10.1145/321812.321815openalex-snapshot
The Parallel Evaluation of General Arithmetic Expressions
inferredcites →https://doi.org/10.1145/3749740.3749751openalex-snapshot
Universal Schemes for Parallel Communication
inferredcites →https://doi.org/10.1145/990518.990519openalex-snapshot
The circuit value problem is log space complete for P
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.1998.0943openalex-snapshot
A Randomized Parallel Algorithm for Planar Graph Isomorphism
inferred← citeshttps://doi.org/10.1016/j.dam.2005.07.012openalex-snapshot
The Hamiltonian problem on distance-hereditary graphs
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.1109/focs.2019.00073openalex-snapshot
Balancing Straight-Line Programs
inferred← citeshttps://doi.org/10.1109/tpds.2003.1255633openalex-snapshot
A simple and fast parallel coloring algorithm for distance-hereditary graphs
inferred← citeshttps://doi.org/10.1137/s0097539795281724openalex-snapshot
The Dynamic Parallel Complexity of Computational Circuits
inferred← citeshttps://doi.org/10.1137/s0895480101389880openalex-snapshot
Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs
inferred← citeshttps://doi.org/10.1145/1148109.1148116openalex-snapshot
Towards automatic parallelization of tree reductions in dynamic programming
inferred← citeshttps://doi.org/10.12694/scpe.v18i1.1231openalex-snapshot
Efficient Implementation of Tree Skeletons on Distributed-Memory Parallel Computers
inferred← citeshttps://doi.org/10.1504/ijhpcn.2006.013490openalex-snapshot
Real-time minimum vertex cover for two-terminal series-parallel graphs
inferred← citeshttps://doi.org/10.2197/ipsjtrans.7.148openalex-snapshot
Parallel Tree Contraction with Fewer Types of Primitive Contraction Operations and Its Application to Trees of Unbounded Degree
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.