cm0002@lemmy.world · 5 months agoComputing simplified coverage polygonsplus-squarewww.volkerkrause.euexternal-linkmessage-square0linkfedilinkarrow-up11arrow-down10
arrow-up11arrow-down1external-linkComputing simplified coverage polygonsplus-squarewww.volkerkrause.eucm0002@lemmy.world · 5 months agomessage-square0linkfedilink
Fargeol@lemmy.worldEnglish · edit-26 months agoWhat would be the "least boring" sorting algorithm?plus-squaremessage-squaremessage-square17linkfedilinkarrow-up129arrow-down11
arrow-up128arrow-down1message-squareWhat would be the "least boring" sorting algorithm?plus-squareFargeol@lemmy.worldEnglish · edit-26 months agomessage-square17linkfedilink
lysdexic@programming.devMEnglish · 11 months agovisualising data structures and algorithms through animation - VisuAlgoplus-squarevisualgo.netexternal-linkmessage-square0linkfedilinkarrow-up15arrow-down10
arrow-up15arrow-down1external-linkvisualising data structures and algorithms through animation - VisuAlgoplus-squarevisualgo.netlysdexic@programming.devMEnglish · 11 months agomessage-square0linkfedilink
lysdexic@programming.devMEnglish · 11 months agoSorting Algorithms with CUDA! | Ashwani Ratheeplus-squareashwanirathee.comexternal-linkmessage-square0linkfedilinkarrow-up12arrow-down11
arrow-up11arrow-down1external-linkSorting Algorithms with CUDA! | Ashwani Ratheeplus-squareashwanirathee.comlysdexic@programming.devMEnglish · 11 months agomessage-square0linkfedilink
lysdexic@programming.devMEnglish · 11 months agoProlly Treesplus-squaredocs.dolthub.comexternal-linkmessage-square0linkfedilinkarrow-up13arrow-down10
arrow-up13arrow-down1external-linkProlly Treesplus-squaredocs.dolthub.comlysdexic@programming.devMEnglish · 11 months agomessage-square0linkfedilink
lysdexic@programming.devMEnglish · 11 months agoTo B or not to B: B-Trees with Optimistic Lock Couplingplus-squarecedardb.comexternal-linkmessage-square0linkfedilinkarrow-up11arrow-down10
arrow-up11arrow-down1external-linkTo B or not to B: B-Trees with Optimistic Lock Couplingplus-squarecedardb.comlysdexic@programming.devMEnglish · 11 months agomessage-square0linkfedilink
lysdexic@programming.devMEnglish · 11 months agoSuccinct data structuresplus-squareblog.startifact.comexternal-linkmessage-square0linkfedilinkarrow-up16arrow-down10
arrow-up16arrow-down1external-linkSuccinct data structuresplus-squareblog.startifact.comlysdexic@programming.devMEnglish · 11 months agomessage-square0linkfedilink
lysdexic@programming.devMEnglish · 1 year agoRelaxed Radix Balanced Treesplus-squarepeter.horne-khan.comexternal-linkmessage-square0linkfedilinkarrow-up13arrow-down10
arrow-up13arrow-down1external-linkRelaxed Radix Balanced Treesplus-squarepeter.horne-khan.comlysdexic@programming.devMEnglish · 1 year agomessage-square0linkfedilink
lysdexic@programming.devMEnglish · 1 year agoWhen to Use Two Phase Commit in Distributed Transaction (2022)plus-squarehongilkwon.medium.comexternal-linkmessage-square0linkfedilinkarrow-up11arrow-down10
arrow-up11arrow-down1external-linkWhen to Use Two Phase Commit in Distributed Transaction (2022)plus-squarehongilkwon.medium.comlysdexic@programming.devMEnglish · 1 year agomessage-square0linkfedilink
lysdexic@programming.devMEnglish · 1 year agoCrit-bit treesplus-squarecr.yp.toexternal-linkmessage-square0linkfedilinkarrow-up11arrow-down10
arrow-up11arrow-down1external-linkCrit-bit treesplus-squarecr.yp.tolysdexic@programming.devMEnglish · 1 year agomessage-square0linkfedilink
lysdexic@programming.devMEnglish · 1 year agoSmolderingly fast b-treesplus-squarewww.scattered-thoughts.netexternal-linkmessage-square0linkfedilinkarrow-up12arrow-down10
arrow-up12arrow-down1external-linkSmolderingly fast b-treesplus-squarewww.scattered-thoughts.netlysdexic@programming.devMEnglish · 1 year agomessage-square0linkfedilink
Pierre-Yves Lapersonne@programming.devEnglish · 1 year agoEvaluation of large language model (LLM) to generate efficient Solidity codeplus-squareopensource.orange.comexternal-linkmessage-square0linkfedilinkarrow-up11arrow-down10
arrow-up11arrow-down1external-linkEvaluation of large language model (LLM) to generate efficient Solidity codeplus-squareopensource.orange.comPierre-Yves Lapersonne@programming.devEnglish · 1 year agomessage-square0linkfedilink
lysdexic@programming.devMEnglish · 1 year agoLarge Text Compression Benchmarkplus-squarewww.mattmahoney.netexternal-linkmessage-square0linkfedilinkarrow-up11arrow-down10
arrow-up11arrow-down1external-linkLarge Text Compression Benchmarkplus-squarewww.mattmahoney.netlysdexic@programming.devMEnglish · 1 year agomessage-square0linkfedilink
lysdexic@programming.devMEnglish · 1 year agoDissecting the GZIP format (2011)www.infinitepartitions.comexternal-linkmessage-square0linkfedilinkarrow-up11arrow-down10
arrow-up11arrow-down1external-linkDissecting the GZIP format (2011)www.infinitepartitions.comlysdexic@programming.devMEnglish · 1 year agomessage-square0linkfedilink
lysdexic@programming.devMEnglish · 1 year agoB-Trees: More Than I Thought I'd Want to Knowplus-squarebenjamincongdon.meexternal-linkmessage-square0linkfedilinkarrow-up11arrow-down10
arrow-up11arrow-down1external-linkB-Trees: More Than I Thought I'd Want to Knowplus-squarebenjamincongdon.melysdexic@programming.devMEnglish · 1 year agomessage-square0linkfedilink
lysdexic@programming.devMEnglish · 1 year agoWhat is GZIP Compression and is it Lossless?plus-squarebunny.netexternal-linkmessage-square0linkfedilinkarrow-up11arrow-down10
arrow-up11arrow-down1external-linkWhat is GZIP Compression and is it Lossless?plus-squarebunny.netlysdexic@programming.devMEnglish · 1 year agomessage-square0linkfedilink
lysdexic@programming.devMEnglish · 1 year agoNagle's algorithm - Wikipediaplus-squareen.wikipedia.orgexternal-linkmessage-square0linkfedilinkarrow-up11arrow-down10
arrow-up11arrow-down1external-linkNagle's algorithm - Wikipediaplus-squareen.wikipedia.orglysdexic@programming.devMEnglish · 1 year agomessage-square0linkfedilink
lysdexic@programming.devMEnglish · 1 year agoAn introduction to Conflict-Free Replicated Data Types · Part 1: Preliminariesplus-squarelars.hupel.infoexternal-linkmessage-square0linkfedilinkarrow-up11arrow-down10
arrow-up11arrow-down1external-linkAn introduction to Conflict-Free Replicated Data Types · Part 1: Preliminariesplus-squarelars.hupel.infolysdexic@programming.devMEnglish · 1 year agomessage-square0linkfedilink
lysdexic@programming.devMEnglish · 1 year agoConflict Resolution: Using Last-Write-Wins vs. CRDTs (2018)plus-squaredzone.comexternal-linkmessage-square0linkfedilinkarrow-up11arrow-down10
arrow-up11arrow-down1external-linkConflict Resolution: Using Last-Write-Wins vs. CRDTs (2018)plus-squaredzone.comlysdexic@programming.devMEnglish · 1 year agomessage-square0linkfedilink
lysdexic@programming.devMEnglish · 1 year agoWhen Bloom filters don't bloomplus-squareblog.cloudflare.comexternal-linkmessage-square0linkfedilinkarrow-up11arrow-down10
arrow-up11arrow-down1external-linkWhen Bloom filters don't bloomplus-squareblog.cloudflare.comlysdexic@programming.devMEnglish · 1 year agomessage-square0linkfedilink
