Data Structures

Feeds to Scour
SubscribedAll
Scoured 175 posts in 14.8 ms

Tensorizing Engram: Sharing Latents Across N-Gram Embeddings is Beneficial in LLMs

ย ๐Ÿค–LLMs ย Content type: Academic
arxiv.orgยท

Counting Hamiltonian Paths in 3-Regular Planar Graphs

ย ๐Ÿ“ŠAlgorithms ย Content type: Academic
arxiv.orgยท

DSA Alone Is No Longer Enough: Why Students Should Learn Beyond Coding Problems

ย ๐Ÿ”„DevOps ย Content type: Blog
dev.toยทยทDEV

Redis High-Level Design (HLD): How Redis Is Internally Built

ย ๐Ÿ—๏ธSystem Design ย Content type: Blog
dev.toยทยทDEV

The Arithmetic Circuit Combinatorial Nullstellensatz is NP-hard

ย ๐Ÿ“ŠAlgorithms ย Content type: Academic
arxiv.orgยท

Fast and perfect sampling of subgraphs and polymer systems

ย ๐Ÿ“ŠAlgorithms ย Content type: Academic
arxiv.orgยท

Resources for Learning to Build Technologies from Scratch with Go: Books and Free Online Courses

ย โš™๏ธCompilers ย Content type: Blog
dev.toยทยทDEV

Kikuchi Graphs of Random Hypergraphs are Approximately Johnson

ย ๐Ÿ“ŠAlgorithms ย Content type: Academic
arxiv.orgยท

The Dot Ecosystem: From Simple Paths to Data Algebras

ย ๐Ÿ“ŠAlgorithms ย Content type: Blog
dev.toยทยทDEV

Engineering Scalable Distributed List Ranking

ย ๐Ÿ“ŠAlgorithms ย Content type: Academic
arxiv.orgยท

Adjacency Spectral Radius Under Laplacian Sparsification: Deterministic and Probabilistic Bounds

ย ๐Ÿ“Linear Algebra ย Content type: Academic
arxiv.orgยท

JavaScript Data Types Explained: Primitive vs Non-Primitive Data Types

ย ๐Ÿ“ŠAlgorithms ย Content type: Blog
dev.toยทยทDEV

Graph Traversal on Tensor Cores: A BFS Framework for Modern GPUs

ย ๐Ÿ“ŠAlgorithms ย Content type: Academic
arxiv.orgยท

Quotient Admission Algorithms for Witness-Supported Graph Windows

ย ๐Ÿ“ŠAlgorithms ย Content type: Academic
arxiv.orgยท

Collections in Java

ย ๐Ÿ“ŠAlgorithms ย Content type: Blog
dev.toยทยทDEV

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

ย ๐Ÿ“ŠAlgorithms ย Content type: Academic
arxiv.orgยท

Worst-Case Update Complexity of the Preisach Extremum Stack

ย ๐Ÿ“ŠAlgorithms ย Content type: Academic
arxiv.orgยท

Randomization for Faster Exact Optimization of Discounted Markov Decision Processes

ย ๐Ÿ“ŠAlgorithms ย Content type: Academic
arxiv.orgยท

Exponential Quantum Space Advantage for Approximating Max-$k$SAT in the Streaming Setting

ย ๐Ÿ“ŠAlgorithms ย Content type: Academic
arxiv.orgยท

A General Framework for Dynamic Consistent Submodular Maximization

ย ๐Ÿ“ŠAlgorithms ย 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