Skip to main content
Scour
Browse
Getting Started
Login
Sign Up
You are offline. Trying to reconnect...
Close
Copied to clipboard
Close
Unable to share or copy to clipboard
Close
📊 Algorithms
data structures, algorithmic complexity, graph algorithms, sorting
Filter Results
Timeframe
Fresh
Past Hour
Today
This Week
This Month
Feeds to Scour
Subscribed
All
Scoured
185991
posts in
24.5
ms
Incremental
Strongly
Connected Components with Predictions
🔄
Concurrency
arxiv.org
·
17h
Computational Complexity of the
Interval
Ordering
Problem
📐
CS Theory
arxiv.org
·
2d
On the Complexity of Robust
Markov
Decision Processes and
Bisimulation
Metrics
🕸️
Distributed Systems
arxiv.org
·
17h
Exact Dynamic Programming for
Solow
--
Polasky
Diversity Subset Selection on Lines and Staircases
🔍
Vector Search Algorithms
arxiv.org
·
17h
Maximum Matching and Related Problems in
Catalytic
Logspace
🚀
Query Optimization
arxiv.org
·
2d
[2406.19108] Computational Life: How
Well-formed
,
Self-replicating
Programs Emerge from Simple Interaction
🕸️
Distributed Systems
arxiv.org
·
23h
Weighted Emulators with Local
Heaviest
Edges Stretch for
Undirected
Graphs
🔍
Vector Search Algorithms
arxiv.org
·
17h
Coloring for dispersion: A polynomial-time algorithm for
cardinality-constrained
2-anticlustering
🗂️
Vector Indexes
arxiv.org
·
2d
A
Sufficient-Statistic
Reduction of the Information Bottleneck to a Low-Dimensional Problem
🔍
Vector Search Algorithms
arxiv.org
·
17h
Arboretum.hs
: Symbolic manipulation for
algebras
of graphs
📐
CS Theory
arxiv.org
·
1d
COPUS
: Co-adaptive
Parallelism
and Batch Size Selection in Large Language Model Training
🔄
Concurrency
arxiv.org
·
17h
On the Hardness of Finding
Temporally
Connected
Subgraphs
of Any Size
📐
CS Theory
arxiv.org
·
2d
Parsimonious
computational inference protocol for Boolean networks: Application to
osteogenesis
📇
Vector Indexing
arxiv.org
·
17h
Improved Hardness Results for Learning
Intersections
of
Halfspaces
📐
CS Theory
arxiv.org
·
2d
ComboStoc
: Combinatorial
Stochasticity
for Diffusion Generative Models
📇
Vector Indexing
arxiv.org
·
17h
On the
complexity
of edge
subdivision
to $H$-free graphs
📐
CS Theory
arxiv.org
·
2d
A more versatile model for
enumerative
kernelization
: a case study for Vertex Cover
🔍
Vector Search Algorithms
arxiv.org
·
2d
Polynomial-time
recognition and maximum independent set in
Burling
graphs
📐
CS Theory
arxiv.org
·
2d
Optimization-Free Topological Sort for Causal Discovery via the
Schur
Complement of Score
Jacobians
🔍
Vector Search Algorithms
arxiv.org
·
1d
Subword
enumeration up to stack-sorting
equivalence
🗂️
Vector Indexes
arxiv.org
·
1d
Sign up or log in to see more results
Sign Up
Login
« Page 2
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