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
📐 CS Theory
computer science, algorithms, complexity theory, computation
Filter Results
Timeframe
Fresh
Past Hour
Today
This Week
This Month
Feeds to Scour
Subscribed
All
Scoured
187257
posts in
24.4
ms
LLM-Assisted
Empirical
Software Engineering: Systematic
Literature
Review and Research Agenda
📐
TLA+
arxiv.org
·
23h
A more versatile model for
enumerative
kernelization
: a case study for Vertex Cover
🔍
Vector Search Algorithms
arxiv.org
·
2d
Approximating
the Network Design Problem for Potential-Based
Flows
🧠
Query Planners
arxiv.org
·
23h
Scalable Production
Scheduling
: Linear Complexity via Unified
Homogeneous
Graphs
🕸️
Distributed Systems
arxiv.org
·
2d
The
holonomy
braiding for $\mathcal{U}_\xi(\mathfrak{sl}_2)$ in terms of geometric quantum
dilogarithms
🤝
Paxos Consensus
arxiv.org
·
23h
Decomposition of
Automata
recognizing
Ideals
📐
TLA+
arxiv.org
·
1d
Characterizing Streaming
Decidability
of
CSPs
via Non-Redundancy
🔄
Concurrency
arxiv.org
·
6d
Multi-Objective
Optimization by
Quantum-Annealing-Inspired
Algorithms
🔍
Vector Search Algorithms
arxiv.org
·
23h
Improving
Reachability
in Vector Addition Systems through
Pumpability
📇
Vector Indexing
arxiv.org
·
2d
Large values in time series and
additive
combinatorics
📊
Algorithms
arxiv.org
·
6d
On the
enumeration
of
Tarski
fixed points
📊
Algorithms
arxiv.org
·
2d
Compile-Time
Tensor Shape Checking via
Staged
Shape-Dependent Types
📐
TLA+
arxiv.org
·
2d
The
Sample
Complexity of
Multicalibration
🗳️
Paxos Variants
arxiv.org
·
6d
Evaluating Large Language Models on Computer Science University
Exams
in Data
Structures
🔧
Compilers
arxiv.org
·
2d
Well-Conditioned
Oblivious
Perturbations
in Linear Space
🗂️
Vector Indexes
arxiv.org
·
2d
On first-order model checking
parameterized
by the number of
variables
📐
TLA+
arxiv.org
·
3d
On the
complexity
of edge
subdivision
to $H$-free graphs
📊
Algorithms
arxiv.org
·
2d
New Parameterized and Exact Exponential Time Algorithms for Strongly Connected
Steiner
Subgraph
📊
Algorithms
arxiv.org
·
1d
A general optimization
solver
based on
OP-to-MaxSAT
reduction
📐
TLA+
arxiv.org
·
3d
Hands-on
PDC
in
Undergraduate
Computing Education
⚙️
Systems Programming
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