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, Complexity, Graph Theory, Optimization
Filter Results
Timeframe
Fresh
Past Hour
Today
This Week
This Month
Feeds to Scour
Subscribed
All
Scoured
186636
posts in
27.4
ms
Fast Core
Identification
聽
馃
AI
arxiv.org
路
21h
Revisiting finite
Abelian
hidden
subgroup
problem and its distributed exact quantum algorithm
聽
馃
AI
sciencedirect.com
路
5d
lucasimi/tda-mapper-python
: A simple and efficient Python implementation of Mapper algorithm for Topological Data Analysis
聽
馃
AI
github.com
路
4d
Incremental
Strongly
Connected Components with Predictions
聽
馃
Machine Learning
arxiv.org
路
21h
Path-Reporting Distance
Oracles
for
Vertex-Labeled
Graphs
聽
馃
AI
arxiv.org
路
21h
Rank
&
Select
聽
馃
AI
curiouscoding.nl
路
5d
Relation
morphisms
of directed graphs
聽
馃
AI
arxiv.org
路
21h
Weighted Emulators with Local
Heaviest
Edges Stretch for
Undirected
Graphs
聽
馃
AI
arxiv.org
路
21h
A
Sufficient-Statistic
Reduction of the Information Bottleneck to a Low-Dimensional Problem
聽
馃
Machine Learning
arxiv.org
路
21h
Exact Dynamic Programming for
Solow
--
Polasky
Diversity Subset Selection on Lines and Staircases
聽
馃
AI
arxiv.org
路
21h
On the Complexity of Robust
Markov
Decision Processes and
Bisimulation
Metrics
聽
馃
AI
arxiv.org
路
21h
Asymptotically
Robust Learning-Augmented Algorithms for Preemptive
FIFO
Buffer Management
聽
馃
AI
arxiv.org
路
21h
Tight Bounds for some W[1]-hard Problems
Parameterized
by
Multi-clique-width
聽
馃敩
Computer science research
arxiv.org
路
1d
Solve Crude Oil
Scheduling
Problems by Using
Quantum-Classical
Hybrid Algorithms
聽
馃
AI
arxiv.org
路
21h
Coloring for dispersion: A polynomial-time algorithm for
cardinality-constrained
2-anticlustering
聽
馃敩
Computer science research
arxiv.org
路
2d
Approximating
the Network Design Problem for Potential-Based
Flows
聽
馃
AI
arxiv.org
路
21h
A more versatile model for
enumerative
kernelization
: a case study for Vertex Cover
聽
馃
AI
arxiv.org
路
2d
RaMP: Runtime-Aware
Megakernel
Polymorphism
for Mixture-of-Experts
聽
馃
AI
arxiv.org
路
21h
DB-KSVD
: Scalable
Alternating
Optimization for Disentangling High-Dimensional Embedding Spaces
聽
馃
Machine Learning
arxiv.org
路
21h
Maximum Matching and Related Problems in
Catalytic
Logspace
聽
馃
AI
arxiv.org
路
2d
« 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