https://hackerpaper.kaipfister.de/p/1805.08612/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=17883998urn:hackerpapers:mention:1805.08612:17883998Fri, 31 Aug 2018 08:54:15 GMT<p>This look like https://bugs.openjdk.java.net/browse/JDK-8203864, which has the following additional information: &quot;While working on a proper complexity analysis of the algorithm, we realised that there was an error in the last paper reporting such a bug (http://envisage-project.eu/wp-content/uploads/2015/02/sortin...). This implies that the correction implemented in the Java source code (changing Timsort stack size) is wrong and that it is still possible to make it break. This is explained in full details in our analysis: https://arxiv.org/pdf/1805.08612.pdf&quot;</p><p><a href="https://hackerpaper.kaipfister.de/p/1805.08612/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.DS