Skip to main content
Scour
Browse
Getting Started
Login
Sign Up
You are offline. Trying to reconnect...
Copied to clipboard
Unable to share or copy to clipboard
💻 Computer Science
Broad
CS research, algorithms, systems, computing theory
Filter Results
Timeframe
Fresh
Past Hour
Today
This Week
This Month
Feeds to Scour
Subscribed
All
Scoured
1057
posts in
9.5
ms
Effective MPI: User-defined
Datatypes
and Cartesian Communicators for Zero-copy All-to-all Communication in Multidimensional Tori
🧮
Algorithms
arxiv.org
·
16h
Cone-Induced
Observation Congruences for Vector-Valued Quantitative
Languages
✅
Formal Verification
arxiv.org
·
16h
Busy beaver
🧮
Algorithms
en.wikipedia.org
·
4d
·
r/compsci
Strong (D)QBF Dependency Schemes via Pure Paths with Applications to Proof Checking
✅
Formal Verification
arxiv.org
·
16h
Neural Network Verification using Partial Multi-Neuron Relaxation
✅
Formal Verification
arxiv.org
·
16h
Xe-Forge: Multi-Stage LLM-Powered
Kernel
Optimization for Intel GPU
λ
Type Theory
arxiv.org
·
2d
Unifying Semantic Path Order and Weighted Path Order
🎯
Constraint Programming
arxiv.org
·
16h
Automating
Formal
Verification with Agent-Guided Tree Search
✅
Formal Verification
arxiv.org
·
1d
The
Complexity
of Verifying Feedforward Neural Networks in Quantised Settings
✅
Formal Verification
arxiv.org
·
16h
A
Formal
Semantics of C with OpenMP Parallelism
✅
Formal Verification
arxiv.org
·
2d
ESBMC: A Survey of Its Evolution, Integration, and Future Directions in
Formal
Software
Verification
✅
Formal Verification
arxiv.org
·
2d
Resource Allocation in HyperX Networks
📊
Operations Research
arxiv.org
·
1d
Improved Hardness Results for Nash Social Welfare, Budgeted Allocation and GAP via the Unique Games Conjecture
♟️
Game Theory
arxiv.org
·
2d
Two-Level
Type
Theory
and Applications
λ
Type Theory
arxiv.org
·
2d
Nonlinear spectral clustering with C++
GraphBLAS
🧮
Algorithms
arxiv.org
·
2d
MerLean-Prover: A Recursive Looping Harness for End-to-End Lean 4
Theorem
Proving
✅
Formal Verification
arxiv.org
·
2d
Efficient
Algorithms
for Interdicting Facilities in Trees and Bounded Treewidth
Graphs
🗂️
Data Structures
arxiv.org
·
1d
A
proof-theoretic
approach to abstract interpretation
✅
Formal Verification
arxiv.org
·
2d
A Dynamic Deontic Simplicial
Logic
for Joint Commitments
🎯
Constraint Programming
arxiv.org
·
2d
DateSAT
: A Framework for Solving Date and Period Constraints
🎯
Constraint Programming
arxiv.org
·
3d
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