Biconnected components
emi-h.com·1d·
🕸️Tarjan Algorithms
Reinforced Generation of Combinatorial Structures: Applications to Complexity Theory
arxiv.org·2h
🪢Rope Data Structures
Automated Conformance Assessment of Smart Grid Device Profiles via Graph Neural Networks
dev.to·6h·
Discuss: DEV
👑Dominator Analysis
Program Optimisations via Hylomorphisms for Extraction of Executable Code
drops.dagstuhl.de·1h·
Discuss: Hacker News
🏗️Calculus of Constructions
Computation of Graph Polynomials via Tree Decomposition: Theory, Algorithms, and Python Implementation
arxiv.org·2h
🧮Combinator Calculus
connect-four-ai: A high-performance, perfect Connect Four solver
reddit.com·1d·
Discuss: r/rust
🧩Constraint Solvers
Minimizing an Uncrossed Collection of Drawings
arxiv.org·2h
🗺️Graph Traversal
Sketching approximations and LP approximations for finite CSPs are related
arxiv.org·2h
🎨Graph Coloring
Adhesive category theory for graph rewriting in Rocq
arxiv.org·2h
🔗Category Theory
SMART-3D: Three-Dimensional Self-Morphing Adaptive Replanning Tree
arxiv.org·2h
🌊Loop Invariant Motion
The FLP Theorem
shachaf.net·13h·
🤝Session Protocols
Compositional Interface Refinement Through Subtyping in Probabilistic Session Types
arxiv.org·2h
📞Session Types
Efficient & Correct Predictive Equivalence for Decision Trees
arxiv.org·2h
🌳Pattern Match Compilation
Code Reuse Without Classes: A Deep Dive into Non-OOP Reusability
dev.to·2h·
Discuss: DEV
🪢Rope Data Structures
Transforming Recursion into Iteration for LLVM Loop Optimizations
dspace.mit.edu·1d·
📚Stack Allocation
Virtual Arc Consistency for Linear Constraints inCost Function Networks
arxiv.org·2h
🧩Constraint Solvers
original ↗
redblobgames.com·1d
🚪Escape Hatch
Substrate-Timing-Independence for Meta-State Stability of Distributed Robotic Swarms
arxiv.org·2h
🏰Capability Machines
From domain-landmark graph learning to problem-landmark graph generation
arxiv.org·2h
📊Graph Compilers
On the Existence and Complexity of Core-Stable Data Exchanges
arxiv.org·2h
📮Message Queues