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
๐๏ธ Data Structures
trees, graphs, hash tables, linked lists
Filter Results
Timeframe
Fresh
Past Hour
Today
This Week
This Month
Feeds to Scour
Subscribed
All
Scoured
186606
posts in
25.3
ms
On weak
greedy
algorithms
ย
๐
Algorithms
arxiv.org
ยท
21h
Near-Optimal
Heaps
and
Dijkstra
on Pointer Machines
ย
๐
Algorithms
arxiv.org
ยท
2d
Clustering
Permutations
under the
Ulam
Metric: A Parameterized Complexity Study
ย
๐
Algorithms
arxiv.org
ยท
1d
Polynomial-time
completion of
phylogenetic
tree sets
ย
๐ป
Bioinformatics
arxiv.org
ยท
2d
Maximum Matching and Related Problems in
Catalytic
Logspace
ย
๐
Algorithms
arxiv.org
ยท
2d
Regular
Grammars
as Effective Representations of
Recognizable
Sets of Series-Parallel Graphs
ย
๐
Algorithms
arxiv.org
ยท
2d
Tight Bounds for some W[1]-hard Problems
Parameterized
by
Multi-clique-width
ย
๐
Algorithms
arxiv.org
ยท
1d
The Network
Structure
of
Mathlib
ย
๐ง
Distributed Systems
arxiv.org
ยท
1d
On the Hardness of Finding
Temporally
Connected
Subgraphs
of Any Size
ย
๐
Algorithms
arxiv.org
ยท
2d
A more versatile model for
enumerative
kernelization
: a case study for Vertex Cover
ย
๐
Algorithms
arxiv.org
ยท
2d
Two Efficient
Message-passing
Exclusive
Scan
Algorithms
ย
๐
Algorithms
arxiv.org
ยท
1d
Characterizations
of
Admissible
Objective Functions for Hierarchical Clustering
ย
๐
Algorithms
arxiv.org
ยท
2d
Maximum
Weight Independent Set in
Hereditary
Classes of Ordered Graphs
ย
๐
Algorithms
arxiv.org
ยท
2d
On the
complexity
of edge
subdivision
to $H$-free graphs
ย
๐
Algorithms
arxiv.org
ยท
2d
BrickNet
: Graph-Backed Generative Brick
Assembly
ย
๐
RAG
arxiv.org
ยท
2d
Expander
Hierarchies
for Normalized Cuts on Graphs
ย
๐
Algorithms
arxiv.org
ยท
3d
Single-Source Shortest Paths and Almost Exact
Diameter
in
Pseudodisk
Graphs
ย
๐ง
Distributed Systems
arxiv.org
ยท
2d
SimdQuickHeap
: The
QuickHeap
Reconsidered
ย
๐๏ธ
System Design
arxiv.org
ยท
1d
Navigating Order-(
Dis
)Order Family Trees via
Group-Subgroup
Transitions
ย
๐
Algorithms
arxiv.org
ยท
6d
Evaluating Large Language Models on Computer Science University
Exams
in Data
Structures
ย
๐ง
LLM Training
arxiv.org
ยท
2d
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