Computing downwards accumulations on trees quickly

DOI10.1016/S0304-3975(96)00114-4MaRDI QIDQ1369231zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Recommendations

• Parallel algorithms for tree accumulations
• scientific article; zbMATH DE number 512952
• Generic downwards accumulations
• Parallel implementation of tree skeletons

Cites work

• A While-rule in Martin-Lof's Theory of Types
• Efficient parallel algorithms for tree accumulations
• scientific article; zbMATH DE number 3982493 (Why is no real title available?)
• scientific article; zbMATH DE number 8766 (Why is no real title available?)
• scientific article; zbMATH DE number 42965 (Why is no real title available?)
• scientific article; zbMATH DE number 512952 (Why is no real title available?)
• Parallel implementation of tree skeletons
• Parallel Prefix Computation
• Semantics of context-free languages

Cited in

(3)

• Generic downwards accumulations
• Parallel algorithms for tree accumulations
• scientific article; zbMATH DE number 512952 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1369231)