Skip to main content
Scour
Browse
Getting Started
Login
Sign Up
You are offline. Trying to reconnect...
Copied to clipboard
Unable to share or copy to clipboard
馃М Computer science
Broad
algorithms, data structures
Filter Results
Timeframe
Fresh
Past Hour
Today
This Week
This Month
Feeds to Scour
Subscribed
All
Scoured
186714
posts in
30.3
ms
Algorithmic
Perfection
聽
馃З
Cellular Automata
lesswrong.com
路
6d
Meta-Theorems
for
Cuttable
Distributed Problems
聽
馃寪
Distributed systems
arxiv.org
路
8h
The
Myers
diff
algorithm: part 1
聽
馃摎
Programming language theory
blog.jcoglan.com
路
6d
路
Hacker News
Possibly
all the ways to get loop-finding in
graphs
wrong
聽
馃搻
Computational Geometry
news.ycombinator.com
路
4d
路
Hacker News
Generalized Compare-and-Swap and Space-Efficient Universal
Constructions
for the
Infinite-Arrival
Model
聽
馃寪
Distributed systems
arxiv.org
路
8h
Deterministic Single Exponential Time Algorithms for Co-Path Packing and Co-Path Set
Parameterized
by
Treewidth
聽
馃搻
Computational Geometry
arxiv.org
路
8h
Equilibria
in Multiplayer Graph Games: An
Algorithmic
Study
聽
馃寪
Distributed systems
arxiv.org
路
8h
I'm not
mutable
, I'm partially
instantiated
聽
馃摎
Programming language theory
news.ycombinator.com
路
4d
路
Hacker News
Super-linear Lower Bounds for
CSP
Non-Redundancy
via Shrinking Instances
聽
馃摎
Programming language theory
arxiv.org
路
8h
Draft Less,
Retrieve
More: Hybrid Tree Construction for
Speculative
Decoding
聽
馃摎
Programming language theory
arxiv.org
路
8h
The power of
interning
: making a time series database
smaller
聽
馃摎
Programming language theory
news.ycombinator.com
路
4d
路
Hacker News
DialSort
: Non-Comparative Integer Sorting via the Self-Indexing Principle: Architecture, Implementation, and
Substrate-Aware
Analysis
聽
馃摎
Programming language theory
arxiv.org
路
1d
The
Counting
General
Dominating
Set Framework
聽
馃搻
Computational Geometry
arxiv.org
路
8h
Transforming
Constraint
Programs to Input for Local Search
聽
馃摎
Programming language theory
arxiv.org
路
8h
Early-Stabilizing
Counting
聽
馃寪
Distributed systems
arxiv.org
路
1d
Hardness
and Approximation for Coloring
Digraphs
聽
馃搻
Computational Geometry
arxiv.org
路
8h
Improved Parallel Algorithms for
EF1
Allocations
聽
馃寪
Distributed systems
arxiv.org
路
1d
Revisiting the Maximum
Defective
Clique
Problem: Faster Branching and a Tighter Upper Bound
聽
馃寪
Distributed systems
arxiv.org
路
1d
Computing points in connected components defined by a real
inequation
: algorithms, complexity and
implementations
, Part I
聽
馃搻
Computational Geometry
arxiv.org
路
1d
Loaded
Dice: Solving the Non-Selection Problem for Scalable Probabilistic
RowHammer
Defense
聽
馃寪
Distributed systems
arxiv.org
路
1d
« Page 1
路
Page 3 »
Log in to enable infinite scrolling
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
Save / unsave
s
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