http://ln.ht/_/feed/algorithms 2026-06-23T07:55:51.889541Z auguste https://ln.ht/~auguste https://www.inkandswitch.com/tangents/bijou64/ 2026-06-05T15:05:33Z mlb https://ln.ht/~mlb https://www.inkandswitch.com/tangents/bijou64/ 2026-05-31T06:04:23Z mlb https://ln.ht/~mlb https://byorgey.wordpress.com/2018/05/06/conversations-with-a-six-year-old-on-functional-programming/ 2026-05-12T09:54:33Z mlb https://ln.ht/~mlb Great introduction to reservoir sampling, with interactive animations to build an intuitive understanding. https://samwho.dev/reservoir-sampling 2026-04-10T13:30:30Z mtmn https://ln.ht/~mtmn > This is a dictionary of algorithms, algorithmic techniques, data structures, archetypal problems, and related definitions. Algorithms include common functions, such as Ackermann's function. Problems include traveling salesman and Byzantine generals. Some entries have links to implementations and more information. Index pages list entries by area and by type. https://xlinux.nist.gov/dads/ 2026-04-10T00:31:04Z kawcco https://ln.ht/~kawcco > This is a dictionary of algorithms, algorithmic techniques, data structures, archetypal problems, and related definitions. Algorithms include common functions, such as Ackermann's function. Problems include traveling salesman and Byzantine generals. Some entries have links to implementations and more information. Index pages list entries by area and by type. https://xlinux.nist.gov/dads/ 2026-04-08T12:32:50Z kawcco https://ln.ht/~kawcco > Procedural generation is the idea of using simple rules to generate more complicated items - used in games such as Minecraft and Elite, Zac Garby of the University of Nottingham explains with the use of the game *Carcassonne*. Features an implementation of wave function collapse. https://www.youtube.com/watch?v=G6ZHUOSXZDo 2025-12-20T19:44:19Z CenturionRecords https://ln.ht/~CenturionRecords BOB Konferenz, Best of Breed Konferenz für Software-Entwickler und Entscheider in der Softwareentwicklung. https://bobkonf.de/2021/gibbons.html 2025-12-17T10:35:30Z kawcco https://ln.ht/~kawcco Can't fully understand because there are no words, but the author looks to be making a very neat connection between coalgebras and the executions (here "traces") of transition systems. Became aware of her work through Adjoint School 2026. via: https://www.cs.uni-salzburg.at/~anas/talks.html https://cs.uni-salzburg.at/~anas/papers/FAU-Erlangen-8-2-2022.pdf 2025-12-14T16:38:51Z kawcco https://ln.ht/~kawcco > We further develop the group-theoretic approach to fast matrix multiplication introduced by Cohn and Umans, and for the first time use it to derive algorithms asymptotically faster than the standard algorithm. We describe several families of wreath product groups that achieve matrix multiplication exponent less than 3, the asymptotically fastest of which achieves exponent 2.41. We present two conjectures regarding specific improvements, one combinatorial and the other algebraic. Either one would imply that the exponent of matrix multiplication is 2. Part of Prof. Cohn's larger matmul program. Don't completely have the chops for it yet, but definitely something to hold onto. https://arxiv.org/abs/math/0511460 2025-12-13T17:19:03Z greyb34rd https://ln.ht/~greyb34rd https://runestone.academy/ns/books/published/pythonds/index.html 2025-12-13T06:50:25Z kawcco https://ln.ht/~kawcco > This talk is an extension of my earlier Data Replication Design Spectrum blog post. The blog post was the analysis of the various replication algorithms, which concludes with showing that Raft has no particular advantage along any easy analyze/theoretical dimension. This builds on that argument to try and persuade you out of using Raft and to supply suggestions on how to work around the downsides of quorum-based or reconfiguration-based replication which makes people shy away from them. https://transactional.blog/talk/enough-with-all-the-raft 2025-11-24T14:47:57Z mrus https://ln.ht/~mrus https://transactional.blog/talk/enough-with-all-the-raft 2025-11-24T12:05:52Z mlb https://ln.ht/~mlb Rendezvous hashing is an algorithm to solve the distributed hash table problem - a common and general pattern in distributed systems. https://randorithms.com/2020/12/26/rendezvous-hashing.html 2025-09-18T09:58:25Z kawcco https://ln.ht/~kawcco https://topos.institute/blog/2025-08-15-incremental-adhesive/ 2025-08-31T14:35:48Z mrus https://ln.ht/~mrus Big O notation is a way of describing the performance of a function without using time. Rather than timing a function from start to finish, big O describes how the time grows as the input size increases. It is used to help understand how programs will perform across a range of inputs. https://samwho.dev/big-o/ 2025-08-27T22:51:32Z kawcco https://ln.ht/~kawcco > Radix sort is older than the computer yet quicker than quick sort. Why aren’t we all using it? https://www.youtube.com/watch?v=Y95a-8oNqps 2025-08-27T00:30:48Z kawcco https://ln.ht/~kawcco > Whether your app is local-first or more traditional, collaborative text editing is a tricky problem that requires advanced algorithms. Or does it? In this talk, I will describe a simple approach to collaborative text editing based on intuitive "insert after" operations. By using these operations in a general-purpose collaborative architecture (server reconciliation), you can implement text editing without CRDTs or OT. I will also discuss nuanced conflict resolution and decentralized variants. Text version: https://mattweidner.com/2025/05/21/text-without-crdts.html https://www.youtube.com/watch?v=5CFrpd0sG-g 2025-08-04T13:15:02Z yahourt https://ln.ht/~yahourt Graph search algorithms let us find the shortest path on a map represented as a graph. Move the blob (start point) and cross (end point) to see the shortest path found by the A* Algorithm. https://www.redblobgames.com/pathfinding/a-star/introduction.html 2025-06-19T06:16:51Z mrus https://ln.ht/~mrus Graph search algorithms let us find the shortest path on a map represented as a graph. Move the blob (start point) and cross (end point) to see the shortest path found by the A* Algorithm. https://www.redblobgames.com/pathfinding/a-star/introduction.html 2025-06-18T21:06:37Z