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
πΈοΈ Graph Theory
graph algorithms, hypergraphs, DAGs, graph structures
Filter Results
Timeframe
Fresh
Past Hour
Today
This Week
This Month
Feeds to Scour
Subscribed
All
Scoured
227
posts in
8.3
ms
Online Graph
Balancing
and the Power of Two
Choices
Β
π
Algorithms
arxiv.org
Β·
3d
Floyd
's
Sampling
Algorithm
Β
π
Algorithms
NULL BITMAP by Justin Jaffray via buttondown.com
Β·
3d
Β·
Hacker News
Toward a
Uniform
Algorithm and
Uniform
Reduction for
Constraint
Problems
Β
π
Algorithms
arxiv.org
Β·
1d
Beyond Dense Connectivity:
Explicit
Sparsity
for Scalable Recommendation
Β
π°
Cost-Based Optimization
arxiv.org
Β·
3h
Polynomial
and
Pseudopolynomial
Algorithms for Two Classes of Bin Packing Instances
Β
π°
Cost-Based Optimization
arxiv.org
Β·
2d
HiMARS
: Hybrid multi-objective algorithms for
recommender
systems
Β
π
Vector Indexing
arxiv.org
Β·
3h
Contextual Chain: Single-State
Ledger
Design for Mobile/IoT Networks with Frequent
Partitions
Β
π€
Consensus Protocols
arxiv.org
Β·
1d
Improved Space-Time Tradeoffs for Permutation Problems via
Extremal
Combinatorics
Β
π
Algorithms
arxiv.org
Β·
2d
Uniform Sampling of Proper Graph
Colorings
via Soft Coloring and Partial
Rejection
Sampling
Β
π
Algorithms
arxiv.org
Β·
3d
Parameterized
algorithms for $k$-
Inversion
Β
π²
B-tree Variants
arxiv.org
Β·
2d
DAG
Projections
: Reducing Distance and Flow Problems to
DAGs
Β
π
Algorithms
arxiv.org
Β·
3d
JZ-Tree
: GPU friendly neighbour search and friends-of-friends with dual tree walks in
JAX
plus CUDA
Β
π³
B+ Trees
arxiv.org
Β·
2d
A characterization of one-sided error
testable
graph properties in bounded
degeneracy
graphs
Β
πΈ
Bloom Filters
arxiv.org
Β·
3d
The
Umeyama
algorithm for matching
correlated
Gaussian geometric models in the low-dimensional regime
Β
π
Algorithms
arxiv.org
Β·
2d
On the Price of Privacy for Language
Identification
and Generation
Β
π°
Cost-Based Optimization
arxiv.org
Β·
1d
An algorithmic Polynomial
Freiman-Ruzsa
theorem
Β
π
Algorithms
arxiv.org
Β·
3d
Autopoiesis
: A Self-Evolving System
Paradigm
for LLM Serving Under Runtime Dynamics
Β
βοΈ
Adaptive Execution
arxiv.org
Β·
1d
Dominating
Set with
Quotas
: Balancing Coverage and Constraints
Β
π
Algorithms
arxiv.org
Β·
3d
Tight
Bounds
on Window Size and Time for Single-Agent Graph Exploration under
T-Interval
Connectivity
Β
π
Algorithms
arxiv.org
Β·
3d
DAG
Covers: The
Steiner
Point Effect
Β
π
Vector Indexing
arxiv.org
Β·
3d
Loading...
Loading more...
Page 2 »
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