Computing downwards accumulations on trees quickly

DOI10.1016/S0304-3975(96)00114-4zbMath0882.68109OpenAlexW2158798722WikidataQ126865208 ScholiaQ126865208MaRDI QIDQ1369231

Jeremy Gibbons

Publication date: 19 October 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00114-4

zbMATH Keywords

binary treesdownwards accumulationdownwards passes

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel implementation of tree skeletons
• Efficient parallel algorithms for tree accumulations
• A While-rule in Martin-Lof's Theory of Types
• Parallel Prefix Computation
• Semantics of context-free languages

This page was built for publication: Computing downwards accumulations on trees quickly