Feeds to Scour
SubscribedAll
Scoured 185943 posts in 31.7 ms
Can C++ Data Oriented Design Be ONE MILLION Times Faster?  ⚙️C++
ziggit.dev·5d
Making sense of ‘genetic programs’: biomolecular Post–Newell production systems  🌐Distributed Systems
philsci-archive.pitt.edu·3d
Advanced Python Interactive Guide  🐍Python
pynsights.vercel.app·3d·DEV, Hacker News
Futhark by Example  ⚙️Compilers
futhark-lang.org·4d·Hacker News
A constant-space linear-time algorithm for deleting all but the 10 most recent files in a directory  🧠Memory Management
devblogs.microsoft.com·6d
Networks Are Graphs, Not Language Problems: A Look at NetAI’s GNN Approach  🌐Distributed Systems
solutional.com·6d
Draft Less, Retrieve More: Hybrid Tree Construction for Speculative Decoding  ⚙️Compilers
arxiv.org·19h
Icy-DVRF: A Distributed Verifiable Random Function based on FROST signatures  🌐Distributed Systems
eprint.iacr.org·5d
Scale-Free Communication? An investigation of the use of the concept “communication” in biology and cognitive sciences  🌐Distributed Systems
philsci-archive.pitt.edu·6d
Deterministic Single Exponential Time Algorithms for Co-Path Packing and Co-Path Set Parameterized by Treewidth  🧮Algorithms
arxiv.org·19h
Resolving deletion in AVL trees  🧠Memory Management
github.com
·4d·DEV
Retrofitting spatial safety to lines of C++  ⚙️Compilers
news.ycombinator.com·4d·Hacker News
Equilibria in Multiplayer Graph Games: An Algorithmic Study  🌐Distributed Systems
arxiv.org·19h
Decoding collective dynamics and complexity in nanoparticle assemblies using graph theory  🧮Algorithms
science.org·6d
Mathematical Informatics: Algorithms  🧮Algorithms
arxiv.org·1d
Super-linear Lower Bounds for CSP Non-Redundancy via Shrinking Instances  🧮Algorithms
arxiv.org·19h
Satisfiability Modulo Extensional Constant Arrays (Extended Version)  🧩LeetCode
arxiv.org·19h
Computing points in connected components defined by a real inequation: algorithms, complexity and implementations, Part I  🧮Algorithms
arxiv.org·1d
Satisfiability for Knowing How over Linear Plans is NP-complete  🧩LeetCode
arxiv.org·19h
Optimizing Computational-Statistical Runtime for Wasserstein Distance Estimation  🧮Algorithms
arxiv.org·19h

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