Algorithms

📐 Algorithms

data structures, algorithm design, sorting, computational complexity

Feeds to Scour
SubscribedAll
Scoured 95 posts in 6.9 ms

The price of incrementality in k-center clustering

 🕸️Graph Theory  Content type: Academic
arxiv.org·

The Arithmetic Circuit Combinatorial Nullstellensatz is NP-hard

 📈Complexity Theory  Content type: Academic
arxiv.org·

Online Min-Cost Matching with General Arrivals

 ⚖Algorithmic Game Theory  Content type: Academic
arxiv.org·

Optimal Online Equitable Allocation with Indivisible Resources

 ⚖Algorithmic Game Theory  Content type: Academic
arxiv.org·

Multi-Objective Submodular Maximization with Differential Privacy

 🔐Cryptography  Content type: Academic
arxiv.org·

Efficient Minimal Solvers for Visual-Inertial Relative Pose Estimation in Multi-Camera Systems

 📈Complexity Theory  Content type: Academic
arxiv.org·

A General Framework for Dynamic Consistent Submodular Maximization

 🎯Constraint Programming  Content type: Academic
arxiv.org·

RISE: A Rust Library for Inverted Index Search Engines

 🦀Rust  Content type: Academic
arxiv.org·

Odd Cycle Transversal in $P_k$-Free Graphs

 🕸️Graph Theory  Content type: Academic
arxiv.org·

Temporal matching in trees

 📈Complexity Theory  Content type: Academic
arxiv.org·

Dependencies and Dataflow in Seed-Filter-Extend Pipelines

 🎲Probabilistic Programming  Content type: Academic
arxiv.org·

Randomization for Faster Exact Optimization of Discounted Markov Decision Processes

 🎯Randomized Algorithms  Content type: Academic
arxiv.org·

Bayesian Probing on Graphs

 🎯Randomized Algorithms  Content type: Academic
arxiv.org·

Knockoffs-based False Discovery Rate Control and Simplification for Deep Neural Networks

 📈Complexity Theory  Content type: Academic
arxiv.org·

Revisiting Diameter in Directed Graphs

 🕸️Graph Theory  Content type: Academic
arxiv.org·

What Makes Majority Illusion Easy to Detect?

 📈Complexity Theory  Content type: Academic
arxiv.org·

An Empirical Comparison of General Context-Free Parsers

 📝Text Editors  Content type: Academic
arxiv.org··Hacker News

Sharp Low-Degree Thresholds for Planted-vs-Planted Testing

 📈Complexity Theory  Content type: Academic
arxiv.org·

Quantum Kravchuk Transform using $\mathfrak{su}(2)$ fast-forwarding

 📈Complexity Theory  Content type: Academic
arxiv.org·

Towards Tight Bounds for Streaming Attention

 🎲Probabilistic Programming  Content type: Academic
arxiv.org·

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