🌳 Data Structures - hello · Scour

The UNIX time-sharing system

dl.acm.org·1d

Computing Least Fixed Points with Overwrite Semantics in Parallel and Distributed Systems

arxiv.org·11h

🌳Mergeable Trees

Awesome OSINT For “Everything” Part 1

osintteam.blog

·1d

DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search

arxiv.org·1d

🎯Locality-Sensitive Hashing

The middle ground between canonical models and data mesh

frederickvanbrabant.com·2d·

Discuss: r/programming

🏗️Data Modeling

State of JavaScript 2025

i-programmer.info·1d

B-tree Ordered Containers

abseil.io·4d

2025 Q4 and 2026 Q1 Newsletter

odin-lang.org·1d

DynamoDB crash course: part 2

death.andgravity.com·2d

Introduction To Concurrency | Concurrency Interview | AlgoMaster.io

algomaster.io

·1d

🔄Concurrency

Towards a Standard for JSON Document Databases

muratbuffalo.blogspot.com·2d·

Discuss: Blogger

The Archive System (DevLog)

kruithne.net·1h·

Discuss: Hacker News

📁File Systems

🔗 The hidden cost of PostgreSQL arrays

yellowduck.be·1d

🗺️PostgreSQL Planner

Infrastructure as Code in Practice: What It Solves — and What It Doesn’t

hackernoon.com·2d

🏗️Terraform

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

algomimic.com·1d·

Discuss: r/rust

Operations on a B+-Tree: How the Search Works

dev.to·3d·

Discuss: DEV

DaCurse/mason: C Macros for JSON

github.com·2d·

Discuss: r/C_Programming

Issue #721: Classification With zstd, Callables, Gemini, and More (Feb. 10, 2026)

pycoders.com·1d

About the Information System on Graph Classes and their Inclusions

graphclasses.org·3d

🔗Graph Algorithms

How ‘effectively zero-knowledge’ proofs could transform cryptography

scientificamerican.com

·1d

🔢Homomorphic Encryption

Loading more...