Feeds to Scour
SubscribedAll
Scoured 186051 posts in 32.7 ms
On the parameterized complexity of Broadcast Independence and Broadcast Packing 聽馃寪Distributed Systems
arxiv.org路2d
Optimized projection-free algorithms for online learning: construction and worst-case analysis 聽馃ЗLeetCode
arxiv.org路19h
Towards Distillation Guarantees under Algorithmic Alignment for Combinatorial Optimization 聽馃ЗLeetCode
arxiv.org路19h
Computing points in connected components defined by a real inequation: algorithms, complexity and implementations, Part I 聽馃尦Data Structures
arxiv.org路1d
Computing the Arc-Deletion Distance to Orchard Networks is NP-hard 聽馃尦Data Structures
arxiv.org路19h
Correlated optimin 聽馃寪Distributed Systems
arxiv.org路19h
Revisiting the Maximum Defective Clique Problem: Faster Branching and a Tighter Upper Bound 聽馃尦Data Structures
arxiv.org路1d
A Hierarchy of Tinhofer Graphs: Separations and Membership Testing 聽馃尦Data Structures
arxiv.org路19h
Influence as soft sparsity: Estimation of monotone functions on $\{0,1\}^d$ 聽馃尦Data Structures
arxiv.org路19h
Exploration of $k$-edge-deficient temporal graphs in linear time 聽馃攧Concurrency
arxiv.org路2d
Resilient Byzantine Agreement with Predictions 聽馃寪Distributed Systems
arxiv.org路19h
The information-theoretic complexity of differentiable functions 聽馃尦Data Structures
arxiv.org路1d
Satisfiability Modulo Extensional Constant Arrays (Extended Version) 聽馃ЗLeetCode
arxiv.org路19h
On the Complexity of Correlated Equilibria Beyond Normal-Form Games 聽馃寪Distributed Systems
arxiv.org路1d
Competitive Search with a Faulty Satnav (GPS): When Probability Matching is Rational 聽馃ЗLeetCode
arxiv.org路19h
Fast and Practical Single-Exponential Algorithms for Branchwidth 聽馃尦Data Structures
arxiv.org路1d
GRASP: Deterministic argument ranking in interaction graphs 聽馃寪Distributed Systems
arxiv.org路19h
Modelling Network Resilience: The Complexity of Some Graph Division Games 聽馃寪Distributed Systems
arxiv.org路1d
GOAL: Graph-based Objective-Aligned Diffusion Solvers for Dynamic Multi-Objective Optimization 聽馃ЗLeetCode
arxiv.org路19h
From Witness-Space Sharpness To Family-Pointwise Exactness For The Solvability Complexity Index 聽馃ЗLeetCode
arxiv.org路2d

Keyboard Shortcuts

Navigation

Next / previous item
j/k
Open post
oorEnter
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
gh
Interests
gi
Feeds
gf
Likes
gl
History
gy
Changelog
gc
Settings
gs
Browse
gb
Search
/

General

Show this help
?
Submit feedback
!
Close modal / unfocus
Esc

Press ? anytime to show this help