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
🧮 Algorithms
Data Structures, Complexity, Problem Solving, Optimization
Filter Results
Timeframe
Fresh
Past Hour
Today
This Week
This Month
Feeds to Scour
Subscribed
All
Scoured
200062
posts in
25.4
ms
Mathematical
Informatics
: Algorithms
🔢
NumPy
arxiv.org
·
3h
Comprehensive Data
Structures
and
Algorithms
in Python
🗂️
Data Structures
amazon.in
·
2d
·
r/coding
The
Myers
diff
algorithm: part 1
🔢
Kolmogorov Complexity
blog.jcoglan.com
·
5d
·
Hacker News
Possibly
all the ways to get loop-finding in
graphs
wrong
🔢
Kolmogorov Complexity
chiark.greenend.org.uk
·
2d
A
Computability
Argument Against
Superintelligence
| Cognitive Computation
🔢
Kolmogorov Complexity
link.springer.com
·
5d
Computing points in connected components defined by a real
inequation
: algorithms, complexity and
implementations
, Part I
🔢
Kolmogorov Complexity
arxiv.org
·
3h
CAM-Bench: A Benchmark for Computational and Applied
Mathematics
in
Lean
🔢
NumPy
arxiv.org
·
3h
General-Purpose
Co-Evolutionary
Construction of Parallel Algorithm
Portfolios
for Multi-Objective Binary Optimization
🔢
Kolmogorov Complexity
arxiv.org
·
1d
New Algorithms for
Parity-SAT
and Its
Bounded-Occurrence
Versions
🔢
Kolmogorov Complexity
arxiv.org
·
4d
Achieving
Gold-Medal-Level
Olympiad
Reasoning via Simple and Unified Scaling
🔢
NumPy
arxiv.org
·
5d
Foundational Analysis Of The
Solvability
Complexity Index: The
Weihrauch-SCI
Intermediate Hierarchy
🔢
Kolmogorov Complexity
arxiv.org
·
4d
The Distributed
Complexity
Landscape on Trees
Depends
on the Knowledge About the Network Size
🕸️
Graph Theory
arxiv.org
·
5d
The Power of Graph Doubling: Computing
Ultrabubbles
in a Bidirected Graph by Reducing to Weak
Superbubbles
🕸️
Graph Theory
arxiv.org
·
5d
Performance bounds for
nearest
neighbor
search with k-d trees
🔢
Kolmogorov Complexity
arxiv.org
·
6d
Prime Successor
Irreducibility
: Turing Machine Complexity, Kolmogorov Complexity, and Weakness-Based
Formulations
🔢
Kolmogorov Complexity
arxiv.org
·
5d
Fast and effective
algorithms
for fair
clustering
at scale
🕸️
Graph Theory
arxiv.org
·
5d
zSort
: Stable Distribution Sort using Z-Score
Partitioning
🔢
Kolmogorov Complexity
arxiv.org
·
4d
CVEvolve
: Autonomous Algorithm Discovery for
Unstructured
Scientific Data Processing
🔢
Kolmogorov Complexity
arxiv.org
·
6d
Branch-width of
represented
matroids
in matrix multiplication time
🕸️
Graph Theory
arxiv.org
·
4d
Modeling
Heterophily
in
Multiplex
Graphs: An Adaptive Approach for Node Classification
🕸️
Graph Theory
arxiv.org
·
5d
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