41554 blogs · [ { "id": "01a0b0bc-0468-7094-9341-fe7bd8340f9b", "title": "On the Energy Usage for Navier-Stokes", "url": "https://curiouscoding.nl/posts/energy-usage-of-navier-stokes/", "published_at": "2026-09-15T22:00:00+00:00" }, { "id": "01a094ea-3015-731f-b4ce-4adb603d92a5", "title": "Possible improvements to the QuickHeap", "url": "https://curiouscoding.nl/posts/quickheap-improvements/", "published_at": "2026-09-10T22:00:00+00:00" }, { "id": "01a08765-ac01-71c2-80fc-326e17ef08a3", "title": "The Anti-Lexicographic SUS-anchor", "url": "https://curiouscoding.nl/slides/sus-anchors-text/", "published_at": "2026-09-01T22:00:00+00:00" }, { "id": "01a08765-ac01-71c2-80fc-326e1829a284", "title": "Scans of some rare papers", "url": "https://curiouscoding.nl/posts/scans/", "published_at": "2026-08-24T22:00:00+00:00" }, { "id": "01a08765-ac01-71c2-80fc-326e18e9307f", "title": "NtHash3: first ideas", "url": "https://curiouscoding.nl/posts/nthash-revisited/", "published_at": "2026-07-31T22:00:00+00:00" }, { "id": "01a08765-ac01-71c2-80fc-326e19033040", "title": "A seed-independent hash collision in GxHash", "url": "https://curiouscoding.nl/posts/gxhash-collision/", "published_at": "2026-07-30T22:00:00+00:00" }, { "id": "01a08765-ac01-71c2-80fc-326e19e21b9c", "title": "Kayaking in Latvia: Engure, Rinda, and Irbe rivers", "url": "https://curiouscoding.nl/posts/latvia-kayaking-2026/", "published_at": "2026-07-22T22:00:00+00:00" }, { "id": "01a08765-ac01-71c2-80fc-326e1aba3e51", "title": "Sassy 1 & 2: Fuzzy searching DNA using SIMD", "url": "https://curiouscoding.nl/slides/sassy/", "published_at": "2026-07-05T22:00:00+00:00" }, { "id": "01a08765-ac01-71c2-80fc-326e1b3cb045", "title": "Sassy: fuzzy searching DNA sequences using SIMD", "url": "https://curiouscoding.nl/posts/sassy/", "published_at": "2026-06-03T22:00:00+00:00" }, { "id": "01a08765-ac01-71c2-80fc-326e1b45cf46", "title": "The Jump Index", "url": "https://curiouscoding.nl/slides/jump-index/", "published_at": "2026-05-25T14:30:00+00:00" }, { "id": "01a08765-ac01-71c2-80fc-326e1c2811d2", "title": "STPD: Compressing Suffix Trees by Path Decompositions", "url": "https://curiouscoding.nl/slides/stpd/", "published_at": "2026-05-25T12:55:00+00:00" }, { "id": "01a08765-ac01-71c2-80fc-326e1c8aeea8", "title": "QuickHeap", "url": "https://curiouscoding.nl/teaching/quickheap-lecture/", "published_at": "2026-05-18T12:00:00+00:00" }, { "id": "01a08765-ac01-71c2-80fc-326e1d70f856", "title": "Spring update", "url": "https://curiouscoding.nl/slides/2026-spring-update/", "published_at": "2026-05-12T09:00:00+00:00" }, { "id": "01a08765-ac01-71c2-80fc-326e1e4cf75b", "title": "The Anti-Lexicographic SUS-Anchor: an Empirically Optimal Selection Scheme", "url": "https://curiouscoding.nl/posts/sus-anchors/", "published_at": "2026-05-11T22:00:00+00:00" }, { "id": "01a08765-ac01-71c2-80fc-326e1efaccc2", "title": "Range Minimum Queries", "url": "https://curiouscoding.nl/teaching/rmq-notes/", "published_at": "2026-05-10T22:00:00+00:00" }, { "id": "01a08765-ac01-71c2-80fc-326e1ff06406", "title": "List of interesting blogs", "url": "https://curiouscoding.nl/posts/list-of-blogs/", "published_at": "2026-05-04T22:00:00+00:00" }, { "id": "01a08765-ac01-71c2-80fc-326e2045d494", "title": "Succinct trees", "url": "https://curiouscoding.nl/teaching/succinct-trees/", "published_at": "2026-05-04T12:00:00+00:00" }, { "id": "01a08765-ac01-71c2-80fc-326e20d75145", "title": "High Throughput Bioinformatics: Theory to/from Practice", "url": "https://curiouscoding.nl/slides/yigpp/", "published_at": "2026-04-28T22:00:00+00:00" }, { "id": "01a08765-ac01-71c2-80fc-326e2105c7fa", "title": "Elias-Fano coding", "url": "https://curiouscoding.nl/teaching/elias-fano/", "published_at": "2026-04-27T12:00:00+00:00" }, { "id": "01a08765-ac01-71c2-80fc-326e21f99aa7", "title": "Rank & Select", "url": "https://curiouscoding.nl/teaching/rank-select/", "published_at": "2026-04-27T12:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c82c273f45", "title": "Advanced Data Structures", "url": "https://curiouscoding.nl/teaching/advanced-data-structures/", "published_at": "2026-04-20T12:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c82cb2aed5", "title": "Models of computation", "url": "https://curiouscoding.nl/teaching/models-of-computation/", "published_at": "2026-04-20T12:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c82d161744", "title": "NordVPN refund dark patterns", "url": "https://curiouscoding.nl/posts/nordvpn-refund/", "published_at": "2026-03-02T23:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c82da599ae", "title": "Route Planning using Customizable Contraction Hierarchies", "url": "https://curiouscoding.nl/posts/cch/", "published_at": "2026-03-01T23:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c82de624a0", "title": "Wheeler graphs", "url": "https://curiouscoding.nl/posts/wheeler-graphs/", "published_at": "2026-02-25T23:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c82e2cf2b1", "title": "A history of pairwise alignment", "url": "https://curiouscoding.nl/slides/pairwise-alignment-text/", "published_at": "2026-02-17T23:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c82eb4b690", "title": "QuadRank: Engineering a High-Throughput Rank", "url": "https://curiouscoding.nl/slides/quadrank-text/", "published_at": "2026-02-17T23:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c82fadb4af", "title": "DEFLATE, gzip, zlib, libz, et al.", "url": "https://curiouscoding.nl/posts/gzip/", "published_at": "2026-02-08T23:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c83049a566", "title": "QuadRank: Engineering a High Throughput Rank", "url": "https://curiouscoding.nl/posts/quadrank/", "published_at": "2026-01-28T23:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c8313e1fea", "title": "Recent results on hash tables", "url": "https://curiouscoding.nl/posts/hash-table-bounds/", "published_at": "2026-01-27T23:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c831da4dd2", "title": "Releasing Rust SIMD binaries to GitHub, BioConda, and PyPI", "url": "https://curiouscoding.nl/posts/release-flow/", "published_at": "2026-01-24T23:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c832483b53", "title": "Trying to understand DDR memory", "url": "https://curiouscoding.nl/posts/ddr/", "published_at": "2026-01-19T23:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c832d695c8", "title": "Quotes from \"The Evolution of Mathematical Software\"", "url": "https://curiouscoding.nl/posts/evolution-of-mathematical-software/", "published_at": "2026-01-17T23:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c833a9e6fb", "title": "HPRC v2 stats", "url": "https://curiouscoding.nl/posts/hprc-v2-stats/", "published_at": "2025-12-25T23:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c8341760e4", "title": "Asymptotic elevators", "url": "https://curiouscoding.nl/posts/asymptotic-elevators/", "published_at": "2025-12-21T23:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c83476f6fe", "title": "Overview of static data structures", "url": "https://curiouscoding.nl/posts/static-data-structures/", "published_at": "2025-12-16T23:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c8352cfbc2", "title": "Writing typst in emacs", "url": "https://curiouscoding.nl/posts/typst-in-emacs/", "published_at": "2025-12-11T23:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c8354f89fb", "title": "Distributing Rust SIMD Binaries", "url": "https://curiouscoding.nl/posts/distributing-rust-simd-binaries/", "published_at": "2025-11-19T23:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c836314911", "title": "Thoughts on \"Static Retrieval Revisited\"", "url": "https://curiouscoding.nl/posts/static-retrieval-revisited/", "published_at": "2025-11-03T23:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c8364808e1", "title": "Thoughts on Singletrack", "url": "https://curiouscoding.nl/posts/singletrack/", "published_at": "2025-11-03T23:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c836894d00", "title": "Past, ongoing, and future research plans", "url": "https://curiouscoding.nl/wip/", "published_at": "2025-10-05T22:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c8370ff679", "title": "Three log scientist", "url": "https://curiouscoding.nl/posts/three-log-scientist/", "published_at": "2025-08-11T22:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c83715a382", "title": "QuickHeap: the fastest priority queue", "url": "https://curiouscoding.nl/posts/quickheap/", "published_at": "2025-08-10T22:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c8373b2667", "title": "Chunking for Fasta Parsing", "url": "https://curiouscoding.nl/posts/fasta-parsing/", "published_at": "2025-08-05T22:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c83740ff40", "title": "40x Faster Binary Search", "url": "https://curiouscoding.nl/slides/p99-text/", "published_at": "2025-07-19T22:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c83755cb93", "title": "PtrHash", "url": "https://curiouscoding.nl/slides/ptrhash-text/", "published_at": "2025-07-19T22:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c8381384bb", "title": "SimdQuickHeap:", "url": "https://curiouscoding.nl/slides/quickheap-text/", "published_at": "2025-07-19T22:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c838d03de4", "title": "Software", "url": "https://curiouscoding.nl/software/", "published_at": "2025-04-29T22:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c83902e506", "title": "Understanding GreedyMini", "url": "https://curiouscoding.nl/posts/greedymini-analysis/", "published_at": "2025-04-26T22:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c83973d1c0", "title": "Optimal Throughput Bioinformatics", "url": "https://curiouscoding.nl/slides/defense-text/", "published_at": "2025-04-09T22:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c839a14a5a", "title": "Thesis: Optimal Throughput Bioinformatics", "url": "https://curiouscoding.nl/posts/thesis/", "published_at": "2025-04-09T22:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c83a212121", "title": "A History of Pairwise Alignment", "url": "https://curiouscoding.nl/posts/pairwise-alignment/", "published_at": "2025-04-08T22:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c83a99233b", "title": "Low Density Minimizers", "url": "https://curiouscoding.nl/posts/minimizers/", "published_at": "2025-04-07T22:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c83a99df05", "title": "Beyond Global Alignment", "url": "https://curiouscoding.nl/posts/mapping/", "published_at": "2025-04-06T22:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c83b5a9802", "title": "High Throughput Bioinformatics", "url": "https://curiouscoding.nl/posts/throughput/", "published_at": "2025-04-05T22:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c83c08b6b6", "title": "Path Pruning Revisited", "url": "https://curiouscoding.nl/posts/path-pruning/", "published_at": "2025-03-30T22:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c83ce85bd4", "title": "SimdSketch: a fast bucket sketch", "url": "https://curiouscoding.nl/posts/simd-sketch/", "published_at": "2025-03-08T23:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c83cfb28ab", "title": "Types of tigs", "url": "https://curiouscoding.nl/posts/tigs/", "published_at": "2025-03-08T23:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c83d2d802d", "title": "Near-optimal sampling schemes", "url": "https://curiouscoding.nl/slides/minimizers-dsb25-text/", "published_at": "2025-02-26T23:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c83d7a3e6b", "title": "Minimizer papers", "url": "https://curiouscoding.nl/posts/minimizer-papers/", "published_at": "2025-02-16T23:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c83df2b41e", "title": "Binary search variants and the effects of batching", "url": "https://curiouscoding.nl/posts/binsearch/", "published_at": "2025-02-11T23:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c83ecc2b6d", "title": "Thoughts on Consensus MPHF and tiny pointers", "url": "https://curiouscoding.nl/posts/consensus/", "published_at": "2025-02-11T23:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c83eda95b7", "title": "PtrHash: Minimal Perfect Hashing at RAM Throughput", "url": "https://curiouscoding.nl/posts/ptrhash/", "published_at": "2025-02-02T23:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c83f14850c", "title": "Code snippets for Latex, Rust, and Python", "url": "https://curiouscoding.nl/posts/snippets/", "published_at": "2025-01-14T23:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c83f5107a7", "title": "Setting up traffic monitoring using GoAccess", "url": "https://curiouscoding.nl/posts/goaccess-setup/", "published_at": "2025-01-03T23:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c83feb546e", "title": "Static search trees: 40x faster than binary search", "url": "https://curiouscoding.nl/posts/static-search-tree/", "published_at": "2024-12-17T23:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c840c5752a", "title": "Comments on Brisk", "url": "https://curiouscoding.nl/posts/brisk/", "published_at": "2024-11-28T23:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c840f3860d", "title": "Comments on GreedyMini", "url": "https://curiouscoding.nl/posts/greedymini/", "published_at": "2024-11-03T23:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c841ec78bf", "title": "Comments on 'When Less is More' minimizer review", "url": "https://curiouscoding.nl/posts/minimizer-review-comments/", "published_at": "2024-10-14T22:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c84248eeb3", "title": "A lemma on suffix array searching", "url": "https://curiouscoding.nl/posts/suffix-array-searching-lemma/", "published_at": "2024-10-04T22:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c84312bdb6", "title": "FM-index implementations", "url": "https://curiouscoding.nl/posts/fm-index-implementations/", "published_at": "2024-10-01T22:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c8437b5de6", "title": "Practical minimizers", "url": "https://curiouscoding.nl/posts/practical-minimizers/", "published_at": "2024-09-11T22:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c843df8e9b", "title": "Calling Rust from Python", "url": "https://curiouscoding.nl/posts/calling-rust-from-python/", "published_at": "2024-09-09T22:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c844743812", "title": "AI reading list", "url": "https://curiouscoding.nl/posts/ai-reading-list/", "published_at": "2024-09-08T22:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c8456f8548", "title": "PACE 24", "url": "https://curiouscoding.nl/posts/pace24/", "published_at": "2024-09-04T22:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c84669d582", "title": "[WIP] Feynman problems", "url": "https://curiouscoding.nl/posts/feynman-problems/", "published_at": "2024-08-11T22:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c846e5a7dd", "title": "SimdMinimizers: Computing random minimizers, fast", "url": "https://curiouscoding.nl/posts/simd-minimizers/", "published_at": "2024-07-11T22:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c84744f57d", "title": "Links for talks & posters", "url": "https://curiouscoding.nl/posts/links/", "published_at": "2024-06-30T22:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c847e08b56", "title": "A near-tight lower bound on minimizer density", "url": "https://curiouscoding.nl/posts/minimizer-lower-bound/", "published_at": "2024-06-24T22:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c848958ee4", "title": "Tools for suffix array searching", "url": "https://curiouscoding.nl/posts/suffix-array-searching/", "published_at": "2024-06-13T22:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c848e3c508", "title": "Crates for suffix array construction", "url": "https://curiouscoding.nl/posts/suffix-array-crates/", "published_at": "2024-06-12T22:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c84934ef59", "title": "Thoughts on POASTA", "url": "https://curiouscoding.nl/posts/poasta/", "published_at": "2024-05-27T22:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c84a2876db", "title": "A*PA2: Up to 19x faster exact global alignment", "url": "https://curiouscoding.nl/posts/astarpa2/", "published_at": "2024-03-22T23:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c84adcd1b0", "title": "Review of refined minimizes", "url": "https://curiouscoding.nl/posts/refined-minimizer/", "published_at": "2024-01-25T23:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c84bbaa146", "title": "Mod-minimizers and other minimizers", "url": "https://curiouscoding.nl/posts/mod-minimizers/", "published_at": "2024-01-17T23:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c84c9025e4", "title": "Intro to Rust", "url": "https://curiouscoding.nl/posts/intro-to-rust/", "published_at": "2024-01-15T23:00:00+00:00" }, { "id": "01a08765-ac02-724b-9f4f-76c84d1e957e", "title": "Notes on bidirectional anchors", "url": "https://curiouscoding.nl/posts/bd-anchors/", "published_at": "2024-01-14T23:00:00+00:00" }, { "id": "01a08765-ac03-7159-bf3c-1077060b28a1", "title": "Notes on SsHash", "url": "https://curiouscoding.nl/posts/sshash/", "published_at": "2024-01-14T23:00:00+00:00" }, { "id": "01a08765-ac03-7159-bf3c-107706e698c7", "title": "One Billion Row Challenge", "url": "https://curiouscoding.nl/posts/1brc/", "published_at": "2024-01-02T23:00:00+00:00" }, { "id": "01a08765-ac03-7159-bf3c-1077077e898e", "title": "NtHash1: making it perfect", "url": "https://curiouscoding.nl/posts/nthash/", "published_at": "2023-12-30T23:00:00+00:00" }, { "id": "01a08765-ac03-7159-bf3c-107707a03359", "title": "A*PA talk @ CWI", "url": "https://curiouscoding.nl/posts/astarpa-talk-cwi/", "published_at": "2023-12-26T23:00:00+00:00" }, { "id": "01a08765-ac03-7159-bf3c-10770811dde1", "title": "Notes on implementing Longest Common Repeat (LCR)", "url": "https://curiouscoding.nl/posts/longest-common-repeat/", "published_at": "2023-12-05T23:00:00+00:00" }, { "id": "01a08765-ac03-7159-bf3c-1077088f51af", "title": "ALPACA/PANGAIA winter workshop notes", "url": "https://curiouscoding.nl/posts/winter-workshop-2023/", "published_at": "2023-11-19T23:00:00+00:00" }, { "id": "01a08765-ac03-7159-bf3c-1077089f2a60", "title": "Notes on writing course", "url": "https://curiouscoding.nl/posts/writing-course/", "published_at": "2023-11-13T23:00:00+00:00" }, { "id": "01a08765-ac03-7159-bf3c-107708ee1972", "title": "BAPCtools instruction", "url": "https://curiouscoding.nl/posts/bapctools-demo/", "published_at": "2023-10-16T22:00:00+00:00" }, { "id": "01a08765-ac03-7159-bf3c-1077093e435f", "title": "PtrHash: Notes on adapting PTHash in Rust", "url": "https://curiouscoding.nl/posts/ptrhash-log/", "published_at": "2023-09-20T22:00:00+00:00" }, { "id": "01a08765-ac03-7159-bf3c-10770a19c032", "title": "BBHash: some ideas", "url": "https://curiouscoding.nl/posts/bbhash/", "published_at": "2023-09-03T22:00:00+00:00" }, { "id": "01a08765-ac03-7159-bf3c-10770ac63feb", "title": "BitPAl bitpacking algorithm", "url": "https://curiouscoding.nl/posts/bitpal/", "published_at": "2023-09-02T22:00:00+00:00" }, { "id": "01a08765-ac03-7159-bf3c-10770b4ce4d8", "title": "Shortest paths, bucket queues, and A* on the edit graph", "url": "https://curiouscoding.nl/posts/shortest_path_history/", "published_at": "2023-07-28T22:00:00+00:00" }, { "id": "01a08765-ac03-7159-bf3c-10770bef8f99", "title": "Research proposal: subquadratic string graph construction", "url": "https://curiouscoding.nl/posts/cwi-proposal/", "published_at": "2023-07-09T22:00:00+00:00" } ] posts Claim your blog

Back to curiouscoding.nl

Blog · corpus.blog/blogs/curiouscoding.nl/posts

curiouscoding.nl

curiouscoding.nl

2026

On the Energy Usage for Navier-Stokes original ↗

15 Sept 2026

Possible improvements to the QuickHeap original ↗

10 Sept 2026

The Anti-Lexicographic SUS-anchor original ↗

1 Sept 2026

Scans of some rare papers original ↗

24 Aug 2026

NtHash3: first ideas original ↗

31 Jul 2026

A seed-independent hash collision in GxHash original ↗

30 Jul 2026

Kayaking in Latvia: Engure, Rinda, and Irbe rivers original ↗

22 Jul 2026

Sassy 1 & 2: Fuzzy searching DNA using SIMD original ↗

5 Jul 2026

Sassy: fuzzy searching DNA sequences using SIMD original ↗

3 Jun 2026

The Jump Index original ↗

25 May 2026

STPD: Compressing Suffix Trees by Path Decompositions original ↗

25 May 2026

QuickHeap original ↗

18 May 2026

Spring update original ↗

12 May 2026

The Anti-Lexicographic SUS-Anchor: an Empirically Optimal Selection Scheme original ↗

11 May 2026

Range Minimum Queries original ↗

10 May 2026

List of interesting blogs original ↗

4 May 2026

Succinct trees original ↗

4 May 2026

High Throughput Bioinformatics: Theory to/from Practice original ↗

28 Apr 2026

Elias-Fano coding original ↗

27 Apr 2026

Rank & Select original ↗

27 Apr 2026

Advanced Data Structures original ↗

20 Apr 2026

Models of computation original ↗

20 Apr 2026

NordVPN refund dark patterns original ↗

2 Mar 2026

Route Planning using Customizable Contraction Hierarchies original ↗

1 Mar 2026

Wheeler graphs original ↗

25 Feb 2026

A history of pairwise alignment original ↗

17 Feb 2026

QuadRank: Engineering a High-Throughput Rank original ↗

17 Feb 2026

DEFLATE, gzip, zlib, libz, et al.original ↗

8 Feb 2026

QuadRank: Engineering a High Throughput Rank original ↗

28 Jan 2026

Recent results on hash tables original ↗

27 Jan 2026

Releasing Rust SIMD binaries to GitHub, BioConda, and PyPI original ↗

24 Jan 2026

Trying to understand DDR memory original ↗

19 Jan 2026

Quotes from "The Evolution of Mathematical Software"original ↗

17 Jan 2026

2025

HPRC v2 stats original ↗

25 Dec 2025

Asymptotic elevators original ↗

21 Dec 2025

Overview of static data structures original ↗

16 Dec 2025

Writing typst in emacs original ↗

11 Dec 2025

Distributing Rust SIMD Binaries original ↗

19 Nov 2025

Thoughts on "Static Retrieval Revisited"original ↗

3 Nov 2025

Thoughts on Singletrack original ↗

3 Nov 2025

Past, ongoing, and future research plans original ↗

5 Oct 2025

Three log scientist original ↗

11 Aug 2025

QuickHeap: the fastest priority queue original ↗

10 Aug 2025

Chunking for Fasta Parsing original ↗

5 Aug 2025

40x Faster Binary Search original ↗

19 Jul 2025

PtrHash original ↗

19 Jul 2025

SimdQuickHeap:original ↗

19 Jul 2025

Software original ↗

29 Apr 2025

Understanding GreedyMini original ↗

26 Apr 2025

Optimal Throughput Bioinformatics original ↗

9 Apr 2025

Thesis: Optimal Throughput Bioinformatics original ↗

9 Apr 2025

A History of Pairwise Alignment original ↗

8 Apr 2025

Low Density Minimizers original ↗

7 Apr 2025

Beyond Global Alignment original ↗

6 Apr 2025

High Throughput Bioinformatics original ↗

5 Apr 2025

Path Pruning Revisited original ↗

30 Mar 2025

SimdSketch: a fast bucket sketch original ↗

8 Mar 2025

Types of tigs original ↗

8 Mar 2025

Near-optimal sampling schemes original ↗

26 Feb 2025

Minimizer papers original ↗

16 Feb 2025

Binary search variants and the effects of batching original ↗

11 Feb 2025

Thoughts on Consensus MPHF and tiny pointers original ↗

11 Feb 2025

PtrHash: Minimal Perfect Hashing at RAM Throughput original ↗

2 Feb 2025

Code snippets for Latex, Rust, and Python original ↗

14 Jan 2025

Setting up traffic monitoring using GoAccess original ↗

3 Jan 2025

2024

Static search trees: 40x faster than binary search original ↗

17 Dec 2024

Comments on Brisk original ↗

28 Nov 2024

Comments on GreedyMini original ↗

3 Nov 2024

Comments on 'When Less is More' minimizer review original ↗

14 Oct 2024

A lemma on suffix array searching original ↗

4 Oct 2024

FM-index implementations original ↗

1 Oct 2024

Practical minimizers original ↗

11 Sept 2024

Calling Rust from Python original ↗

9 Sept 2024

AI reading list original ↗

8 Sept 2024

PACE 24 original ↗

4 Sept 2024

[WIP] Feynman problems original ↗

11 Aug 2024

SimdMinimizers: Computing random minimizers, fast original ↗

11 Jul 2024

Links for talks & posters original ↗

30 Jun 2024

A near-tight lower bound on minimizer density original ↗

24 Jun 2024

Tools for suffix array searching original ↗

13 Jun 2024

Crates for suffix array construction original ↗

12 Jun 2024

Thoughts on POASTA original ↗

27 May 2024

A*PA2: Up to 19x faster exact global alignment original ↗

22 Mar 2024

Review of refined minimizes original ↗

25 Jan 2024

Mod-minimizers and other minimizers original ↗

17 Jan 2024

Intro to Rust original ↗

15 Jan 2024

Notes on bidirectional anchors original ↗

14 Jan 2024

Notes on SsHash original ↗

14 Jan 2024

One Billion Row Challenge original ↗

2 Jan 2024

2023

NtHash1: making it perfect original ↗

30 Dec 2023

A*PA talk @ CWI original ↗

26 Dec 2023

Notes on implementing Longest Common Repeat (LCR)original ↗

5 Dec 2023

ALPACA/PANGAIA winter workshop notes original ↗

19 Nov 2023

Notes on writing course original ↗

13 Nov 2023

BAPCtools instruction original ↗

16 Oct 2023

PtrHash: Notes on adapting PTHash in Rust original ↗

20 Sept 2023

BBHash: some ideas original ↗

3 Sept 2023

BitPAl bitpacking algorithm original ↗

2 Sept 2023

Shortest paths, bucket queues, and A* on the edit graph original ↗

28 Jul 2023

Research proposal: subquadratic string graph construction original ↗

9 Jul 2023