Skip to main content
Scour
Browse
Getting Started
Login
Sign Up
You are offline. Trying to reconnect...
Close
You're currently offline. Some features may not work.
Close
Copied to clipboard
Close
Unable to share or copy to clipboard
Close
🎰 Treap
Randomized BST, Binary Heap, Cartesian Tree, Priority Search
Filter Results
Timeframe
Fresh
Past Hour
Today
This Week
This Month
Feeds to Scour
Subscribed
All
Scoured
76542
posts in
971.6
ms
Binary
Search Trees: Why They’re Great in Memory but Terrible on
Disk
dev.to
·
1d
·
Discuss:
DEV
🌲
Btree
Build a
Compiler
in Five Projects
kmicinski.com
·
2h
🔨
Compilers
Time-Complexity Characterization of
NIST
Lightweight
Cryptography
Finalists
arxiv.org
·
1d
#️⃣
Perfect Hashing
Constrained parallel
tempering
in
traveling-salesman
problems with circular neighborhoods
link.aps.org
·
1h
📮
Multi-producer Queues
ArthurHeymans/emacs-tramp-rpc
: High-performance TRAMP backend using
JSON-RPC
instead of shell parsing
github.com
·
9h
·
Discuss:
Lobsters
,
Hacker News
🚀
Shuttle
Efficient Bayesian
Sieve
Modeling for Predicting Twin Prime Density in Large Numerical Ranges **Abstract** The distribution of twin
primes
—pairs of
primes
se...
freederia.com
·
1d
📊
HyperLogLog
Intersection
of Two Linked
Lists
dev.to
·
18h
·
Discuss:
DEV
🌳
Fenwick Trees
Sampling the
Oxford
CS
Library
blog.computationalcomplexity.org
·
3d
·
Discuss:
blog.computationalcomplexity.org
#️⃣
Hash Tables
A Faster
WBT/SBT
Implementation Than Linux
RBT
typecombinator.github.io
·
4d
·
Discuss:
r/cpp
🌲
Splay Trees
Santa
's Big Secret
yamlscript.org
·
6h
🔵
Clojure
feldera/feldera
: The
Feldera
Incremental
Computation Engine
github.com
·
2h
🔄
Salsa
Merkle
trees and build systems with
OSTree
and ninja
lwn.net
·
1d
·
Discuss:
Hacker News
🏗️
Build Systems
ahead-of-time wasm
gc
in
wastrel
wingolog.org
·
20h
·
Discuss:
Lobsters
,
Hacker News
🎯
WASM Runtime
The ‘Super Bowl’ standard:
Architecting
distributed systems for massive
concurrency
infoworld.com
·
2d
📡
Event-Driven Architecture
Humane
, adaptive AI
bootstrapping
natemeyvis.com
·
21h
⚓
Anchors
Deterministic Retrieval at Scale: Optimal-Space
LCP
Indexing
and 308x Energy Reduction on Modern GPUs
arxiv.org
·
1d
🚀
Milvus
10-Part Series on
Breadth-First
Traversals
in Haskell
doisinkidney.com
·
1d
·
Discuss:
Hacker News
🌳
Fenwick Trees
Lessons from
BF-Tree
: Building a
Concurrent
Larger-Than-Memory Index in Rust
zhihanz.github.io
·
2d
·
Discuss:
Hacker News
🏛️
Region-Based Memory
[$]
Modernizing
swapping
: the end of the swap map
lwn.net
·
1d
🔐
Futexes
Concurrency Flavours --
Lucian
Radu
Teodorescu
: Standard C++
isocpp.org
·
2d
🔄
Concurrency
Loading...
Loading more...
Page 2 »
Keyboard Shortcuts
Navigation
Next / previous item
j
/
k
Open post
o
or
Enter
Preview post
v
Post Actions
Love post
a
Like post
l
Dislike post
d
Undo reaction
u
Recommendations
Add interest / feed
Enter
Not interested
x
Go to
Home
g
h
Interests
g
i
Feeds
g
f
Likes
g
l
History
g
y
Changelog
g
c
Settings
g
s
Browse
g
b
Search
/
Pagination
Next page
n
Previous page
p
General
Show this help
?
Submit feedback
!
Close modal / unfocus
Esc
Press
?
anytime to show this help