On the public citation graph
An algebraic model for divide-and-conquer and its parallelism
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.
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.1016/0167-6423(87)90034-7openalex-snapshot
Applications of a strategy for designing divide-and-conquer algorithms
inferredcites →https://doi.org/10.1016/s0019-9958(85)80041-3openalex-snapshot
A taxonomy of problems with fast parallel algorithms
inferredcites →https://doi.org/10.1109/sfcs.1985.52openalex-snapshot
Solving some graph problems with optimal or near-optimal speedup on mesh-of-trees networks
inferredcites →https://doi.org/10.1109/t-c.1971.223205openalex-snapshot
Parallel Processing with the Perfect Shuffle
inferredcites →https://doi.org/10.1109/tc.1987.1676942openalex-snapshot
A Partitioning Strategy for Nonuniform Problems on Multiprocessors
inferredcites →https://doi.org/10.1145/358645.358660openalex-snapshot
The cube-connected cycles: a versatile network for parallel computation
inferredcites →https://doi.org/10.1145/364914.364944openalex-snapshot
BLNSYS—a 1401 operating system with Braille capabilities
inferredcites →https://doi.org/10.1145/3749740.3749751openalex-snapshot
Universal Schemes for Parallel Communication
inferredcites →https://doi.org/10.2307/2008642openalex-snapshot
The Characteristics of Parallel Algorithms.
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-45417-9_26openalex-snapshot
Dynamic Partitioning of the Divide-and-Conquer Scheme with Migration in PVM Environment
inferred← citeshttps://doi.org/10.1007/3-540-45825-5_36openalex-snapshot
Development and Tuning of Irregular Divide-and-Conquer Applications in DAMPVM/DAC
inferred← citeshttps://doi.org/10.1007/3-540-56891-3_9openalex-snapshot
Optimal mappings of m dimensional FFT communication to k dimensional mesh for arbitrary m and k
inferred← citeshttps://doi.org/10.1007/3-540-60117-1_7openalex-snapshot
Architecture independent massive parallelization of divide-and-conquer algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4615-2315-4_6openalex-snapshot
Machine-Independent Parallel Programming Using the Divide-and-Conquer Paradigm
inferred← citeshttps://doi.org/10.1007/978-94-015-9608-4_9openalex-snapshot
A Personal, Historical Perspective of Parallel Programming for High Performance
inferred← citeshttps://doi.org/10.1007/bf01211000openalex-snapshot
Parallelization of divide-and-conquer in the Bird-Meertens formalism
inferred← citeshttps://doi.org/10.1007/bfb0002794openalex-snapshot
On dividing and conquering independently
inferred← citeshttps://doi.org/10.1007/bfb0097888openalex-snapshot
Recursive individually distributed object
inferred← citeshttps://doi.org/10.1007/s002360050174openalex-snapshot
Abstraction and performance in the design of parallel programs: an overview of the SAT approach
inferred← citeshttps://doi.org/10.1016/0096-0551(93)90036-zopenalex-snapshot
List processing primitives for parallel computation
inferred← citeshttps://doi.org/10.1016/0165-6074(93)90044-lopenalex-snapshot
A parallel algorithm for the Jacobian matrix of a manipulator
inferred← citeshttps://doi.org/10.1016/0167-6423(95)00022-4openalex-snapshot
Massive parallelization of divide-and-conquer algorithms over powerlists
inferred← citeshttps://doi.org/10.1016/b978-0-444-81784-6.50051-8openalex-snapshot
Exploiting Divide-and-Conquer Parallelism of Functional Specifications
inferred← citeshttps://doi.org/10.1016/j.artint.2006.02.005openalex-snapshot
Cut-and-solve: An iterative search strategy for combinatorial optimization problems
inferred← citeshttps://doi.org/10.1016/j.future.2017.05.011openalex-snapshot
Free the Conqueror! Refactoring divide-and-conquer functions
inferred← citeshttps://doi.org/10.1016/j.sysarc.2004.06.004openalex-snapshot
Generalized parallel divide and conquer on 3D mesh and torus
inferred← citeshttps://doi.org/10.1023/a:1007904422322openalex-snapshot
The Static Parallelization of Loops and Recursions
inferred← citeshttps://doi.org/10.1023/a:1007981511582openalex-snapshot
Programming with Divide-and-Conquer Skeletons: A Case Study of FFT
inferred← citeshttps://doi.org/10.1093/comjnl/bxab107openalex-snapshot
Parallel Divide-and-Conquer Algorithms for Bubble Sort, Selection Sort and Insertion Sort
inferred← citeshttps://doi.org/10.1108/ijwis-05-2018-0038openalex-snapshot
Semantic composition of optimal process service plans in manufacturing with ODERU
inferred← citeshttps://doi.org/10.1109/12.338101openalex-snapshot
Unified architecture for divide and conquer based tridiagonal system solvers
inferred← citeshttps://doi.org/10.1109/71.539736openalex-snapshot
Parallel divide and conquer on meshes
inferred← citeshttps://doi.org/10.1109/fmpc.1990.89496openalex-snapshot
Divacon: a parallel language for scientific computing based on divide-and-conquer
inferred← citeshttps://doi.org/10.1109/fmpc.1992.234914openalex-snapshot
Optimal implementation of parallel divide-and-conquer algorithms on de Bruijn networks
inferred← citeshttps://doi.org/10.1109/hpdc.1996.546232openalex-snapshot
Automatic exploitation of dual level parallelism on a network of multiprocessors
inferred← citeshttps://doi.org/10.1109/icpp.1994.52openalex-snapshot
An Efficient Parallel Algorithm for Vector Quantizer Design
inferred← citeshttps://doi.org/10.1109/ipps.1994.288275openalex-snapshot
Systematic development of an SPMD implementation schema for mutually recursive divide-and-conquer specifications
inferred← citeshttps://doi.org/10.1109/ipps.1995.395867openalex-snapshot
Divide-and-conquer programming on MIMD computers
inferred← citeshttps://doi.org/10.1109/pcee.2002.1115218openalex-snapshot
Dynamic process partitioning and migration for irregular applications
inferred← citeshttps://doi.org/10.1109/spdp.1991.218237openalex-snapshot
A divide-and-conquer method of solving tridiagonal systems on hypercube massively parallel computers
inferred← citeshttps://doi.org/10.1145/122616.122620openalex-snapshot
Compile-time transformations and optimization of parallel Divide-and-Conquer algorithms
inferred← citeshttps://doi.org/10.1145/155332.155344openalex-snapshot
An equational language for data-parallelism
inferred← citeshttps://doi.org/10.1145/1708046.1708055openalex-snapshot
Compress-and-conquer for optimal multicore computing
inferred← citeshttps://doi.org/10.1145/173284.155344openalex-snapshot
An equational language for data-parallelism
inferred← citeshttps://doi.org/10.1145/181014.181032openalex-snapshot
Efficient compilation of high-level data parallel algorithms
inferred← citeshttps://doi.org/10.1145/266670.266697openalex-snapshot
Deriving efficient parallel programs for complex recurrences
inferred← citeshttps://doi.org/10.1145/331532.331557openalex-snapshot
Architecture-cognizant divide and conquer algorithms
inferred← citeshttps://doi.org/10.1145/602231.602243openalex-snapshot
A new calculus for multidimensional arrays
inferred← citeshttps://doi.org/10.1145/604444.602243openalex-snapshot
A new calculus for multidimensional arrays
inferred← citeshttps://doi.org/10.1145/75277.75304openalex-snapshot
Copy elimination in functional languages
inferred← citeshttps://doi.org/10.1145/91556.91610openalex-snapshot
A functional programming language compiler for massively parallel computers
inferred← citeshttps://doi.org/10.1177/1094342003017001007openalex-snapshot
Programming, Tuning and Automatic Parallelization of Irregular Divide-and-Conquer Applications in DAMPVM/DAC
inferred← citeshttps://doi.org/10.15476/elte.2018.171openalex-snapshot
Adat és kiértékelési függőségi elemzés funkcionális nyelvekre - Erlang programok statikus elemzése
inferred← citeshttps://doi.org/10.18419/opus-4107openalex-snapshot
Contact investigations of granular mechanical media in a tumbling sorting machine
inferred← citeshttps://doi.org/10.3390/math10213925openalex-snapshot
On Generalizing Divide and Conquer Parallel Programming Pattern
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.