🐿️ ScourBrowse
LoginSign Up
You are offline. Trying to reconnect...
Copied to clipboard
Unable to share or copy to clipboard
⚡ Incremental Computation

Adapton, Self-adjusting Computation, Change Propagation, Build Systems

Computational phylogeny of Indo-European
languagelog.ldc.upenn.edu·1d
🔤Morphological Analysis
The Power and Beauty of Incrementalism
supernuclear.substack.com·1d·
Discuss: Substack
🔲Cellular Automata
GitHub Models now supports moving beyond free limits
github.blog·2d·
Discuss: Hacker News
🔌Interface Evolution
Show HN: Daf·thunk – open-source Editor for Prototyping Workflows on Cloudflare
dafthunk.com·1d·
Discuss: Hacker News
🔓Open Source Software
How Broadcom is quietly plotting a takeover of the AI infrastructure market
theregister.com·1d·
Discuss: Hacker News
🖥️Modern Terminals
Next Generation of Red Teaming for LLM Agents
promptfoo.dev·2d·
Discuss: Hacker News
⚡Proof Automation
Mastering Dijkstra's Algorithm in C++ with CXXGraph
medium.com·2d·
Discuss: Hacker News
📐E-graphs
From expected to actual: Kotlin doesn't reinvent, it reuses 🔄
dev.to·2d·
Discuss: DEV
💧Liquid Types
The Engineering Tradeoffs Behind HNSW-Based Vector Search
dev.to·2d·
Discuss: DEV
🗂️Vector Databases
Building Your Own DSL with @resultBuilder in Swift: HTML Builder
dev.to·20h·
Discuss: DEV
🔤DSLs
Agentic AI: Implementing Long-Term Memory
towardsdatascience.com·4d
💾Persistence Strategies
Flame Graph Performance Truth Analysis(1750839255230100)
dev.to·3d·
Discuss: DEV
⚡Performance Tools
Building a Super Mario-Style Platformer Game with Amazon Q Developer
dev.to·1d·
Discuss: DEV
🖥️Modern Terminals
Running External Commands in C# and Wait Until They Finish
dev.to·9h·
Discuss: DEV
🐚Shell Calculus
Optimal Single-Policy Sample Complexity and Transient Coverage for Average-Reward Offline RL
arxiv.org·1d
🧮Kolmogorov Complexity
Fast and Distributed Equivariant Graph Neural Networks by Virtual Node Learning
arxiv.org·3d
🌀Riemannian Computing
Advanced Path of Network Programming Deep Exploration from TCP to Application Layer Protocols(1751016812847900)
dev.to·1d·
Discuss: DEV
🌐Network Protocols
🧠 Solving LeetCode Until I Become Top 1% — Day `32`
dev.to·1d·
Discuss: DEV
🌳Trie Structures
Unlasting: Unpaired Single-Cell Multi-Perturbation Estimation by Dual Conditional Diffusion Implicit Bridges
arxiv.org·1d
🌀Riemannian Computing
Drift-Adaptive Slicing-Based Resource Management for Cooperative ISAC Networks
arxiv.org·1d
🕸️Network Topology
Loading...Loading more...
AboutBlogChangelogRoadmap