🐿️ ScourBrowse
LoginSign Up
You are offline. Trying to reconnect...
Copied to clipboard
Unable to share or copy to clipboard
🔗 Topological Sorting

Dependency Resolution, Build Systems, Package Management, Graph Algorithms

NaviAgent: Bilevel Planning on Tool Dependency Graphs for Function Calling
arxiv.org·13h
⚡Effectful Programming
In which I write a library-quality B+ tree with the genies
tidyfirst.substack.com·2h·
Discuss: Substack
🦀Rust Macros
Build It Clean: Large-Scale Detection of Code Smells in Build Scripts
arxiv.org·1d
🔄Reproducible Builds
Diving deep into Binius M3 arithmetization using Merkle tree inclusion as an example
blog.lambdaclass.com·1d
🌳Archive Merkle Trees
Single Core Hundred Thousand Concurrency(1750866547511600)
dev.to·1h·
Discuss: DEV
🌊Stream Processing
Kumo Surfaces Structured Data Patterns Generative AI Misses
thenewstack.io·3h
📊Graph Databases
Greedy Is Good. Less Greedy May Be Better
gojiberries.io·16h·
Discuss: Hacker News
🧮Kolmogorov Complexity
HariSekhon/DevOps-Bash-tools
github.com·16h
🐚Shell Automation
New: Improve Apache Iceberg query performance in Amazon S3 with sort and z-order compaction
aws.amazon.com·21h
🔄Burrows-Wheeler
Ratcheting to zero: How incremental constraints eliminate technical debt
testdouble.com·1d
⚡Incremental Computation
Slashing CI Costs at Uber
uber.com·7h·
Discuss: Hacker News
🔄Reproducible Builds
Shane Kennedy - Software Engineer
shaneikennedy.xyz·1d
🦀Rust Macros
The Product Topology, or, How Not to Stumble into the Box Topology
relatedwork.blogspot.com·2d·
Discuss: relatedwork.blogspot.com
🏗️Constructive Mathematics
🧠 Solving LeetCode Until I Become Top 1% — Day `30`
dev.to·9h·
Discuss: DEV
📐Error Bounds
Lessons from LangChain and Slack and MCP Integration
medium.com·20h·
Discuss: Hacker News
✨Effect Handlers
Make Sense of a 10K+ Line GitHub Repos Without Reading the Code
kdnuggets.com·1d
🌿git
The Interactive Handbook on Data Structures and Algorithms
cartesian.app·1d·
Discuss: Lobsters, Hacker News, Hacker News
🌳Trie Structures
Computing Betti tables and minimal presentations of zero-dimensional persistent homology
arxiv.org·1d
🕸️Algebraic Topology
The most efficient algorithm for detecting claws in general graphs, with a runtime of O(m Δ) — where m is the number of edges and Δ is the maximum degree — is n...
dev.to·1d·
Discuss: DEV
🕸️Graph Algorithms
Beyond Frameworks: How Computer Science Fundamentals Forge the Complete Developer
dev.to·3h·
Discuss: DEV
📏Code Metrics
Loading...Loading more...
AboutBlogChangelogRoadmap