Software Fundamentals

Feeds to Scour
SubscribedAll
Scoured 319 posts in 6.0 ms

Two Sum | HashMap Pattern

 🗄️Databases
leetcode.com
··DEV·Cited by 1 article

Random Proposals: A Softmax-Based Local-Improvement Framework for Maximum Weighted Matching

 🧠LLMs  Content type: Academic
arxiv.org·

Rolling Stock Planning Using the Quantum Approximate Optimization Algorithm

 🌐Distributed Systems  Content type: Academic
arxiv.org·

MHOT: Height-Optimized Authenticated Data Structure for Blockchain State Commitment

 🌐Distributed Systems  Content type: Academic
arxiv.org·

Density estimation for Hellinger via minimum-distance estimators: mixtures of Gaussians, log-concave, and more

 🧠LLMs  Content type: Academic
arxiv.org·

Sparse Polynomial Divisibility Test over Finite Field is CoNP-hard

 🧠LLMs  Content type: Academic
arxiv.org·

Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds

 🗄️Databases  Content type: Academic
arxiv.org·

A Fast Gaussian Mechanism under Continual Observation, with Applications

 🌐Distributed Systems  Content type: Academic
arxiv.org·

Complexity and Algorithms for Unary Translocation Distance

 🗄️Databases  Content type: Academic
arxiv.org·

Sketching Intersection Profiles: A Simple Proof and Three Applications

 🌐Distributed Systems  Content type: Academic
arxiv.org·

Learning with Simulators: No Regret in a Computationally Bounded World

 🧠LLMs  Content type: Academic
arxiv.org·

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

 🗄️Databases  Content type: Academic
arxiv.org·

Towards Implementable Quantum Divide and Conquer: A TSP Solver with Improved Exponential Base over Held-Karp

 🌐Distributed Systems  Content type: Academic
arxiv.org·

Random Generation of $k$-coloured Motzkin Paths

 🧠LLMs  Content type: Academic
arxiv.org·

Fast and perfect sampling of subgraphs and polymer systems

 🗄️Databases  Content type: Academic
arxiv.org·

A unified complexity bound for logconcave sampling

 🧠LLMs  Content type: Academic
arxiv.org·

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

 🧠LLMs  Content type: Academic
arxiv.org·

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

 🧠LLMs  Content type: Academic
arxiv.org·

Quantum iterative approach to the Traveling Salesman Problem

 🧠LLMs  Content type: Academic
arxiv.org·

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

 🗄️Databases  Content type: Academic
arxiv.org·
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