On the public citation graph

Tree machines and divide-and-conquer algorithms

https://doi.org/10.1007/bfb0105107
0 signed · 21 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.1002/zamm.19800600811openalex-snapshot
Zienkiewicz, O. C., The Finite Element Method. 3. Edition. London. McGraw‐Hill Book Company (UK) Limited. 1977. XV, 787 S.
inferredcites →https://doi.org/10.1016/0309-1708(80)90069-xopenalex-snapshot
An analysis of the finite element method
inferredcites →https://doi.org/10.1016/b978-0-12-141050-6.50009-xopenalex-snapshot
A Recursive Analysis of Dissection Strategies††This work was supported in part by the Office of Naval Research under contract N00014-75-C-0243.
inferredcites →https://doi.org/10.1016/c2013-0-10439-4openalex-snapshot
Sparse Matrix Computations
inferredcites →https://doi.org/10.1016/s0022-0000(73)80033-9openalex-snapshot
Time bounds for selection
inferredcites →https://doi.org/10.1093/comjnl/5.1.10openalex-snapshot
Quicksort
inferredcites →https://doi.org/10.1145/357980.358021openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1145/358841.358850openalex-snapshot
Multidimensional divide-and-conquer
inferredcites →https://doi.org/10.1145/359576.359585openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.2307/2005716openalex-snapshot
An Analysis of the Finite Element Method
inferredcites →https://doi.org/10.2307/2006014openalex-snapshot
Sparse Matrix Computations.

What points at this work

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

inferred← citeshttps://doi.org/10.1016/s0167-8191(84)90446-0openalex-snapshot
Parallel pivoting algorithms for sparse symmetric matrices
inferred← citeshttps://doi.org/10.1109/12.210177openalex-snapshot
On optimizing diameter and average distance of directed interconnected networks
inferred← citeshttps://doi.org/10.1109/12.2169openalex-snapshot
Storage management in virtual tree machines
inferred← citeshttps://doi.org/10.1109/mc.1985.1662926openalex-snapshot
Multiprocessing of Combinatorial Search Problems
inferred← citeshttps://doi.org/10.1109/tc.1983.1676280openalex-snapshot
Divide-and-Conquer for Parallel Processing
inferred← citeshttps://doi.org/10.1109/tc.1984.1676425openalex-snapshot
Virtual Tree Machines
inferred← citeshttps://doi.org/10.1145/125826.125985openalex-snapshot
High level support for divide-and-conquer parallelism
inferred← citeshttps://doi.org/10.1145/15715.15718openalex-snapshot
Survey on special purpose computer architectures for AI
inferred← citeshttps://doi.org/10.5555/324493.324579openalex-snapshot
Implemention of parallel Prolog on tree machines
inferred← citeshttps://doi.org/10.5555/324493.324580openalex-snapshot
Optimal granularity of parallel evaluation of AND trees
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.