📦 Succinct Data Structures - hello · Scour

Data Structures and Algorithms Introduction

hellointerview.com·1d

🌳Data Structures

The lost-in-the-middle problem and why retrieval beats stuffing

dev.to·3h·

Discuss: DEV

📝Parser Combinators

Multi-Vector Index Compression in Any Modality

arxiv.org·4d

🗜️Roaring Bitmaps

Byte-Pair Encoding

en.wikipedia.org·1h·

Discuss: Hacker News

akalinux/orderedmap: A very fast Sorted Map for go

github.com·1d·

Discuss: r/golang

🗺️BTreeMap

RAG Explained for SQL Developers: Think of It as SELECT, But for Meaning

dev.to·22h·

Discuss: DEV

💰TigerBeetle

Introduction to Bloom Filters

hur.st·4h·

Discuss: DEV

🌸Bloom Filters

SmartChunk Retrieval: Query-Aware Chunk Compression with Planning for Efficient Document RAG

arxiv.org·2d

📊Vectorized Query Execution

Decision trees – the unreasonable power of nested decision rules

mlu-explain.github.io·1h·

Discuss: Hacker News

🌊Wavelet Trees

μpack: Faster & more flexible integer compression

blog.cf8.gg·2d·

Discuss: r/programming, r/rust

📏Run-Length Encoding

No-Frills Item Trackers

trendhunter.com·17h

📊VictoriaMetrics

Computer science eponyms

nick-black.com·3h

🧮Vector Databases

fastestcode.org

fastestcode.org·5h

11011110.github.io·15h

📐Computational Geometry

What Happens When a GPT Reads Your Message

pub.towardsai.net

·2h

Open multiple URLs or search terms at once — extension I built (open source, early stage)

chromewebstore.google.com·6h·

Discuss: r/browsers

Build Your Own Key-Value Storage Engine—Week 7

read.thecoder.cafe·2d

#️⃣Hash Tables

Dictionary of Algorithms and Data Structures

xlinux.nist.gov·3d·

Discuss: Lobsters

🌳Fenwick Trees

New comment by kristopolous in "What does " 2>&1 " mean?"

github.com·14h·

Discuss: Hacker News

TurboSparse-LLM Performance: Outperforming Mixtral and Gemma with Extreme Sparsity

hackernoon.com·1d

Loading more...