<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Modular Synthesis of Divide-and-Conquer Parallelism for Nested Loops (Extended Version) · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1904.01031/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1904.01031/feed.xml" rel="self" type="application/rss+xml" /><item><title>Modular Synthesis of Divide-and-Conquer Parallelism for Nested Loops (Extended Version) — HN submission</title><link>https://news.ycombinator.com/item?id=19560094</link><guid isPermaLink="false">urn:hackerpapers:submission:1904.01031:19560094</guid><pubDate>Wed, 03 Apr 2019 01:32:17 GMT</pubDate><description>&lt;p&gt;Modular Synthesis of Divide-and-Conquer Parallelism for Nested Loops&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1904.01031/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.PL</category></item></channel></rss>
