On the public citation graph

Parallelization of divide-and-conquer in the Bird-Meertens formalism

https://doi.org/10.1007/bf01211000
0 signed · 44 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-17943-7_132openalex-snapshot
Transputer-based experiments with the ZAPP architecture
inferredcites →https://doi.org/10.1007/3-540-51305-1_23openalex-snapshot
Algorithm theories and design tactics
inferredcites →https://doi.org/10.1007/3-540-55599-4_107openalex-snapshot
An implementation of static functional process networks
inferredcites →https://doi.org/10.1007/3-540-55599-4_134openalex-snapshot
A case study: Parallel program development for a recursive numerical algorithm
inferredcites →https://doi.org/10.1007/3-540-56891-3_12openalex-snapshot
Parallel programming using skeleton functions
inferredcites →https://doi.org/10.1007/3-540-57208-2_28openalex-snapshot
Loop parallelization in the polytope model
inferredcites →https://doi.org/10.1007/3-540-57499-9_26openalex-snapshot
Virtual data structures
inferredcites →https://doi.org/10.1007/978-0-585-27330-3_1openalex-snapshot
Deductive Derivation of Parallel Programs
inferredcites →https://doi.org/10.1007/978-1-4612-3228-5openalex-snapshot
Predicate Calculus and Program Semantics
inferredcites →https://doi.org/10.1007/978-3-642-74884-4_5openalex-snapshot
Lectures on Constructive Functional Programming
inferredcites →https://doi.org/10.1007/bf00129780openalex-snapshot
An algebraic model for divide-and-conquer and its parallelism
inferredcites →https://doi.org/10.1016/0096-0551(93)90036-zopenalex-snapshot
List processing primitives for parallel computation
inferredcites →https://doi.org/10.1016/0167-6423(91)90022-popenalex-snapshot
An exercise in transformational programming: Backtracking and branch-and-bound
inferredcites →https://doi.org/10.1016/0167-6423(93)90014-gopenalex-snapshot
Deriving parallel programs from specifications using cost information
inferredcites →https://doi.org/10.1016/0304-3975(86)90033-2openalex-snapshot
The automated proof of a trace transformation for a bitonic sort
inferredcites →https://doi.org/10.1016/0743-7315(87)90010-4openalex-snapshot
Supporting divide-and-conquer algorithms for image processing
inferredcites →https://doi.org/10.1093/comjnl/35.6.555openalex-snapshot
A Higher-Order Approach to Parallel Algorithms
inferredcites →https://doi.org/10.1093/comjnl/36.3.254openalex-snapshot
Pipelines for Divide-and-Conquer Functions
inferredcites →https://doi.org/10.1109/2.62092openalex-snapshot
Architecture-independent parallel computation
inferredcites →https://doi.org/10.1109/ipps.1994.288275openalex-snapshot
Systematic development of an SPMD implementation schema for mutually recursive divide-and-conquer specifications
inferredcites →https://doi.org/10.1137/0218035openalex-snapshot
Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
inferredcites →https://doi.org/10.1145/122616.122620openalex-snapshot
Compile-time transformations and optimization of parallel Divide-and-Conquer algorithms
inferredcites →https://doi.org/10.1145/359576.359579openalex-snapshot
Can programming be liberated from the von Neumann style?
inferredcites →https://doi.org/10.1145/512644.512673openalex-snapshot
A mechanically certified theorem about optimal concurrency of sorting networks
inferredcites →https://doi.org/10.1145/800225.806823openalex-snapshot
Dialogues

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-45574-4_2openalex-snapshot
Cost Hierarchies for Abstract Parallel Machines
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-4471-0097-3_1openalex-snapshot
Foundations of Data-parallel Skeletons
inferred← citeshttps://doi.org/10.1007/978-3-540-76786-2_1openalex-snapshot
Datatype-Generic Programming
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/j.advengsoft.2006.01.009openalex-snapshot
Parallel algorithms development for programmable logic devices
inferred← citeshttps://doi.org/10.1016/j.future.2017.04.035openalex-snapshot
Automatically deriving cost models for structured parallel processes using hylomorphisms
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.1109/aiccsa.2006.205098openalex-snapshot
High Speed Hardware Implementation of a Heuristic 2D Rectangle Placement Algorithm
inferred← citeshttps://doi.org/10.1109/hicss.2003.1174808openalex-snapshot
Formal behavioural synthesis of Handel-C parallel hardware implementations from functional specifications
inferred← citeshttps://doi.org/10.1109/icecs.2000.911533openalex-snapshot
Calculational design of special purpose parallel algorithms
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1303183openalex-snapshot
Functional realization of coordination environments for mixed parallelism
inferred← citeshttps://doi.org/10.1109/jcpc.2009.5420159openalex-snapshot
MBMF: A framework for macroprogramming data-centric sensor network applications using the Bird-Meertens Formalism
inferred← citeshttps://doi.org/10.1142/s012962640200094xopenalex-snapshot
TURING UNIVERSALITY OF RECURSIVE PATTERNS FOR PARALLEL PROGRAMMING
inferred← citeshttps://doi.org/10.1145/2951913.2951920openalex-snapshot
Farms, pipes, streams and reforestation: reasoning about structured parallel processes using types and hylomorphisms
inferred← citeshttps://doi.org/10.1145/3022670.2951920openalex-snapshot
Farms, pipes, streams and reforestation: reasoning about structured parallel processes using types and hylomorphisms
inferred← citeshttps://doi.org/10.1145/331532.331557openalex-snapshot
Architecture-cognizant divide and conquer algorithms
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.