Lilje Due's Bloghttps://liljedue.dk/2026-11-02T00:00:00ZHow To Parallelize Your Tree Operationshttps://liljedue.dk/blog/parallel-trees2026-11-02T00:00:00ZLilje Henrich DueComputations on trees are often seen as inherently sequential. In this post, I will show how to compute things like node depths and subtree sizes in parallel.What Is The Best Parallel Partition?https://liljedue.dk/blog/parallel-partition2026-08-31T00:00:00ZLilje Henrich DueHow to implement partition efficiently on a GPU in Futhark, and why there is no single best approach.Turning an Inclusive Scan into an Exclusive Scanhttps://liljedue.dk/blog/incscan-to-exscan2026-06-15T00:00:00ZLilje Henrich DueUsing monoid composition it is possible to turn an inclusive scan into an exclusive scan.Monoid Composition & Maximum Subarray Sum Problemhttps://liljedue.dk/blog/monoid-composition2026-06-14T00:00:00ZLilje Henrich DueSome monoids can be composed into a single monoid, allowing a scan feeding into a reduce to be expressed as a single reduce. This turns out to be a useful combinator, with applications in parentheses matching, polynomial evaluation, and the maximum subarray sum problem.Parallel Stacks & Parentheses Matchinghttps://liljedue.dk/blog/parallel-parentheses-matching2026-06-02T00:00:00ZLilje Henrich DueThe parallel parentheses matching problem can be parallelized in different manners depending on the use case and is a good example of how stacks map to parallel hardware.