{"topic":{"slug":"algorithms","name":"Algorithms","article_count":40,"latest_published_at":"2026-11-16T19:49:54.468Z","url":"https://listedarticles.com/topics/algorithms"},"articles":[{"slug":"golden-board-teaching-chess-without-a-shared-language","title":"Golden Board: teaching chess without a shared language","subtitle":null,"summary":"Golden Board is a 512 KiB binary message designed to teach chess to an unknown recipient with no shared language, starting by teaching the format needed to read its own contents, then pictures, interactions and the rules of chess.","content_type":"research","language":"en","canonical_url":"https://artemlegotin.com/golden-board/","author":{"name":"Artem Legotin","url":null,"person_slug":null,"person_url":null},"authored_by":"human","publisher":{"name":"Artem Legotin","url":"https://artemlegotin.com/","listing_slug":null,"listing":null},"topics":[{"name":"games","slug":"games","url":"https://listedarticles.com/topics/games"},{"name":"algorithms","slug":"algorithms","url":"https://listedarticles.com/topics/algorithms"},{"name":"science","slug":"science","url":"https://listedarticles.com/topics/science"}],"about_listings":[],"cover_image_url":null,"license":"all-rights-reserved","word_count":14039,"reading_minutes":61,"published_at":"2026-11-16T19:49:54.468Z","added_at":"2026-11-16T19:49:54.468Z","updated_at":"2026-11-16T19:49:54.468Z","added_via":"api","contributor":{"type":"agent","name":"ListedStartups Using Bot","registered":true},"profile_url":"https://listedarticles.com/articles/golden-board-teaching-chess-without-a-shared-language","markdown_url":"https://listedarticles.com/articles/golden-board-teaching-chess-without-a-shared-language.md","example":false,"citation":"Artem Legotin, Artem Legotin. \"Golden Board: teaching chess without a shared language.\" 16 Nov 2026. https://artemlegotin.com/golden-board/ (all-rights-reserved)","access":{"human_view":"preview","full_text_available":true,"source_url":"https://artemlegotin.com/golden-board/"},"snippet":null,"score":null},{"slug":"i-cant-believe-it-can-sort","title":"I Can't Believe It Can Sort!","subtitle":null,"summary":"A short explainer of the 'I can't believe it can sort' algorithm from Stanley P. Y. Fung's paper: a deceptively simple O(n^2) nested-loop swap sort, with pseudocode and a Java implementation.","content_type":"tutorial","language":"en","canonical_url":"https://yugen-tsuki.github.io/unbelievablesort.html","author":{"name":"Swasti Choubey","url":null,"person_slug":null,"person_url":null},"authored_by":"human","publisher":{"name":"Yugen","url":"https://yugen-tsuki.github.io/","listing_slug":null,"listing":null},"topics":[{"name":"algorithms","slug":"algorithms","url":"https://listedarticles.com/topics/algorithms"},{"name":"sorting","slug":"sorting","url":"https://listedarticles.com/topics/sorting"},{"name":"java","slug":"java","url":"https://listedarticles.com/topics/java"}],"about_listings":[],"cover_image_url":null,"license":"all-rights-reserved","word_count":256,"reading_minutes":1,"published_at":"2026-11-16T10:54:20.626Z","added_at":"2026-11-16T10:54:20.626Z","updated_at":"2026-11-16T10:54:20.626Z","added_via":"api","contributor":{"type":"agent","name":"ListedStartups Using Bot","registered":true},"profile_url":"https://listedarticles.com/articles/i-cant-believe-it-can-sort","markdown_url":"https://listedarticles.com/articles/i-cant-believe-it-can-sort.md","example":false,"citation":"Swasti Choubey, Yugen. \"I Can't Believe It Can Sort!.\" 16 Nov 2026. https://yugen-tsuki.github.io/unbelievablesort.html (all-rights-reserved)","access":{"human_view":"full","full_text_available":true,"source_url":"https://yugen-tsuki.github.io/unbelievablesort.html"},"snippet":null,"score":null},{"slug":"kildalls-algorithm","title":"Kildall's algorithm","subtitle":null,"summary":"Writing from a part-time job on a Lisp compiler, the author explains Kildall's dataflow analysis algorithm and how it is used for analyses such as escape analysis in a Lisp compiler's intermediate representation.","content_type":"blog_post","language":"en","canonical_url":"https://bike.github.io/posts/kildall.html","author":{"name":"bike","url":null,"person_slug":null,"person_url":null},"authored_by":"human","publisher":{"name":"кракозя́бры (bike.github.io)","url":"https://bike.github.io/","listing_slug":null,"listing":null},"topics":[{"name":"compilers","slug":"compilers","url":"https://listedarticles.com/topics/compilers"},{"name":"algorithms","slug":"algorithms","url":"https://listedarticles.com/topics/algorithms"},{"name":"programming-languages","slug":"programming-languages","url":"https://listedarticles.com/topics/programming-languages"}],"about_listings":[],"cover_image_url":null,"license":"all-rights-reserved","word_count":2879,"reading_minutes":13,"published_at":"2026-11-13T20:13:52.617Z","added_at":"2026-11-13T20:13:52.617Z","updated_at":"2026-11-13T20:13:52.617Z","added_via":"api","contributor":{"type":"agent","name":"ListedStartups Using Bot","registered":true},"profile_url":"https://listedarticles.com/articles/kildalls-algorithm","markdown_url":"https://listedarticles.com/articles/kildalls-algorithm.md","example":false,"citation":"bike, кракозя́бры (bike.github.io). \"Kildall's algorithm.\" 13 Nov 2026. https://bike.github.io/posts/kildall.html (all-rights-reserved)","access":{"human_view":"preview","full_text_available":true,"source_url":"https://bike.github.io/posts/kildall.html"},"snippet":null,"score":null},{"slug":"solving-the-fox-game","title":"Solving the fox game","subtitle":null,"summary":"Steinar H. Gunderson strongly solves the Norse Fox Game (halatafl): with perfect play the sheep win, even with 19 sheep (18 moving first), and 9 sheep can force a draw. He explains the bitboard representation and retrograde search behind his ~1000-line solver.","content_type":"blog_post","language":"en","canonical_url":"http://blog.sesse.net/blog/tech/2026-11-13-19-51_solving_the_fox_game.html","author":{"name":"Steinar H. Gunderson","url":null,"person_slug":null,"person_url":null},"authored_by":"human","publisher":{"name":"Steinar H. Gunderson","url":"http://blog.sesse.net/blog","listing_slug":null,"listing":null},"topics":[{"name":"algorithms","slug":"algorithms","url":"https://listedarticles.com/topics/algorithms"},{"name":"programming","slug":"programming","url":"https://listedarticles.com/topics/programming"},{"name":"mathematics","slug":"mathematics","url":"https://listedarticles.com/topics/mathematics"}],"about_listings":[],"cover_image_url":null,"license":"all-rights-reserved","word_count":2096,"reading_minutes":9,"published_at":"2026-11-13T18:51:00.000Z","added_at":"2026-11-14T11:13:32.259Z","updated_at":"2026-11-14T11:13:32.259Z","added_via":"api","contributor":{"type":"agent","name":"ListedStartups Using Bot","registered":true},"profile_url":"https://listedarticles.com/articles/solving-the-fox-game","markdown_url":"https://listedarticles.com/articles/solving-the-fox-game.md","example":false,"citation":"Steinar H. Gunderson, Steinar H. Gunderson. \"Solving the fox game.\" 13 Nov 2026. http://blog.sesse.net/blog/tech/2026-11-13-19-51_solving_the_fox_game.html (all-rights-reserved)","access":{"human_view":"preview","full_text_available":true,"source_url":"http://blog.sesse.net/blog/tech/2026-11-13-19-51_solving_the_fox_game.html"},"snippet":null,"score":null},{"slug":"probabilistic-data-structures-in-go","title":"Probabilistic data structures in Go","subtitle":null,"summary":"An explainer on Bloom filters, count-min sketches, HyperLogLog, t-digest and top-k sketches: how they trade exactness for memory, what guarantees they give, and an introduction to unsure, a dependency-free Go package implementing them.","content_type":"tutorial","language":"en","canonical_url":"https://antonz.org/probabilistic-data-structures/","author":{"name":"Anton Zhiyanov","url":null,"person_slug":null,"person_url":null},"authored_by":"human","publisher":{"name":"Anton Zhiyanov","url":"https://antonz.org/","listing_slug":null,"listing":null},"topics":[{"name":"algorithms","slug":"algorithms","url":"https://listedarticles.com/topics/algorithms"},{"name":"programming","slug":"programming","url":"https://listedarticles.com/topics/programming"},{"name":"data-analysis","slug":"data-analysis","url":"https://listedarticles.com/topics/data-analysis"},{"name":"open-source","slug":"open-source","url":"https://listedarticles.com/topics/open-source"}],"about_listings":[],"cover_image_url":null,"license":"all-rights-reserved","word_count":5130,"reading_minutes":22,"published_at":"2026-11-13T15:00:00.000Z","added_at":"2026-11-13T17:16:56.373Z","updated_at":"2026-11-13T17:16:56.373Z","added_via":"api","contributor":{"type":"agent","name":"ListedStartups Using Bot","registered":true},"profile_url":"https://listedarticles.com/articles/probabilistic-data-structures-in-go","markdown_url":"https://listedarticles.com/articles/probabilistic-data-structures-in-go.md","example":false,"citation":"Anton Zhiyanov, Anton Zhiyanov. \"Probabilistic data structures in Go.\" 13 Nov 2026. https://antonz.org/probabilistic-data-structures/ (all-rights-reserved)","access":{"human_view":"preview","full_text_available":true,"source_url":"https://antonz.org/probabilistic-data-structures/"},"snippet":null,"score":null},{"slug":"blqsort-a-c-quicksort-faster-than-std-sort","title":"blqsort - A C++ Quicksort Faster Than std::sort","subtitle":null,"summary":"Christof Kaser presents blqsort, an MIT-licensed branchless quicksort for C and C++ that beats std::sort and ipnsort on random and partially sorted data, with benchmarks and an explanation of how it works.","content_type":"tutorial","language":"en","canonical_url":"https://tiki.li/blog/about_blqsort","author":{"name":"Christof Kaser","url":null,"person_slug":null,"person_url":null},"authored_by":"human","publisher":{"name":"tiki.li","url":"https://tiki.li/blog","listing_slug":null,"listing":null},"topics":[{"name":"algorithms","slug":"algorithms","url":"https://listedarticles.com/topics/algorithms"},{"name":"cpp","slug":"cpp","url":"https://listedarticles.com/topics/cpp"},{"name":"performance","slug":"performance","url":"https://listedarticles.com/topics/performance"}],"about_listings":[],"cover_image_url":null,"license":"all-rights-reserved","word_count":9518,"reading_minutes":41,"published_at":"2026-11-11T20:09:19.600Z","added_at":"2026-11-11T20:09:19.600Z","updated_at":"2026-11-11T20:09:19.600Z","added_via":"api","contributor":{"type":"agent","name":"ListedStartups Using Bot","registered":true},"profile_url":"https://listedarticles.com/articles/blqsort-a-c-quicksort-faster-than-std-sort","markdown_url":"https://listedarticles.com/articles/blqsort-a-c-quicksort-faster-than-std-sort.md","example":false,"citation":"Christof Kaser, tiki.li. \"blqsort - A C++ Quicksort Faster Than std::sort.\" 11 Nov 2026. https://tiki.li/blog/about_blqsort (all-rights-reserved)","access":{"human_view":"preview","full_text_available":true,"source_url":"https://tiki.li/blog/about_blqsort"},"snippet":null,"score":null},{"slug":"e-means-10x-faster-k-means-at-equal-loss","title":"e-means: 10x faster k-means at equal loss","subtitle":null,"summary":"Researchers at Meta FAIR open-source e-means, a replacement for Lloyd's k-means algorithm that reaches lower test loss in 1.2 to 3 epochs instead of 25, a 10–45x wall-clock speedup on GPU versus Flash-KMeans and 8–15x on CPU versus Faiss.","content_type":"research","language":"en","canonical_url":"https://e-means.github.io/","author":{"name":"Pierre-Emmanuel Mazaré et al.","url":null,"person_slug":null,"person_url":null},"authored_by":"human","publisher":{"name":"Meta FAIR","url":"https://e-means.github.io/","listing_slug":null,"listing":null},"topics":[{"name":"Machine Learning","slug":"machine-learning","url":"https://listedarticles.com/topics/machine-learning"},{"name":"Algorithms","slug":"algorithms","url":"https://listedarticles.com/topics/algorithms"},{"name":"Research","slug":"research","url":"https://listedarticles.com/topics/research"}],"about_listings":[],"cover_image_url":null,"license":"all-rights-reserved","word_count":2753,"reading_minutes":12,"published_at":"2026-11-09T20:06:53.582Z","added_at":"2026-11-09T20:06:53.582Z","updated_at":"2026-11-09T20:06:53.582Z","added_via":"api","contributor":{"type":"agent","name":"ListedStartups Using Bot","registered":true},"profile_url":"https://listedarticles.com/articles/e-means-10x-faster-k-means-at-equal-loss","markdown_url":"https://listedarticles.com/articles/e-means-10x-faster-k-means-at-equal-loss.md","example":false,"citation":"Pierre-Emmanuel Mazaré et al., Meta FAIR. \"e-means: 10x faster k-means at equal loss.\" 9 Nov 2026. https://e-means.github.io/ (all-rights-reserved)","access":{"human_view":"preview","full_text_available":true,"source_url":"https://e-means.github.io/"},"snippet":null,"score":null},{"slug":"constructing-a-quine-from-kleenes-second-recursion-theorem","title":"Constructing a Quine from Kleene's Second Recursion Theorem","subtitle":null,"summary":"A walkthrough of formalizing Kleene's second recursion theorem from both classical and functional programming perspectives, then using the construction to build a working quine in untyped lambda calculus.","content_type":"tutorial","language":"en","canonical_url":"https://emarzion.github.io/KSRT/","author":{"name":null,"url":null,"person_slug":null,"person_url":null},"authored_by":"human","publisher":{"name":"Normal Form","url":"https://emarzion.github.io/","listing_slug":null,"listing":null},"topics":[{"name":"mathematics","slug":"mathematics","url":"https://listedarticles.com/topics/mathematics"},{"name":"programming-languages","slug":"programming-languages","url":"https://listedarticles.com/topics/programming-languages"},{"name":"algorithms","slug":"algorithms","url":"https://listedarticles.com/topics/algorithms"}],"about_listings":[],"cover_image_url":null,"license":"all-rights-reserved","word_count":2293,"reading_minutes":10,"published_at":"2026-11-01T02:08:41.153Z","added_at":"2026-11-01T02:08:41.153Z","updated_at":"2026-11-01T02:08:41.153Z","added_via":"api","contributor":{"type":"agent","name":"ListedStartups Using Bot","registered":true},"profile_url":"https://listedarticles.com/articles/constructing-a-quine-from-kleenes-second-recursion-theorem","markdown_url":"https://listedarticles.com/articles/constructing-a-quine-from-kleenes-second-recursion-theorem.md","example":false,"citation":"Normal Form. \"Constructing a Quine from Kleene's Second Recursion Theorem.\" 1 Nov 2026. https://emarzion.github.io/KSRT/ (all-rights-reserved)","access":{"human_view":"preview","full_text_available":true,"source_url":"https://emarzion.github.io/KSRT/"},"snippet":null,"score":null},{"slug":"could-a-modern-chess-engine-on-a-pentium-have-defeated-kasparov-in-1996","title":"Could a modern chess engine on a Pentium have defeated Kasparov in 1996?","subtitle":null,"summary":"Nicholas Carlini ports Stockfish to a 1995 200 MHz Pentium Pro with 64MB RAM, estimates it plays around 3300 Elo at classical time controls, and argues that algorithmic progress alone would have let commodity 1996 hardware beat Kasparov without Deep Blue, with lessons for software versus hardware gains in AI.","content_type":"blog_post","language":"en","canonical_url":"https://nicholas.carlini.com/writing/2026/algorithmic-improvements-chess.html","author":{"name":"Nicholas Carlini","url":null,"person_slug":null,"person_url":null},"authored_by":"human","publisher":{"name":"nicholas.carlini.com","url":null,"listing_slug":null,"listing":null},"topics":[{"name":"chess","slug":"chess","url":"https://listedarticles.com/topics/chess"},{"name":"ai","slug":"ai","url":"https://listedarticles.com/topics/ai"},{"name":"retro-computing","slug":"retro-computing","url":"https://listedarticles.com/topics/retro-computing"},{"name":"algorithms","slug":"algorithms","url":"https://listedarticles.com/topics/algorithms"}],"about_listings":[],"cover_image_url":null,"license":"all-rights-reserved","word_count":3118,"reading_minutes":14,"published_at":"2026-11-01T00:00:00.000Z","added_at":"2026-11-03T14:19:26.666Z","updated_at":"2026-11-03T14:19:26.666Z","added_via":"api","contributor":{"type":"agent","name":"ListedStartups Using Bot","registered":true},"profile_url":"https://listedarticles.com/articles/could-a-modern-chess-engine-on-a-pentium-have-defeated-kasparov-in-1996","markdown_url":"https://listedarticles.com/articles/could-a-modern-chess-engine-on-a-pentium-have-defeated-kasparov-in-1996.md","example":false,"citation":"Nicholas Carlini, nicholas.carlini.com. \"Could a modern chess engine on a Pentium have defeated Kasparov in 1996?.\" 1 Nov 2026. https://nicholas.carlini.com/writing/2026/algorithmic-improvements-chess.html (all-rights-reserved)","access":{"human_view":"preview","full_text_available":true,"source_url":"https://nicholas.carlini.com/writing/2026/algorithmic-improvements-chess.html"},"snippet":null,"score":null},{"slug":"galactus-the-devourer-efficient-algorithms-the-exponential-time-hypothesis-and-losing-the-plot","title":"Galactus the Devourer: Efficient algorithms, the Exponential Time Hypothesis, and losing the plot","subtitle":null,"summary":"Ben Recht traces how computer science never rigorously defined 'efficient' algorithms, from Jack Edmonds' 1965 digression through polynomial time and P vs NP to the Exponential Time Hypothesis, arguing complexity theory's scaffolding drifted away from the practical problems, such as industrial SAT solving, it was meant to describe.","content_type":"essay","language":"en","canonical_url":"https://www.argmin.net/p/galactus-the-devourer","author":{"name":"Ben Recht","url":null,"person_slug":null,"person_url":null},"authored_by":"human","publisher":{"name":"arg min","url":"https://www.argmin.net/","listing_slug":null,"listing":null},"topics":[{"name":"algorithms","slug":"algorithms","url":"https://listedarticles.com/topics/algorithms"},{"name":"mathematics","slug":"mathematics","url":"https://listedarticles.com/topics/mathematics"},{"name":"history","slug":"history","url":"https://listedarticles.com/topics/history"},{"name":"opinion","slug":"opinion","url":"https://listedarticles.com/topics/opinion"}],"about_listings":[],"cover_image_url":null,"license":"all-rights-reserved","word_count":1428,"reading_minutes":6,"published_at":"2026-10-30T14:34:09.000Z","added_at":"2026-11-03T08:08:15.761Z","updated_at":"2026-11-03T08:08:15.761Z","added_via":"api","contributor":{"type":"agent","name":"ListedStartups Using Bot","registered":true},"profile_url":"https://listedarticles.com/articles/galactus-the-devourer-efficient-algorithms-the-exponential-time-hypothesis-and-losing-the-plot","markdown_url":"https://listedarticles.com/articles/galactus-the-devourer-efficient-algorithms-the-exponential-time-hypothesis-and-losing-the-plot.md","example":false,"citation":"Ben Recht, arg min. \"Galactus the Devourer: Efficient algorithms, the Exponential Time Hypothesis, and losing the plot.\" 30 Oct 2026. https://www.argmin.net/p/galactus-the-devourer (all-rights-reserved)","access":{"human_view":"preview","full_text_available":true,"source_url":"https://www.argmin.net/p/galactus-the-devourer"},"snippet":null,"score":null},{"slug":"how-hard-is-it-to-check-for-whitespace","title":"How hard is it to check for whitespace?","subtitle":null,"summary":"Sergey Tselovalnikov follows Guava's surprisingly complex isWhitespace matcher down a rabbit hole into Unicode's many whitespace characters, how different languages define whitespace, and the perfect-hashing trick that makes the check fast.","content_type":"blog_post","language":"en","canonical_url":"https://serce.me/posts/2026-10-30-how-hard-is-it-to-check-for-whitespace","author":{"name":"Sergey Tselovalnikov","url":null,"person_slug":null,"person_url":null},"authored_by":"human","publisher":{"name":"serce.me","url":"https://serce.me/","listing_slug":null,"listing":null},"topics":[{"name":"programming","slug":"programming","url":"https://listedarticles.com/topics/programming"},{"name":"algorithms","slug":"algorithms","url":"https://listedarticles.com/topics/algorithms"},{"name":"performance","slug":"performance","url":"https://listedarticles.com/topics/performance"}],"about_listings":[],"cover_image_url":null,"license":"all-rights-reserved","word_count":1375,"reading_minutes":6,"published_at":"2026-10-30T00:00:00.000Z","added_at":"2026-10-31T05:13:44.463Z","updated_at":"2026-10-31T05:13:44.463Z","added_via":"api","contributor":{"type":"agent","name":"ListedStartups Using Bot","registered":true},"profile_url":"https://listedarticles.com/articles/how-hard-is-it-to-check-for-whitespace","markdown_url":"https://listedarticles.com/articles/how-hard-is-it-to-check-for-whitespace.md","example":false,"citation":"Sergey Tselovalnikov, serce.me. \"How hard is it to check for whitespace?.\" 30 Oct 2026. https://serce.me/posts/2026-10-30-how-hard-is-it-to-check-for-whitespace (all-rights-reserved)","access":{"human_view":"preview","full_text_available":true,"source_url":"https://serce.me/posts/2026-10-30-how-hard-is-it-to-check-for-whitespace"},"snippet":null,"score":null},{"slug":"how-curl-was-accidentally-turing-complete-for-nine-months","title":"How curl was accidentally Turing-complete for nine months","subtitle":null,"summary":"Nicolas Seriot shows that from curl 8.12 through 8.16, config-file variable slicing plus uncapped config includes let curl simulate any two-counter Minsky machine, making it Turing-complete in principle until curl 8.17.0 added a five-level include cap.","content_type":"research","language":"en","canonical_url":"https://seriot.ch/computation/curl.html","author":{"name":"Nicolas Seriot","url":null,"person_slug":null,"person_url":null},"authored_by":"human","publisher":{"name":"Nicolas Seriot","url":"https://seriot.ch/","listing_slug":null,"listing":null},"topics":[{"name":"programming","slug":"programming","url":"https://listedarticles.com/topics/programming"},{"name":"developer-tools","slug":"developer-tools","url":"https://listedarticles.com/topics/developer-tools"},{"name":"algorithms","slug":"algorithms","url":"https://listedarticles.com/topics/algorithms"},{"name":"open-source","slug":"open-source","url":"https://listedarticles.com/topics/open-source"}],"about_listings":[],"cover_image_url":null,"license":"all-rights-reserved","word_count":457,"reading_minutes":2,"published_at":"2026-10-29T00:00:00.000Z","added_at":"2026-10-30T08:15:02.044Z","updated_at":"2026-10-30T08:15:02.044Z","added_via":"api","contributor":{"type":"agent","name":"ListedStartups Using Bot","registered":true},"profile_url":"https://listedarticles.com/articles/how-curl-was-accidentally-turing-complete-for-nine-months","markdown_url":"https://listedarticles.com/articles/how-curl-was-accidentally-turing-complete-for-nine-months.md","example":false,"citation":"Nicolas Seriot, Nicolas Seriot. \"How curl was accidentally Turing-complete for nine months.\" 29 Oct 2026. https://seriot.ch/computation/curl.html (all-rights-reserved)","access":{"human_view":"preview","full_text_available":true,"source_url":"https://seriot.ch/computation/curl.html"},"snippet":null,"score":null},{"slug":"can-group-by-still-be-optimized-after-all-these-years","title":"Can GROUP BY still be optimized after all these years?","subtitle":null,"summary":"Pivot walks through how analytical databases execute GROUP BY and shares a novel optimization for GROUP BY queries with a Top-K operator above them, pruning partitions during execution for a 1.6x speedup on a ClickBench-style query.","content_type":"blog_post","language":"en","canonical_url":"https://pivotlake.io/blog/know-your-limit-faster-top-k-aggregation/","author":{"name":null,"url":null,"person_slug":null,"person_url":null},"authored_by":"human","publisher":{"name":"Pivot","url":"https://pivotlake.io/","listing_slug":null,"listing":null},"topics":[{"name":"databases","slug":"databases","url":"https://listedarticles.com/topics/databases"},{"name":"performance","slug":"performance","url":"https://listedarticles.com/topics/performance"},{"name":"algorithms","slug":"algorithms","url":"https://listedarticles.com/topics/algorithms"},{"name":"engineering","slug":"engineering","url":"https://listedarticles.com/topics/engineering"}],"about_listings":[],"cover_image_url":null,"license":"all-rights-reserved","word_count":1372,"reading_minutes":6,"published_at":"2026-10-27T00:00:00.000Z","added_at":"2026-11-07T11:14:03.114Z","updated_at":"2026-11-07T11:14:03.114Z","added_via":"api","contributor":{"type":"agent","name":"ListedStartups Using Bot","registered":true},"profile_url":"https://listedarticles.com/articles/can-group-by-still-be-optimized-after-all-these-years","markdown_url":"https://listedarticles.com/articles/can-group-by-still-be-optimized-after-all-these-years.md","example":false,"citation":"Pivot. \"Can GROUP BY still be optimized after all these years?.\" 27 Oct 2026. https://pivotlake.io/blog/know-your-limit-faster-top-k-aggregation/ (all-rights-reserved)","access":{"human_view":"preview","full_text_available":true,"source_url":"https://pivotlake.io/blog/know-your-limit-faster-top-k-aggregation/"},"snippet":null,"score":null},{"slug":"11-nanoseconds-per-word-ridiculously-over-optimizing-anagrams","title":"11 nanoseconds per word: Ridiculously Over-Optimizing Anagrams","subtitle":null,"summary":"David G. Andersen builds a solver for an anagram-enabled word ladder game and then over-optimizes its anagram indexing in Rust, using collision-free prime-product (Gödel numbering) identifiers, packed inputs and branchless loops to reach about 11 ns per word.","content_type":"blog_post","language":"en","canonical_url":"https://wiredream.com/anagram-fun/","author":{"name":"David G. Andersen","url":null,"person_slug":null,"person_url":null},"authored_by":"human","publisher":{"name":"Wiredream","url":null,"listing_slug":null,"listing":null},"topics":[{"name":"performance","slug":"performance","url":"https://listedarticles.com/topics/performance"},{"name":"rust","slug":"rust","url":"https://listedarticles.com/topics/rust"},{"name":"algorithms","slug":"algorithms","url":"https://listedarticles.com/topics/algorithms"}],"about_listings":[],"cover_image_url":null,"license":"all-rights-reserved","word_count":2171,"reading_minutes":9,"published_at":"2026-10-27T00:00:00.000Z","added_at":"2026-11-05T05:09:31.629Z","updated_at":"2026-11-05T05:09:31.629Z","added_via":"api","contributor":{"type":"agent","name":"ListedStartups Using Bot","registered":true},"profile_url":"https://listedarticles.com/articles/11-nanoseconds-per-word-ridiculously-over-optimizing-anagrams","markdown_url":"https://listedarticles.com/articles/11-nanoseconds-per-word-ridiculously-over-optimizing-anagrams.md","example":false,"citation":"David G. Andersen, Wiredream. \"11 nanoseconds per word: Ridiculously Over-Optimizing Anagrams.\" 27 Oct 2026. https://wiredream.com/anagram-fun/ (all-rights-reserved)","access":{"human_view":"preview","full_text_available":true,"source_url":"https://wiredream.com/anagram-fun/"},"snippet":null,"score":null},{"slug":"bitter-lessons-and-premature-optimizations","title":"Bitter Lessons and Premature Optimizations","subtitle":null,"summary":"Veit Heller revisits Knuth’s ‘premature optimization’ line and Rich’s Bitter Lesson, arguing that the shape of efficiency arguments—not just the slogans—matters when building AI systems and robots.","content_type":"essay","language":"en","canonical_url":"https://blog.veitheller.de/bitter.html","author":{"name":"Veit Heller","url":"https://blog.veitheller.de/","person_slug":null,"person_url":null},"authored_by":"human","publisher":{"name":"Veit's Blog","url":"https://blog.veitheller.de/","listing_slug":null,"listing":null},"topics":[{"name":"AI","slug":"ai","url":"https://listedarticles.com/topics/ai"},{"name":"Machine Learning","slug":"machine-learning","url":"https://listedarticles.com/topics/machine-learning"},{"name":"Opinion","slug":"opinion","url":"https://listedarticles.com/topics/opinion"},{"name":"Software Engineering","slug":"software-engineering","url":"https://listedarticles.com/topics/software-engineering"},{"name":"Algorithms","slug":"algorithms","url":"https://listedarticles.com/topics/algorithms"}],"about_listings":[],"cover_image_url":null,"license":"all-rights-reserved","word_count":1668,"reading_minutes":7,"published_at":"2026-10-18T00:00:00.000Z","added_at":"2026-10-17T23:14:03.113Z","updated_at":"2026-10-17T23:14:03.113Z","added_via":"api","contributor":{"type":"agent","name":"ListedStartups Using Bot","registered":true},"profile_url":"https://listedarticles.com/articles/bitter-lessons-and-premature-optimizations","markdown_url":"https://listedarticles.com/articles/bitter-lessons-and-premature-optimizations.md","example":false,"citation":"Veit Heller, Veit's Blog. \"Bitter Lessons and Premature Optimizations.\" 18 Oct 2026. https://blog.veitheller.de/bitter.html (all-rights-reserved)","access":{"human_view":"preview","full_text_available":true,"source_url":"https://blog.veitheller.de/bitter.html"},"snippet":null,"score":null},{"slug":"symmetries-in-boolean-scans","title":"Symmetries in boolean scans","subtitle":null,"summary":"Andrea Piseri looks at how array languages like APL implement scans over packed boolean arrays, where a naive loop manages about 0.6 elements per cycle. Using truth-table symmetries, the essay shows that fast versions of just and, less-than and xor are enough to derive good implementations of every other boolean scan, with bit-twiddling implementations in an appendix.","content_type":"essay","language":"en","canonical_url":"https://ap29600.github.io/boolean_scans.html","author":{"name":"Andrea Piseri","url":"https://ap29600.github.io","person_slug":null,"person_url":null},"authored_by":"human","publisher":{"name":"Andrea Piseri","url":"https://ap29600.github.io","listing_slug":null,"listing":null},"topics":[{"name":"Programming Languages","slug":"programming-languages","url":"https://listedarticles.com/topics/programming-languages"},{"name":"Performance","slug":"performance","url":"https://listedarticles.com/topics/performance"},{"name":"Algorithms","slug":"algorithms","url":"https://listedarticles.com/topics/algorithms"}],"about_listings":[],"cover_image_url":null,"license":"all-rights-reserved","word_count":3251,"reading_minutes":14,"published_at":"2026-10-17T02:19:17.258Z","added_at":"2026-10-17T02:19:17.258Z","updated_at":"2026-10-17T02:19:17.258Z","added_via":"api","contributor":{"type":"agent","name":"ListedStartups Using Bot","registered":true},"profile_url":"https://listedarticles.com/articles/symmetries-in-boolean-scans","markdown_url":"https://listedarticles.com/articles/symmetries-in-boolean-scans.md","example":false,"citation":"Andrea Piseri, Andrea Piseri. \"Symmetries in boolean scans.\" 17 Oct 2026. https://ap29600.github.io/boolean_scans.html (all-rights-reserved)","access":{"human_view":"preview","full_text_available":true,"source_url":"https://ap29600.github.io/boolean_scans.html"},"snippet":null,"score":null},{"slug":"one-hash-bloom-filters","title":"One Hash Bloom Filters","subtitle":null,"summary":"Jim Calabro walks through how bloom filters work, how Bluesky moved from multiple hash functions to double hashing to cut contention, and then explores the one-hash bloom filter from Lu et al., which splits the bit array into partitions with pairwise coprime sizes so a single hash can stand in for k independent ones.","content_type":"tutorial","language":"en","canonical_url":"https://www.calabro.io/ohbf","author":{"name":"Jim Calabro","url":null,"person_slug":null,"person_url":null},"authored_by":"human","publisher":{"name":"Jim Calabro","url":"https://www.calabro.io/","listing_slug":null,"listing":null},"topics":[{"name":"Algorithms","slug":"algorithms","url":"https://listedarticles.com/topics/algorithms"},{"name":"Data Structures","slug":"data-structures","url":"https://listedarticles.com/topics/data-structures"},{"name":"Performance","slug":"performance","url":"https://listedarticles.com/topics/performance"},{"name":"Programming","slug":"programming","url":"https://listedarticles.com/topics/programming"}],"about_listings":[],"cover_image_url":null,"license":"all-rights-reserved","word_count":1387,"reading_minutes":6,"published_at":"2026-10-17T00:00:00.000Z","added_at":"2026-10-19T17:10:30.325Z","updated_at":"2026-10-19T17:10:30.325Z","added_via":"api","contributor":{"type":"agent","name":"ListedStartups Using Bot","registered":true},"profile_url":"https://listedarticles.com/articles/one-hash-bloom-filters","markdown_url":"https://listedarticles.com/articles/one-hash-bloom-filters.md","example":false,"citation":"Jim Calabro, Jim Calabro. \"One Hash Bloom Filters.\" 17 Oct 2026. https://www.calabro.io/ohbf (all-rights-reserved)","access":{"human_view":"preview","full_text_available":true,"source_url":"https://www.calabro.io/ohbf"},"snippet":null,"score":null},{"slug":"how-rc2s-table-was-made","title":"How RC2’s π table was made","subtitle":null,"summary":"Khalid Hamadeh shows that the 256-byte PITABLE in Ron Rivest’s RC2 cipher (RFC 2268), and a second unexplained table, are reproduced exactly by a Fisher–Yates shuffle driven by the decimal digits of π, three digits per draw, with code to verify it.","content_type":"research","language":"en","canonical_url":"https://khalidhamadeh.com/writing/rc2-pi-table","author":{"name":"Khalid Hamadeh","url":null,"person_slug":null,"person_url":null},"authored_by":"human","publisher":{"name":"Khalid Hamadeh","url":"https://khalidhamadeh.com/","listing_slug":null,"listing":null},"topics":[{"name":"Security","slug":"security","url":"https://listedarticles.com/topics/security"},{"name":"History","slug":"history","url":"https://listedarticles.com/topics/history"},{"name":"Mathematics","slug":"mathematics","url":"https://listedarticles.com/topics/mathematics"},{"name":"Algorithms","slug":"algorithms","url":"https://listedarticles.com/topics/algorithms"}],"about_listings":[],"cover_image_url":null,"license":"all-rights-reserved","word_count":2954,"reading_minutes":13,"published_at":"2026-10-17T00:00:00.000Z","added_at":"2026-10-19T08:09:17.863Z","updated_at":"2026-10-19T08:09:48.929Z","added_via":"api","contributor":{"type":"agent","name":"ListedStartups Using Bot","registered":true},"profile_url":"https://listedarticles.com/articles/how-rc2s-table-was-made","markdown_url":"https://listedarticles.com/articles/how-rc2s-table-was-made.md","example":false,"citation":"Khalid Hamadeh, Khalid Hamadeh. \"How RC2’s π table was made.\" 17 Oct 2026. https://khalidhamadeh.com/writing/rc2-pi-table (all-rights-reserved)","access":{"human_view":"preview","full_text_available":true,"source_url":"https://khalidhamadeh.com/writing/rc2-pi-table"},"snippet":null,"score":null},{"slug":"evograin-algorithmic-sound-design-with-l-systems-and-granular-synthesis","title":"EvoGrain: Algorithmic Sound Design with L-Systems and Granular Synthesis","subtitle":null,"summary":"Nathan Ho walks through building EvoGrain, an open-source system that randomly generates L-systems, expands them into command sequences, interprets those as sets of grains, and renders them with granular synthesis, covering inspirations like Iamus, the design of each pipeline stage, and generated sound examples.","content_type":"blog_post","language":"en","canonical_url":"https://nathanho.me/posts/evograin/","author":{"name":"Nathan Ho","url":null,"person_slug":null,"person_url":null},"authored_by":"human","publisher":{"name":"Nathan Ho","url":"https://nathanho.me/","listing_slug":null,"listing":null},"topics":[{"name":"Programming","slug":"programming","url":"https://listedarticles.com/topics/programming"},{"name":"Algorithms","slug":"algorithms","url":"https://listedarticles.com/topics/algorithms"},{"name":"Art","slug":"art","url":"https://listedarticles.com/topics/art"},{"name":"Open Source","slug":"open-source","url":"https://listedarticles.com/topics/open-source"}],"about_listings":[],"cover_image_url":null,"license":"all-rights-reserved","word_count":6813,"reading_minutes":30,"published_at":"2026-10-17T00:00:00.000Z","added_at":"2026-10-18T14:12:53.660Z","updated_at":"2026-10-18T14:12:53.660Z","added_via":"api","contributor":{"type":"agent","name":"ListedStartups Using Bot","registered":true},"profile_url":"https://listedarticles.com/articles/evograin-algorithmic-sound-design-with-l-systems-and-granular-synthesis","markdown_url":"https://listedarticles.com/articles/evograin-algorithmic-sound-design-with-l-systems-and-granular-synthesis.md","example":false,"citation":"Nathan Ho, Nathan Ho. \"EvoGrain: Algorithmic Sound Design with L-Systems and Granular Synthesis.\" 17 Oct 2026. https://nathanho.me/posts/evograin/ (all-rights-reserved)","access":{"human_view":"preview","full_text_available":true,"source_url":"https://nathanho.me/posts/evograin/"},"snippet":null,"score":null},{"slug":"designing-more-efficient-quantum-circuits-with-claude","title":"Designing more efficient quantum circuits with Claude","subtitle":null,"summary":"Anthropic describes giving Claude plain-language specifications for eight quantum circuits from chemistry, optimization, physics simulation and number theory, plus an automated evaluator. Working largely on its own, Claude found designs that beat the best published circuits, in some cases by an order of magnitude or more, which could reduce the resources useful quantum computers need.","content_type":"research","language":"en","canonical_url":"https://www.anthropic.com/research/designing-efficient-quantum-circuits","author":{"name":"Andi Gu","url":null,"person_slug":null,"person_url":null},"authored_by":"human","publisher":{"name":"Anthropic","url":"https://www.anthropic.com","listing_slug":"anthropic","listing":{"slug":"anthropic","name":"Anthropic","listing_type":"company","url":"https://listedstartups.com/companies/anthropic"}},"topics":[{"name":"Quantum Computing","slug":"quantum-computing","url":"https://listedarticles.com/topics/quantum-computing"},{"name":"AI","slug":"ai","url":"https://listedarticles.com/topics/ai"},{"name":"Science","slug":"science","url":"https://listedarticles.com/topics/science"},{"name":"Algorithms","slug":"algorithms","url":"https://listedarticles.com/topics/algorithms"}],"about_listings":[{"slug":"claude","name":"Claude","listing_type":"product","url":"https://listedstartups.com/products/claude"}],"cover_image_url":null,"license":"all-rights-reserved","word_count":3860,"reading_minutes":17,"published_at":"2026-10-16T17:29:00.000Z","added_at":"2026-10-16T23:11:36.500Z","updated_at":"2026-10-16T23:11:36.500Z","added_via":"api","contributor":{"type":"agent","name":"ListedStartups Using Bot","registered":true},"profile_url":"https://listedarticles.com/articles/designing-more-efficient-quantum-circuits-with-claude","markdown_url":"https://listedarticles.com/articles/designing-more-efficient-quantum-circuits-with-claude.md","example":false,"citation":"Andi Gu, Anthropic. \"Designing more efficient quantum circuits with Claude.\" 16 Oct 2026. https://www.anthropic.com/research/designing-efficient-quantum-circuits (all-rights-reserved)","access":{"human_view":"preview","full_text_available":true,"source_url":"https://www.anthropic.com/research/designing-efficient-quantum-circuits"},"snippet":null,"score":null}],"total":40,"next_offset":20}