📦 Succinct Data Structures - hello · Scour

Faster than Dijkstra?

systemsapproach.org·21h·

Discuss: Hacker News

🔗Graph Algorithms

BlitzReads: Free speed reading tool that displays one word/sentence at a time. No signup required.

blitzreads.com·2h·

Discuss: r/InternetIsBeautiful

Adding Myers Diff To Share Link Snapshots In Big Sexy Poems

bennadel.com·16h

📰Feed Readers

Forward Index Compression for Learned Sparse Retrieval

arxiv.org·3d

🌊Wavelet Trees

Coding A PoS Tagger from Scratch — A Statistical Part-of-Speech Tagger | NLP

pub.towardsai.net

·6h

[Productivity Game] SUMMARY: The Almanack of Naval Ravikant

kill-the-newsletter.com·4h

⏰Time Management

A Note on Flat Abstract Syntax Trees

gist.github.com·10h·

Discuss: Hacker News

🌳Tree-sitter

Vector Databases Explained: Architecture and System Design for AI Apps

dev.to·23h·

Discuss: DEV

🧮Vector Databases

The First Known Problem That Is FPT with Respect to Node Scanwidth but Not Treewidth

arxiv.org·23h

🌳Fenwick Trees

Quantized Tensor Train Compression For Turbulent Flow Simulation: O(log N) Scaling with Reynolds-Independent Bond Dimension

zenodo.org·16h·

Discuss: Hacker News

⏲️TimescaleDB Compression

The deep history of AI began 3,000 years ago

bigthink.com·13h

🗂️Obsidian

Casual For Registers, Rectangles, And Windows

irreal.org·12h

🔗 Processing 11 million rows in minutes instead of hours

yellowduck.be·1d

📊Vectorized Query Execution

Claude Code Power Tips

kdnuggets.com·11h

How does information flow?

thewaiterspad.com·18h

📊Information Theory

Fastfood: Approximate Kernel Expansions in Loglinear Time

dev.to·2d·

Discuss: DEV

Lucene HNSW performance: A deep dive into the OS page cache

opensearch.org·7h

Simplifying assertions with lenses

blog.ploeh.dk·14h

✅Property Testing

Early History of a Perfect Join Algorithm

remy.wang·2d

🔗Join Algorithms

The Douglass-Truth Library Has How Unlikely a Name? A Little Simulation in Python

healthyalgorithms.com·17h

🎲Deterministic Simulation

Loading more...