Algorithms

data structures, algorithm design, sorting, computational complexity

Feeds to Scour
SubscribedAll
Scoured 95 posts in 7.7 ms

Independence and Domination on Bounded-Treewidth Graphs: Integer, Rational, and Irrational Distances

 📈Complexity Theory  Content type: Academic
arxiv.org·

Quantum enhanced rare event discovery and sampling

 🔐Cryptography  Content type: Academic
arxiv.org·

Kikuchi Graphs of Random Hypergraphs are Approximately Johnson

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

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

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

Fixed-Parameter Tractability of $t$-Uniform Hypergraphicality

 📈Complexity Theory  Content type: Academic
arxiv.org·

Adjacency Spectral Radius Under Laplacian Sparsification: Deterministic and Probabilistic Bounds

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

Workload-Aware Autotuning of Block Size in Square-Root Decomposition

 🏗Computer Architecture  Content type: Academic
arxiv.org·

A space-time sparse-grid method for the wave equation

 📈Complexity Theory  Content type: Academic
arxiv.org·

DBHN-Net: Dual-Branch Hybrid Neural Network For Low-Complexity Monaural Speech Enhancement

 📈Complexity Theory  Content type: Academic
arxiv.org·

Containerizing BIDSme : A Reproducible Tool for BIDS Conversion

 🦀Rust  Content type: Academic
arxiv.org·

Pinning on Tight Cuts: Improved Algorithm and Bounds for Unsplittable Multicommodity Flows in Outerplanar Graphs

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

Uncertainty Principles for the Number Theoretic Transform

 🎯Randomized Algorithms  Content type: Academic
arxiv.org·

Tomography of quantum states with bounded extent

 📈Complexity Theory  Content type: Academic
arxiv.org·

Incremental Sheaf Cohomology on Cellular Complexes: O(1)-in-n Lazy Edit Processing under Bounded Local Geometry

 Functional Programming  Content type: Academic
arxiv.org·

Online Span Minimization for Flexible Uniform Jobs

 🎯Randomized Algorithms  Content type: Academic
arxiv.org·

ATT-CR: Adaptive Triangular Transformer for Cloud Removal

 📈Complexity Theory  Content type: Academic
arxiv.org·

Multiversion Concurrency Control for Multiversion B-Trees

 🧠Memory Management  Content type: Academic
arxiv.org·

N-Player Binary Games with Unidirectional Dependencies: Cycle Robustness and Induced Indifference

 Algorithmic Game Theory  Content type: Academic
arxiv.org·

Earliest query answering over streamed trees

 🗄️Database Theory  Content type: Academic
arxiv.org·

Minimum Complete MR Subsets under Semantic-Mutation Fault Models: A Support-Set Domination Boundary

 📈Complexity Theory  Content type: Academic
arxiv.org·

No more posts from DiToast's subscribed feeds.

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