Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Efficient parallel algorithms for tree accumulations

From MaRDI portal
Publication:1336774
Jump to:navigation, search

DOI10.1016/0167-6423(94)00013-1zbMath0942.68798OpenAlexW2001679238MaRDI QIDQ1336774

Jeremy Gibbons, David B. Skillicorn, Wentong Cai

Publication date: 26 February 1996

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6423(94)00013-1



Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Data structures (68P05)


Related Items (4)

Functional Pearls ⋮ Computing downwards accumulations on trees quickly ⋮ A compositional framework for developing parallel programs on two-dimensional arrays ⋮ A parallel tree difference algorithm







This page was built for publication: Efficient parallel algorithms for tree accumulations

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1336774&oldid=13462675"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 13:03.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki