Algorithms

algorithm design, graph algorithms, complexity, dynamic programming

Feeds to Scour
SubscribedAll
Scoured 100 posts in 6.1 ms

The coding interview patterns, explained by building them

 🌲Data Structures  Content type: Tutorial
iwtlp.com··DEV

DBHN-Net: Dual-Branch Hybrid Neural Network For Low-Complexity Monaural Speech Enhancement

 🐛Fuzzing  Content type: Academic
arxiv.org·

Notes on Algorithms

 🌲Data Structures
lesswrong.com·

Dynamic Programming Explained Visually: Memoization, Tabulation, and the Patterns That Stick

 🌲Data Structures  Content type: Blog
tryexpora.com··DEV

Reinforcement Learning and Optimal Control Book (RIP Dimitri Bertsekas)

 🌲Data Structures  Content type: Academic
web.mit.edu··Hacker News

AI Isn’t Replacing Engineers, It’s Quietly Crashing Our Infrastructure | by Oz | The Tech Notes | May, 2026

 👑Leader Election  Content type: Blog
medium.com
·

A Proof on the Computational Complexity of the Traveling Salesman Problem: Why P ≠ NP

 🕸️Graph Theory
zenodo.org··Hacker News

Are Neural Networks Collision Resistant?

 🗂️Vector Indexes
link.aps.org·

RL in discrete world — Dynamic Programming — Part2: Generalized Policy Iteration (GPI)

 🌲Data Structures  Content type: Blog
medium.com
·

TiruArt/Pedigree-Polytopes-Lean4: Lean 4 machine-verified proof that Membership Problem for Pedigree Polytopes, M3P ∈ P and P = NP via properties of Pedigree Polytopes.

 🕸️Graph Theory  Content type: Code
github.com··Hacker News

Turing universal neural networks do not require global clocks

 🐛Fuzzing  Content type: Academic
nature.com··Hacker News

Multilingual Word-Level Forced Alignment with Self-Supervised Representations and Learned Dynamic Programming

 🌲Data Structures  Content type: Academic
arxiv.org·

STITCH: Spatial Transcriptomics Imputation via Flow Matching with Internal Learning

 📇Vector Indexing  Content type: Academic
biorxiv.org·

How did software get so reliable without proof? (1996)

 🔄Eventual Consistency  Content type: Discussion
lobste.rs··Lobsters

Towards Implementable Quantum Divide and Conquer: A TSP Solver with Improved Exponential Base over Held-Karp

 🌲Data Structures  Content type: Academic
arxiv.org·

The price of incrementality in k-center clustering

 💰Cost-Based Optimization  Content type: Academic
arxiv.org·

On the Complexity of Signed Domination

 🕸️Graph Theory  Content type: Academic
arxiv.org·

Rayforce

 🗂️Vector Indexes  Content type: Code

Efficient Minimal Solvers for Visual-Inertial Relative Pose Estimation in Multi-Camera Systems

 SIMD Vectorization  Content type: Academic
arxiv.org·

Sim2Schedule: A Simulator-Guided LLM Framework for Autonomous Open-Pit Mine Scheduling

 ⚙️Tokio  Content type: Academic
arxiv.org·

Keyboard Shortcuts

Navigation

Next / previous item
j/k
Open post
oorEnter
Preview post
v

Post Actions

Love post
a
Like post
l
Dislike post
d
Undo reaction
u
Save / unsave
s

Recommendations

Add interest / feed
Enter
Not interested
x

Go to

Home
gh
Interests
gi
Feeds
gf
Likes
gl
History
gy
Changelog
gc
Settings
gs
Browse
gb
Search
/

General

Show this help
?
Submit feedback
!
Close modal / unfocus
Esc

Press ? anytime to show this help