Algorithms

⚙️ Algorithms

novel algorithms, computational methods, algorithmic design, processing techniques

Feeds to Scour
SubscribedAll
Scoured 328 posts in 13.2 ms

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

 📈Optimization
zenodo.org··Hacker News

Why Postgres TOAST does almost nothing for time-series, and what TimescaleDB does instead (disclosure: my company blog)

 🔄Data Processing
roszigit.com··r/PostgreSQL

Random Proposals: A Softmax-Based Local-Improvement Framework for Maximum Weighted Matching

 📈Optimization  Content type: Academic
arxiv.org·

Researchers develop AI-powered railway control system for efficient urban train operation

 🌐Distributed Systems
techxplore.com·

Presentation: Beyond Speed Limits: Exploring the Performance Power of Valkey

 🔄Data Processing  Content type: News
infoq.com
·

crafting with code: how architects reinvent making through robotics and digital fabrication

 📈Optimization
designboom.com·

Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds

 📈Optimization  Content type: Academic
arxiv.org·

fix(agents): prevent ReDoS in background-session name derivation (#91… · openclaw/openclaw@e498d39

 🐧Operating Systems  Content type: Code
github.com·

Generators: the API for traversal, iteration and non-determinism:

 🔓Lock-free Programming
okmij.org·

Bipolar Disorder Linked to Less Efficient Brain Wiring Networks

 🧠Psychology
neurosciencenews.com·

Real-time fraud detection for financial transactions

 🔄Data Processing  Content type: Blog
redis.io·

Sketching Intersection Profiles: A Simple Proof and Three Applications

 📈Optimization  Content type: Academic
arxiv.org·

Understanding Principal Component Analysis (PCA)

 📈Optimization  Content type: Blog
medium.com·

Bitcoin Kernel dev/Bitcoin Core maintainer on validation logic in Bitcoin Core

 🐧Operating Systems
thecharlatan.ch·

Language Models for Programming — Will Richardson

 ⚡Concurrency
willhbr.net·

Binary Search Variants: A Comprehensive Analysis

 🔓Lock-free Programming  Content type: Academic
arxiv.org·

A unified complexity bound for logconcave sampling

 📈Optimization  Content type: Academic
arxiv.org·

Random Generation of $k$-coloured Motzkin Paths

 ⚡Concurrency  Content type: Academic
arxiv.org·

I built my own minimal POSIX-compliant shell in C (7sh) and published it to the AUR!

 🐧Operating Systems  Content type: Code
github.com··r/C_Programming

Learning with Simulators: No Regret in a Computationally Bounded World

 📈Optimization  Content type: Academic
arxiv.org·
Sign up or log in to see more results
Sign UpLogin

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