<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Hacker News: randomizedalgs</title><link>https://news.ycombinator.com/user?id=randomizedalgs</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Mon, 19 Oct 2026 21:53:21 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=randomizedalgs" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by randomizedalgs in "Containment and monitoring failures are to blame for AI hacking reports: experts"]]></title><description><![CDATA[
<p>Both can be true at once:
(1) AI agents <i>are</i> going rogue
(2) And labs are skipping security basics</p>
]]></description><pubDate>Wed, 14 Oct 2026 19:14:18 +0000</pubDate><link>https://news.ycombinator.com/item?id=50093352</link><dc:creator>randomizedalgs</dc:creator><comments>https://news.ycombinator.com/item?id=50093352</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=50093352</guid></item><item><title><![CDATA[New comment by randomizedalgs in "ArXiv's Updated Rate Limit Policy"]]></title><description><![CDATA[
<p>In theoretical computer science, at least, researchers plan their work to finish on three major deadlines a year (SODA, STOC, FOCS). STOC [1] is requiring all submissions to be uploaded to ArXiv before submission, and allows up to 5 submissions per author. I wonder if they'll change their policy or instead adopt an additional de-facto limit of two per submitter.<p>[1] STOC 2027 Call for Papers
<a href="https://acm-stoc.org/stoc2027/stoc2027-cfp.html" rel="nofollow">https://acm-stoc.org/stoc2027/stoc2027-cfp.html</a></p>
]]></description><pubDate>Fri, 02 Oct 2026 13:23:21 +0000</pubDate><link>https://news.ycombinator.com/item?id=49933277</link><dc:creator>randomizedalgs</dc:creator><comments>https://news.ycombinator.com/item?id=49933277</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49933277</guid></item><item><title><![CDATA[30% on AR-AGI-1 at $0.0007 per task]]></title><description><![CDATA[
<p>Article URL: <a href="https://arxiv.org/abs/2608.09888">https://arxiv.org/abs/2608.09888</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=49489813">https://news.ycombinator.com/item?id=49489813</a></p>
<p>Points: 3</p>
<p># Comments: 0</p>
]]></description><pubDate>Sat, 29 Aug 2026 13:35:49 +0000</pubDate><link>https://arxiv.org/abs/2608.09888</link><dc:creator>randomizedalgs</dc:creator><comments>https://news.ycombinator.com/item?id=49489813</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49489813</guid></item><item><title><![CDATA[New comment by randomizedalgs in "Why Erdős Problems Are Falling to AI"]]></title><description><![CDATA[
<p>Even the experts on the problem being solved find the writeups nearly impossible to read.<p>Example:
<a href="https://nitter.poast.org/henryquantum/status/2083623695436623915" rel="nofollow">https://nitter.poast.org/henryquantum/status/208362369543662...</a><p>Seems like a disservice to the community that openai put so little effort into producing good writeups...</p>
]]></description><pubDate>Wed, 05 Aug 2026 15:55:25 +0000</pubDate><link>https://news.ycombinator.com/item?id=49184638</link><dc:creator>randomizedalgs</dc:creator><comments>https://news.ycombinator.com/item?id=49184638</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49184638</guid></item><item><title><![CDATA[New comment by randomizedalgs in "Ten advances in mathematics and theoretical computer science"]]></title><description><![CDATA[
<p>After skimming some of the writeups, I'm surprised that the frontier internal model still writes just as poorly as Sol.<p>Maybe good AI paper writing is further away than I thought...</p>
]]></description><pubDate>Sun, 02 Aug 2026 06:25:28 +0000</pubDate><link>https://news.ycombinator.com/item?id=49141668</link><dc:creator>randomizedalgs</dc:creator><comments>https://news.ycombinator.com/item?id=49141668</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49141668</guid></item><item><title><![CDATA[New comment by randomizedalgs in "“Erdos problem #728 was solved more or less autonomously by AI”"]]></title><description><![CDATA[
<p>I'm an active researcher in TCS. For me, AI has not been very helpful on technical things (or even technical writing), but has been super helpful for (1) literature reviews; (2) editing papers (e.g., changing a convention everywhere in the paper); and (3) generating Tikz figures/animations.</p>
]]></description><pubDate>Sat, 10 Jan 2026 18:13:02 +0000</pubDate><link>https://news.ycombinator.com/item?id=46568323</link><dc:creator>randomizedalgs</dc:creator><comments>https://news.ycombinator.com/item?id=46568323</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46568323</guid></item><item><title><![CDATA[New comment by randomizedalgs in "NIH limits scientists to six applications per year"]]></title><description><![CDATA[
<p>For perspective, the CS programs in the NSF already have a two-submission limit per year [1].<p>Besides reducing the incentive to spam, this rule has had another positive effect: As a researcher without funding, you don't have to spend your whole year writing grants. You can, instead, spend your time on actual research.<p>With that said, NIH grants tend to me much more narrow than CS ones, and I imagine that it takes a lot more grants to keep a lab going...<p>[1] <a href="https://www.nsf.gov/funding/opportunities/computer-information-science-engineering-core-programs/nsf24-589/solicitation" rel="nofollow">https://www.nsf.gov/funding/opportunities/computer-informati...</a></p>
]]></description><pubDate>Mon, 21 Jul 2025 14:05:03 +0000</pubDate><link>https://news.ycombinator.com/item?id=44635246</link><dc:creator>randomizedalgs</dc:creator><comments>https://news.ycombinator.com/item?id=44635246</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44635246</guid></item><item><title><![CDATA[New comment by randomizedalgs in "H-1B program grew 81 percent from 2011 to 2022"]]></title><description><![CDATA[
<p>For perspective, in the same time period, The number of employees at Google multiplied by five. I wouldn't be surprised if the growth of the software industry, at least, actually outpaced the increase in H-1B visas.</p>
]]></description><pubDate>Fri, 18 Jul 2025 17:13:52 +0000</pubDate><link>https://news.ycombinator.com/item?id=44607280</link><dc:creator>randomizedalgs</dc:creator><comments>https://news.ycombinator.com/item?id=44607280</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44607280</guid></item><item><title><![CDATA[New comment by randomizedalgs in "H-1B program grew 81 percent from 2011 to 2022"]]></title><description><![CDATA[
<p>For perspective, in the same time period, The number of employees at Google multiplied by five. It seems likely that the number of highly educated positions, in general, increased by quite a bit during that time.</p>
]]></description><pubDate>Fri, 18 Jul 2025 17:12:57 +0000</pubDate><link>https://news.ycombinator.com/item?id=44607262</link><dc:creator>randomizedalgs</dc:creator><comments>https://news.ycombinator.com/item?id=44607262</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44607262</guid></item><item><title><![CDATA[New comment by randomizedalgs in "Geometric Search Trees"]]></title><description><![CDATA[
<p>Cool paper!<p>As a small comment, this seems closely related to another recent paper: History-Independent Dynamic Partitioning: Operation-Order Privacy in Ordered Data Structures (PODS 2024, Best Paper).<p>I'm not sure how they compare, since neither paper seems to know about the other. And I'm also not sure which paper came first, since the geometric search paper does not seem to post a publication date.</p>
]]></description><pubDate>Thu, 19 Sep 2024 13:13:49 +0000</pubDate><link>https://news.ycombinator.com/item?id=41591534</link><dc:creator>randomizedalgs</dc:creator><comments>https://news.ycombinator.com/item?id=41591534</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41591534</guid></item><item><title><![CDATA[New comment by randomizedalgs in "Big O Insights"]]></title><description><![CDATA[
<p>I don't think the claim is true in quite as much generality as the author claims. Some deterministic data structures use much more space than time, for example, the deterministic implementation of a Van Emde Boas tree.</p>
]]></description><pubDate>Wed, 13 Mar 2024 17:12:16 +0000</pubDate><link>https://news.ycombinator.com/item?id=39694283</link><dc:creator>randomizedalgs</dc:creator><comments>https://news.ycombinator.com/item?id=39694283</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=39694283</guid></item><item><title><![CDATA[New comment by randomizedalgs in "A visual interactive guide to Bloom filters"]]></title><description><![CDATA[
<p>Maybe quotient filters?</p>
]]></description><pubDate>Wed, 21 Feb 2024 00:13:25 +0000</pubDate><link>https://news.ycombinator.com/item?id=39448672</link><dc:creator>randomizedalgs</dc:creator><comments>https://news.ycombinator.com/item?id=39448672</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=39448672</guid></item><item><title><![CDATA[New comment by randomizedalgs in "Scientists find optimal space-time balance for hash tables"]]></title><description><![CDATA[
<p>I think you may have a backwards. Libcuckoo, CLHT, and TBB are widely used high performance C/C++ DRAM hash tables. I think TBB is the hash table Intel maintains, if I remember right.<p>So the DRAM experiments are apples to apples. It's actually the PMEM experiments, I think, that are comparing a new hash table on a new technology to previous hash tables that weren't designed specifically for that technology.</p>
]]></description><pubDate>Sun, 11 Feb 2024 13:05:05 +0000</pubDate><link>https://news.ycombinator.com/item?id=39334716</link><dc:creator>randomizedalgs</dc:creator><comments>https://news.ycombinator.com/item?id=39334716</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=39334716</guid></item><item><title><![CDATA[New comment by randomizedalgs in "Scientists find optimal space-time balance for hash tables"]]></title><description><![CDATA[
<p>I think these are more-often called "cache oblivious" algorithms</p>
]]></description><pubDate>Sat, 10 Feb 2024 04:53:56 +0000</pubDate><link>https://news.ycombinator.com/item?id=39323707</link><dc:creator>randomizedalgs</dc:creator><comments>https://news.ycombinator.com/item?id=39323707</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=39323707</guid></item><item><title><![CDATA[New comment by randomizedalgs in "Scientists find optimal space-time balance for hash tables"]]></title><description><![CDATA[
<p>IcebergHT isn't just for persistent memory (although I can see why you might think it is based on the paper's title). The paper also gives experiments showing that the hash table performs very well in standard RAM, much better than other concurrent implementations.</p>
]]></description><pubDate>Sat, 10 Feb 2024 04:50:48 +0000</pubDate><link>https://news.ycombinator.com/item?id=39323693</link><dc:creator>randomizedalgs</dc:creator><comments>https://news.ycombinator.com/item?id=39323693</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=39323693</guid></item><item><title><![CDATA[New comment by randomizedalgs in "Efficient parallelization of an ubiquitous sequential computation"]]></title><description><![CDATA[
<p>As a super minor grammar point for the author, "ubiquitous" is a rare example of a word that starts with a vowel but should be proceeded by "a" instead of "an".</p>
]]></description><pubDate>Thu, 07 Dec 2023 17:32:44 +0000</pubDate><link>https://news.ycombinator.com/item?id=38559232</link><dc:creator>randomizedalgs</dc:creator><comments>https://news.ycombinator.com/item?id=38559232</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=38559232</guid></item><item><title><![CDATA[New comment by randomizedalgs in "The Dunning-Kruger effect is autocorrelation"]]></title><description><![CDATA[
<p>Consider the imaginary world that the author describes, in which people's estimate of their score is independent of their actual score. Wouldn't it be fair to say that, in this imaginary world, the DK effect is real?<p>The point of the effect is that people who score low tend to overestimate their score and people who score high tend to underestimate. Of course there are lots of rational reasons why this could occur (including the toy example the author gave, where nobody has any good sense of what their score will be), but the phenomenon appears to me to be correct.</p>
]]></description><pubDate>Sat, 25 Nov 2023 21:36:02 +0000</pubDate><link>https://news.ycombinator.com/item?id=38416917</link><dc:creator>randomizedalgs</dc:creator><comments>https://news.ycombinator.com/item?id=38416917</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=38416917</guid></item><item><title><![CDATA[New comment by randomizedalgs in "The Simplest Interesting Algorithm (2019)"]]></title><description><![CDATA[
<p>The randomized version of this algorithm is also fun: repeatedly find an edge that is not yet covered, select one of the two end points at <i>random</i>, and add it to S.<p>It's a nice exercise to show that the randomized algorithm is also a 2-approximate algorithm, i.e., the size of S is at most twice the size of S_{OPT}, in expectation.</p>
]]></description><pubDate>Mon, 13 Dec 2021 21:29:55 +0000</pubDate><link>https://news.ycombinator.com/item?id=29544918</link><dc:creator>randomizedalgs</dc:creator><comments>https://news.ycombinator.com/item?id=29544918</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=29544918</guid></item><item><title><![CDATA[The Simplest Interesting Algorithm (2019)]]></title><description><![CDATA[
<p>Article URL: <a href="https://algorithmsoup.wordpress.com/2019/10/25/the-worlds-simplest-interesting-algorithm/">https://algorithmsoup.wordpress.com/2019/10/25/the-worlds-simplest-interesting-algorithm/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=29544858">https://news.ycombinator.com/item?id=29544858</a></p>
<p>Points: 2</p>
<p># Comments: 2</p>
]]></description><pubDate>Mon, 13 Dec 2021 21:25:06 +0000</pubDate><link>https://algorithmsoup.wordpress.com/2019/10/25/the-worlds-simplest-interesting-algorithm/</link><dc:creator>randomizedalgs</dc:creator><comments>https://news.ycombinator.com/item?id=29544858</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=29544858</guid></item><item><title><![CDATA[New comment by randomizedalgs in "Toyota owners have to pay $8/month to keep using their key fob for remote start"]]></title><description><![CDATA[
<p>This is a classic example of price discrimination. Slowly but surely, companies such as Toyota will converge to a state where every consumer individually pays the maximum amount that the consumer is willing to pay for the product.<p>$8 a month may not seem like much compared to the cost of a car, but that's the point. Toyota will be able to get free extra money from a large population of people (many of whom will later barely even remember that they are incurring this regular cost).</p>
]]></description><pubDate>Mon, 13 Dec 2021 21:21:23 +0000</pubDate><link>https://news.ycombinator.com/item?id=29544806</link><dc:creator>randomizedalgs</dc:creator><comments>https://news.ycombinator.com/item?id=29544806</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=29544806</guid></item></channel></rss>