🧮 Algorithms - nickyfoto · Scour

Why A* Search Works — Heuristics, Shortest Paths, and Optimality 🕸️Graph Algorithms

zeromathai.com·1d·DEV

Hacker Newsletter #792 🔍Tech Criticism

HackerNews Letter via kill-the-newsletter.com·5d

Decomposing a Payment Gateway Integration ✍️Prompt Engineering

bashforce.com·3d·r/programming

id generators - from `Date.now()` to snowflake 🦀Rust

Counting Small Balanced (p,q)-bicliques in Signed Bipartite Graphs 🕸️Graph Algorithms

Anticipating the future in an algorithmic age 🤖AI Research

science.org·6d

std::swap(std::forward_list) (3) Linux Manual Page 🦀Rust

systutorials.com·6d

Fast Fourier Transforms Part 3: Bluestein’s Algorithm 🕸️Graph Algorithms

connorboyle.io·5d·r/compsci, r/programming

raulcd/datanomy: Dissecting data structures 📊Data Structures

Optimal Hardness of Online Algorithms for Large Common Induced Subgraphs 🕸️Graph Algorithms

An Optimal Algorithm for Cardinality-Constrained Diameter Partitioning 📊Data Structures

DamBuilderDev/JobSearchOptimizer: Experimental local job-search pipeline using Python, PowerShell, and LLM scoring. Shared as a sanitized recovery/architecture case study for human review. ☁️Cloud Computing

github.com·6d·r/learnpython

Bandits on graphs and structures 📊Data Structures

An $\widetilde{O} (n^{3/7})$ Round Parallel Algorithm for Matroid Bases 📊Data Structures

Parallel Reachability and Shortest Paths on Non-sparse Digraphs: Near-linear Work and Sub-square-root Depth 📊Data Structures

In-memory Multidimensional Indexing Using the skd-tree 📊Data Structures

Computing Planar Convex Hulls with a Promise 🕸️Graph Algorithms

Tree-independence number of $P_5$-free graphs with no large bicliques 🕸️Graph Algorithms

On Model-Based Clustering With Entropic Optimal Transport 👁️Computer Vision

A Poisson Process for Submodular Maximization 📊Data Structures

Sign up or log in to see more results

Log in to enable infinite scrolling