<instructions>Your goal is to analyze the following comment and estimate how highly it will be upvoted by the Hacker News community.</instructions><comment><author>llimllib</author><text>Here&amp;#x27;s a google bigquery that lists the most common PDFs referenced in the github sample dataset, and the top 100 results: &lt;a href=&quot;https:&amp;#x2F;&amp;#x2F;gist.github.com&amp;#x2F;llimllib&amp;#x2F;3f1877eab06208958060f491cf3c48cb&quot; rel=&quot;nofollow&quot;&gt;https:&amp;#x2F;&amp;#x2F;gist.github.com&amp;#x2F;llimllib&amp;#x2F;3f1877eab06208958060f491cf3...&lt;/a&gt;&lt;p&gt;It&amp;#x27;s possible to run this query against the full github dataset but I couldn&amp;#x27;t figure out how to pay for it, so if somebody wants to do that it would be excellent.</text><parent_chain></parent_chain></comment><story><title>List of scientific papers found in OpenJDK source code</title><url>http://lowlevelbits.org/java-papers/</url></story>
<instructions>Your goal is to analyze the following comment and estimate how highly it will be upvoted by the Hacker News community.</instructions><comment><author>lorenzhs</author><text>Some more found by a quick grep for &amp;quot;et al.&amp;quot;, &amp;quot;Proceedings&amp;quot;, &amp;quot;Proc. &amp;quot;, &amp;quot;Symposium&amp;quot;, &amp;quot;Conference&amp;quot;, &amp;quot;Conf. &amp;quot;, &amp;quot;PPoPP&amp;quot; (a conference with an easy-to-grep-for name), and &amp;quot;acm.org&amp;quot;:&lt;p&gt;&lt;i&gt;hotspot&amp;#x2F;src&amp;#x2F;cpu&amp;#x2F;ppc&amp;#x2F;vm&amp;#x2F;ppc.ad:&lt;/i&gt; See J.M.Tendler et al. &amp;quot;Power4 system microarchitecture&amp;quot;, IBM J. Res. &amp;amp; Dev., No. 1, Jan. 2002.&lt;p&gt;&lt;i&gt;hotspot&amp;#x2F;src&amp;#x2F;cpu&amp;#x2F;x86&amp;#x2F;vm&amp;#x2F;crc32c.h:&lt;/i&gt; V. Gopal et al. &amp;#x2F; Fast CRC Computation for iSCSI Polynomial Using CRC32 Instruction April 2011 8&lt;p&gt;&lt;i&gt;hotspot&amp;#x2F;src&amp;#x2F;share&amp;#x2F;vm&amp;#x2F;gc&amp;#x2F;shared&amp;#x2F;taskqueue.hpp:&lt;/i&gt; Le, N. M., Pop, A., Cohen A., and Nardell, F. Z.: Correct and efficient work-stealing for weak memory models Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming (PPoPP 2013), 69-80&lt;p&gt;&lt;i&gt;jdk&amp;#x2F;src&amp;#x2F;java.base&amp;#x2F;share&amp;#x2F;classes&amp;#x2F;java&amp;#x2F;util&amp;#x2F;Arrays.java:&lt;/i&gt; Peter McIlroy&amp;#x27;s &amp;quot;Optimistic Sorting and Information Theoretic Complexity&amp;quot;, in Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pp 467-474, January 1993&lt;p&gt;&lt;i&gt;jdk&amp;#x2F;src&amp;#x2F;jdk.crypto.ec&amp;#x2F;share&amp;#x2F;native&amp;#x2F;libsunec&amp;#x2F;impl&amp;#x2F;mpmontg.c:&lt;/i&gt; &amp;quot;A Cryptogrpahic Library for the Motorola DSP56000&amp;quot; by Stephen R. Dusse&amp;#x27; and Burton S. Kaliski Jr. published in &amp;quot;Advances in Cryptology: Proceedings of EUROCRYPT &amp;#x27;90, LNCS volume 473, 1991, pg 230-244&lt;p&gt;&lt;i&gt;hotspot&amp;#x2F;src&amp;#x2F;share&amp;#x2F;vm&amp;#x2F;opto&amp;#x2F;superword.hpp:&lt;/i&gt; &amp;quot;Exploiting SuperWord Level Parallelism with Multimedia Instruction Sets&amp;quot; by Samuel Larsen and Saman Amarasinghe [...] published in ACM SIGPLAN Notices, Proceedings of ACM PLDI &amp;#x27;00,  Volume 35 Issue 5&lt;p&gt;&lt;i&gt;jdk&amp;#x2F;src&amp;#x2F;java.base&amp;#x2F;share&amp;#x2F;classes&amp;#x2F;java&amp;#x2F;util&amp;#x2F;SplittableRandom.java:&lt;/i&gt; Leiserson, Schardl, and Sukha &amp;quot;Deterministic Parallel Random-Number Generation for Dynamic-Multithreading Platforms&amp;quot;, PPoPP 2012&lt;p&gt;&lt;i&gt;jdk&amp;#x2F;src&amp;#x2F;java.base&amp;#x2F;share&amp;#x2F;classes&amp;#x2F;java&amp;#x2F;util&amp;#x2F;SplittableRandom.java:&lt;/i&gt; &amp;quot;Parallel random numbers: as easy as 1, 2, 3&amp;quot; by Salmon, Morae, Dror, and Shaw, SC 2011&lt;p&gt;&lt;i&gt;jdk&amp;#x2F;src&amp;#x2F;java.base&amp;#x2F;share&amp;#x2F;classes&amp;#x2F;java&amp;#x2F;util&amp;#x2F;concurrent&amp;#x2F;ForkJoinPool.java:&lt;/i&gt; &amp;quot;Dynamic Circular Work-Stealing Deque&amp;quot; by Chase and Lev, SPAA 2005&lt;p&gt;&lt;i&gt;jdk&amp;#x2F;src&amp;#x2F;java.base&amp;#x2F;share&amp;#x2F;classes&amp;#x2F;java&amp;#x2F;util&amp;#x2F;concurrent&amp;#x2F;ForkJoinPool.java:&lt;/i&gt; &amp;quot;Idempotent work stealing&amp;quot; by Michael, Saraswat, and Vechev, PPoPP 2009&lt;p&gt;&lt;i&gt;jdk&amp;#x2F;src&amp;#x2F;java.base&amp;#x2F;share&amp;#x2F;classes&amp;#x2F;java&amp;#x2F;util&amp;#x2F;concurrent&amp;#x2F;ForkJoinPool.java:&lt;/i&gt; &amp;quot;Leapfrogging: a portable technique for implementing efficient futures&amp;quot; by D.B. Wagner and B.G. Calder, PPoPP &amp;#x27;93, &lt;a href=&quot;http:&amp;#x2F;&amp;#x2F;dl.acm.org&amp;#x2F;citation.cfm?id=155354&quot; rel=&quot;nofollow&quot;&gt;http:&amp;#x2F;&amp;#x2F;dl.acm.org&amp;#x2F;citation.cfm?id=155354&lt;/a&gt;&lt;p&gt;&lt;i&gt;jdk&amp;#x2F;src&amp;#x2F;java.base&amp;#x2F;share&amp;#x2F;classes&amp;#x2F;java&amp;#x2F;util&amp;#x2F;concurrent&amp;#x2F;LinkedTransferQueue.java:&lt;/i&gt; Using elimination to implement scalable and lock-free FIFO queues, Moir et al, &lt;a href=&quot;http:&amp;#x2F;&amp;#x2F;portal.acm.org&amp;#x2F;citation.cfm?id=1074013&quot; rel=&quot;nofollow&quot;&gt;http:&amp;#x2F;&amp;#x2F;portal.acm.org&amp;#x2F;citation.cfm?id=1074013&lt;/a&gt;&lt;p&gt;&lt;i&gt;jdk&amp;#x2F;src&amp;#x2F;java.base&amp;#x2F;share&amp;#x2F;classes&amp;#x2F;java&amp;#x2F;util&amp;#x2F;concurrent&amp;#x2F;LinkedTransferQueue.java:&lt;/i&gt; &amp;quot;Bounding space usage of conservative garbage collectors&amp;quot;, HJ Boehm, &lt;a href=&quot;http:&amp;#x2F;&amp;#x2F;portal.acm.org&amp;#x2F;citation.cfm?doid=503272.503282&quot; rel=&quot;nofollow&quot;&gt;http:&amp;#x2F;&amp;#x2F;portal.acm.org&amp;#x2F;citation.cfm?doid=503272.503282&lt;/a&gt; (this is the Boehm GC paper)&lt;p&gt;&lt;i&gt;jdk&amp;#x2F;src&amp;#x2F;java.base&amp;#x2F;share&amp;#x2F;classes&amp;#x2F;java&amp;#x2F;util&amp;#x2F;concurrent&amp;#x2F;locks&amp;#x2F;StampedLock.java:&lt;/i&gt; Design, verification and applications of a new read-write lock algorithm, Shirako et al, SPAA 2012&lt;p&gt;&lt;i&gt;hotspot&amp;#x2F;src&amp;#x2F;share&amp;#x2F;vm&amp;#x2F;opto&amp;#x2F;escape.hpp:&lt;/i&gt; Jong-Deok Shoi, Manish Gupta, Mauricio Seffano, Vugranam C. Sreedhar, Sam Midkiff: &amp;quot;Escape Analysis for Java&amp;quot;, Procedings of ACM SIGPLAN OOPSLA  Conference, November 1, 1999&lt;p&gt;&lt;i&gt;hotspot&amp;#x2F;src&amp;#x2F;share&amp;#x2F;vm&amp;#x2F;runtime&amp;#x2F;os.cpp:&lt;/i&gt; Gilad Bracha and David Ungar: &amp;quot;Mirrors: Design Principles for Meta-level Facilities of Object-Oriented Programming Languages&amp;quot;, in Proc. of the ACM Conf. on Object-Oriented Programming, Systems, Languages and Applications, October 2004&lt;p&gt;&lt;i&gt;jdk&amp;#x2F;src&amp;#x2F;jdk.crypto.ec&amp;#x2F;share&amp;#x2F;native&amp;#x2F;libsunec&amp;#x2F;impl&amp;#x2F;ec_naf.c:&lt;/i&gt; D. Hankerson, J. Hernandez and A. Menezes, &amp;quot;Software implementation of elliptic curve cryptography over binary fields&amp;quot;, Proc. CHES 2000&lt;p&gt;&lt;i&gt;jdk&amp;#x2F;src&amp;#x2F;java.base&amp;#x2F;share&amp;#x2F;classes&amp;#x2F;java&amp;#x2F;util&amp;#x2F;concurrent&amp;#x2F;SynchronousQueue.java:&lt;/i&gt; &amp;quot;Nonblocking Concurrent Objects with Condition Synchronization&amp;quot;, by W. N. Scherer III and M. L. Scott.  18th Annual Conf. on Distributed Computing, Oct. 2004</text><parent_chain></parent_chain></comment><story><title>List of scientific papers found in OpenJDK source code</title><url>http://lowlevelbits.org/java-papers/</url></story>