🎯 Van Emde Boas Trees - hello · Scour

Backtracking Algorithms

algos.khourani.com·14h

💃Dancing Links

B+-Tree Structure: How Order Is Maintained at Scale

dev.to·2d·

Discuss: DEV

Nearly-Linear Time Seeded Extractors with Short Seeds

arxiv.org·1d

📦Succinct Data Structures

A Note on Flat Abstract Syntax Trees

gist.github.com·1d·

Discuss: Hacker News

🌳Tree-sitter

Pretty Printing the ART (Adaptive Radix Tree) in DuckDB

artjomplaunov.github.io·2d

Incremental (k, z)-Clustering on Graphs

arxiv.org·1d

🕸️GraphBLAS

A Local Code Copilot for Edits: Why sweep-next-edit-1.5B Is Built for Speed

hackernoon.com·3h

🏗️Cranelift

Presentation: Are You Missing a Data Frame? The Power of Data Frames in Java

infoq.com

·1d

🐻‍❄️Polars

🌌Beginner-Friendly Guide 'Longest Balanced Subarray II' - Leetcode 3721 (C++, Python, JavaScript)

dev.to·1h·

Discuss: DEV

λFunctional Programming

The State of Agentic Graph RAG

localoptimumai.substack.com·17h·

Discuss: Substack

How to Build Reliable Incremental Models in dbt for Large Datasets: Production Lessons at Scale

pub.towardsai.net

·2h

⚡Incremental Computation

(C_4,triangle)--free graphs

graphclasses.org·1d

🕸️Graph Theory

A high-performance Go framework (250k+ req/sec) with built-in batteries

go-kvolt.github.io·18h

Rewrote my Node.js data generator in Rust. 20x faster, but the 15MB binary (vs 500MB node_modules) is the real win.

algomimic.com·8h·

Discuss: r/rust

Building a Regex Engine with a team of parallel Claudes

lesswrong.com·5h

Fibonacci numbers and time-space tradeoffs

johndcook.com·2d

⚖️Y-Fast Tries

This AI Tool Turns 400 Informal Names Into Accurate OMOP Code

hackernoon.com·7h

🔄Burrows-Wheeler Transform

Kosaraju's Algorithm is my Favorite

algos.khourani.com·9h

🔀Topological Sorting

Recursive self-improvement from AI models

marginalrevolution.com·11h·

Discuss: Hacker News

💬Prompt Engineering

[AINews] Qwen Image 2 and Seedance 2

latent.space·40m

Loading more...