CS Concepts

computer science, algorithms, data structures, systems programming

Feeds to Scour
SubscribedAll
Scoured 255 posts in 10.5 ms

Complexity and Algorithms for Unary Translocation Distance

 🚀Astro  Content type: Academic
arxiv.org·

Proceedings of the 14th edition of the conference on Random Generation of Combinatorial Structures

 🔐Cybersecurity  Content type: Academic
arxiv.org·

New comment by revengerwizard in "Ask HN: Who wants to be hired? (June 2026)"

 🔓Open Source  Content type: Discussion

Beyond Frequency Marching: Orbit Recovery in Dihedral and Projected Multireference Alignment

 🚀Astro  Content type: Academic
arxiv.org·

Online Learning with Recency: Algorithms for Sliding-window Streaming Multi-armed Bandits

 📡RSS  Content type: Academic
arxiv.org·

Fixed-Parameter Tractability of Private Synthetic Data Generation

 🚀Astro  Content type: Academic
arxiv.org·

A note on rounding fractional matchings with constant-factor strong negative correlation

 Web Performance  Content type: Academic
arxiv.org·

A Fast Gaussian Mechanism under Continual Observation, with Applications

 📡RSS  Content type: Academic
arxiv.org·

From Estimates to Schedules: Learning-Augmented Restricted Assignment

 🦀Rust  Content type: Academic
arxiv.org·

A Unified Lower Bound on the Noisy Query Complexity of Boolean Functions

 🦀Rust  Content type: Academic
arxiv.org·

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products

 💚Vue  Content type: Academic
arxiv.org·

Making Recursive Bayesian Inference Robust

 🔍Science Curiosity  Content type: Academic
arxiv.org·

The Power of Test-Time Training for Approximate Sampling

 🔍Science Curiosity  Content type: Academic
arxiv.org·

Quotient Admission Algorithms for Witness-Supported Graph Windows

 🚀Astro  Content type: Academic
arxiv.org·

Differentially Private Range Subgraph Counting

 📉Crypto Skepticism  Content type: Academic
arxiv.org·

Erlang/OTP 29.0 Release Candidate 3

 🦀Rust
erlang.org·

Counting Hamiltonian Paths in 3-Regular Planar Graphs

 🦀Rust  Content type: Academic
arxiv.org·

The price of incrementality in k-center clustering

 🚀Astro  Content type: Academic
arxiv.org·

Optimal Online Equitable Allocation with Indivisible Resources

 📡RSS  Content type: Academic
arxiv.org·

The Arithmetic Circuit Combinatorial Nullstellensatz is NP-hard

 🦬Emacs  Content type: Academic
arxiv.org·
Sign up or log in to see more results

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