Feeds to Scour
SubscribedAll
Scoured 118 posts in 11.8 ms
Fast and Practical Single-Exponential Algorithms for Branchwidth  📊Algorithms
arxiv.org·2d
One-Shot Klein Cutting Planes for Lipschitz Geodesically Convex Optimization in Hyperbolic Space  📊Algorithms
arxiv.org·2d
whitecell-dev/LeetCode-Token-Golf: We taught engineers to optimize for time and space. Now we train them to optimize for tokens.  🏆Competitive Programming
github.com·4d·Hacker News
Improved Parallel Algorithms for EF1 Allocations  🖧Distributed Systems
arxiv.org·2d
MelikaSepidband/Code-Generation-Complexity-Metrics  🏆Competitive Programming
github.com·3d
Meta-Theorems for Cuttable Distributed Problems  🖧Distributed Systems
arxiv.org·1d
Corbell-AI/evalmonkey: CLI for coding agents to benchmark & chaos test your AI Agents  🕵️AI Agents
github.com·5d·Hacker News
Tolerant Testing for Unique Games  🏆Competitive Programming
arxiv.org·2d
samuel-nartey/devops-labs: Hands-on DevOps, DevSecOps and Cloud Engineering labs covering Docker, Kubernetes, Terraform, AWS, CI/CD, GitOps, Ansible, Helm, Prometheus and Security; built for engineers who learn by doing. Build muscle, not just theory.  🏗️System Design
github.com·4d·DEV
Online Resource Allocation with Convex-set Machine-Learned Advice  📊Algorithms
arxiv.org·2d
On efficient robust regression with subquadratic samples  🔍RAG
arxiv.org·2d
Resolving deletion in AVL trees  🗂️Data Structures
github.com
·4d·DEV
Hardness and Approximation for Coloring Digraphs  📊Algorithms
arxiv.org·1d
Parse indexing for choosing pseudo-MEMs  🔍RAG
arxiv.org·2d
A-ProS: Towards Reliable Autonomous Programming Through Multi-Model Feedback  🕵️AI Agents
arxiv.org·2d
An Approximation Algorithm for Graph Label Selection  📊Algorithms
arxiv.org·2d
Online Graph Embedding in Star Graphs  🗂️Data Structures
arxiv.org·2d
Deterministic Single Exponential Time Algorithms for Co-Path Packing and Co-Path Set Parameterized by Treewidth  📊Algorithms
arxiv.org·1d
A Note on Second-Order Expected Maximum-Load Bounds for Binary Linear Hashing  🗂️Data Structures
arxiv.org·2d
DialSort: Non-Comparative Integer Sorting via the Self-Indexing Principle: Architecture, Implementation, and Substrate-Aware Analysis  📊Algorithms
arxiv.org·2d
Sign up or log in to see more results
Sign UpLogin

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