A short cut to parallelization theorems

From MaRDI portal

Revision as of 19:22, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5244804

Jump to:navigation, search

DOI10.1145/2500365.2500580zbMath1323.68181OpenAlexW2074136126MaRDI QIDQ5244804

Akimasa Morihata

Publication date: 30 March 2015

Published in: Proceedings of the 18th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2500365.2500580

zbMATH Keywords

shortcut deforestation divide-and-conquer parallelism third list-homomorphism theorem

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Functional programming and lambda calculus (68N18) Data structures (68P05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Incremental Computing with Abstract Data Structures

This page was built for publication: A short cut to parallelization theorems

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5244804&oldid=19873735"