lysdexic@programming.devMEnglish · 4 days agoSorting Algorithms with CUDA! | Ashwani Ratheeplus-squareashwanirathee.comexternal-linkmessage-square0fedilinkarrow-up11arrow-down10
arrow-up11arrow-down1external-linkSorting Algorithms with CUDA! | Ashwani Ratheeplus-squareashwanirathee.comlysdexic@programming.devMEnglish · 4 days agomessage-square0fedilink
lysdexic@programming.devMEnglish · 7 days agoProlly Treesplus-squaredocs.dolthub.comexternal-linkmessage-square0fedilinkarrow-up11arrow-down10
arrow-up11arrow-down1external-linkProlly Treesplus-squaredocs.dolthub.comlysdexic@programming.devMEnglish · 7 days agomessage-square0fedilink
lysdexic@programming.devMEnglish · 8 days agoTo B or not to B: B-Trees with Optimistic Lock Couplingplus-squarecedardb.comexternal-linkmessage-square0fedilinkarrow-up11arrow-down10
arrow-up11arrow-down1external-linkTo B or not to B: B-Trees with Optimistic Lock Couplingplus-squarecedardb.comlysdexic@programming.devMEnglish · 8 days agomessage-square0fedilink
lysdexic@programming.devMEnglish · 9 days agoSuccinct data structuresplus-squareblog.startifact.comexternal-linkmessage-square0fedilinkarrow-up11arrow-down10
arrow-up11arrow-down1external-linkSuccinct data structuresplus-squareblog.startifact.comlysdexic@programming.devMEnglish · 9 days agomessage-square0fedilink
lysdexic@programming.devMEnglish · 24 days agoRelaxed Radix Balanced Treesplus-squarepeter.horne-khan.comexternal-linkmessage-square0fedilinkarrow-up11arrow-down10
arrow-up11arrow-down1external-linkRelaxed Radix Balanced Treesplus-squarepeter.horne-khan.comlysdexic@programming.devMEnglish · 24 days agomessage-square0fedilink
lysdexic@programming.devMEnglish · 5 months agoWhen to Use Two Phase Commit in Distributed Transaction (2022)plus-squarehongilkwon.medium.comexternal-linkmessage-square0fedilinkarrow-up11arrow-down10
arrow-up11arrow-down1external-linkWhen to Use Two Phase Commit in Distributed Transaction (2022)plus-squarehongilkwon.medium.comlysdexic@programming.devMEnglish · 5 months agomessage-square0fedilink
lysdexic@programming.devMEnglish · 5 months agoCrit-bit treesplus-squarecr.yp.toexternal-linkmessage-square0fedilinkarrow-up11arrow-down10
arrow-up11arrow-down1external-linkCrit-bit treesplus-squarecr.yp.tolysdexic@programming.devMEnglish · 5 months agomessage-square0fedilink
lysdexic@programming.devMEnglish · 5 months agoSmolderingly fast b-treesplus-squarewww.scattered-thoughts.netexternal-linkmessage-square0fedilinkarrow-up11arrow-down10
arrow-up11arrow-down1external-linkSmolderingly fast b-treesplus-squarewww.scattered-thoughts.netlysdexic@programming.devMEnglish · 5 months agomessage-square0fedilink
Pierre-Yves Lapersonne@programming.devEnglish · 6 months agoEvaluation of large language model (LLM) to generate efficient Solidity codeplus-squareopensource.orange.comexternal-linkmessage-square0fedilinkarrow-up11arrow-down10
arrow-up11arrow-down1external-linkEvaluation of large language model (LLM) to generate efficient Solidity codeplus-squareopensource.orange.comPierre-Yves Lapersonne@programming.devEnglish · 6 months agomessage-square0fedilink
lysdexic@programming.devMEnglish · 6 months agoLarge Text Compression Benchmarkplus-squarewww.mattmahoney.netexternal-linkmessage-square0fedilinkarrow-up11arrow-down10
arrow-up11arrow-down1external-linkLarge Text Compression Benchmarkplus-squarewww.mattmahoney.netlysdexic@programming.devMEnglish · 6 months agomessage-square0fedilink
lysdexic@programming.devMEnglish · 6 months agoDissecting the GZIP format (2011)www.infinitepartitions.comexternal-linkmessage-square0fedilinkarrow-up11arrow-down10
arrow-up11arrow-down1external-linkDissecting the GZIP format (2011)www.infinitepartitions.comlysdexic@programming.devMEnglish · 6 months agomessage-square0fedilink
lysdexic@programming.devMEnglish · 6 months agoB-Trees: More Than I Thought I'd Want to Knowplus-squarebenjamincongdon.meexternal-linkmessage-square0fedilinkarrow-up11arrow-down10
arrow-up11arrow-down1external-linkB-Trees: More Than I Thought I'd Want to Knowplus-squarebenjamincongdon.melysdexic@programming.devMEnglish · 6 months agomessage-square0fedilink
lysdexic@programming.devMEnglish · 6 months agoWhat is GZIP Compression and is it Lossless?plus-squarebunny.netexternal-linkmessage-square0fedilinkarrow-up11arrow-down10
arrow-up11arrow-down1external-linkWhat is GZIP Compression and is it Lossless?plus-squarebunny.netlysdexic@programming.devMEnglish · 6 months agomessage-square0fedilink
lysdexic@programming.devMEnglish · 6 months agoNagle's algorithm - Wikipediaplus-squareen.wikipedia.orgexternal-linkmessage-square0fedilinkarrow-up11arrow-down10
arrow-up11arrow-down1external-linkNagle's algorithm - Wikipediaplus-squareen.wikipedia.orglysdexic@programming.devMEnglish · 6 months agomessage-square0fedilink
lysdexic@programming.devMEnglish · 6 months agoAn introduction to Conflict-Free Replicated Data Types · Part 1: Preliminariesplus-squarelars.hupel.infoexternal-linkmessage-square0fedilinkarrow-up11arrow-down10
arrow-up11arrow-down1external-linkAn introduction to Conflict-Free Replicated Data Types · Part 1: Preliminariesplus-squarelars.hupel.infolysdexic@programming.devMEnglish · 6 months agomessage-square0fedilink
lysdexic@programming.devMEnglish · 6 months agoConflict Resolution: Using Last-Write-Wins vs. CRDTs (2018)plus-squaredzone.comexternal-linkmessage-square0fedilinkarrow-up11arrow-down10
arrow-up11arrow-down1external-linkConflict Resolution: Using Last-Write-Wins vs. CRDTs (2018)plus-squaredzone.comlysdexic@programming.devMEnglish · 6 months agomessage-square0fedilink
lysdexic@programming.devMEnglish · 6 months agoWhen Bloom filters don't bloomplus-squareblog.cloudflare.comexternal-linkmessage-square0fedilinkarrow-up11arrow-down10
arrow-up11arrow-down1external-linkWhen Bloom filters don't bloomplus-squareblog.cloudflare.comlysdexic@programming.devMEnglish · 6 months agomessage-square0fedilink
lysdexic@programming.devMEnglish · 6 months agoWhat is a Log Structured Merge Tree? Definition & FAQs | ScyllaDBplus-squarewww.scylladb.comexternal-linkmessage-square0fedilinkarrow-up11arrow-down10
arrow-up11arrow-down1external-linkWhat is a Log Structured Merge Tree? Definition & FAQs | ScyllaDBplus-squarewww.scylladb.comlysdexic@programming.devMEnglish · 6 months agomessage-square0fedilink
lysdexic@programming.devMEnglish · 6 months agoB-trees and database indexesplus-squareplanetscale.comexternal-linkmessage-square0fedilinkarrow-up11arrow-down10
arrow-up11arrow-down1external-linkB-trees and database indexesplus-squareplanetscale.comlysdexic@programming.devMEnglish · 6 months agomessage-square0fedilink
lysdexic@programming.devMEnglish · 6 months agoKuth’s Merge Sort in Cplus-squarewww.yodaiken.comexternal-linkmessage-square0fedilinkarrow-up11arrow-down10
arrow-up11arrow-down1external-linkKuth’s Merge Sort in Cplus-squarewww.yodaiken.comlysdexic@programming.devMEnglish · 6 months agomessage-square0fedilink
