📐 Algorithms - DiToast · Scour

Discovering Data Structures: Nearest Neighbor Search and Beyond

🕸️Graph Theory Academic

Detecting Large Quasi-cliques on Dynamic Networks

📈Complexity Theory Academic

Complexity and Algorithms for Unary Translocation Distance

🎯Randomized Algorithms Academic

PivCo-Huffman

🎲Probabilistic Programming Academic

Fast and perfect sampling of subgraphs and polymer systems

🕸️Graph Theory Academic

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

🎲Probabilistic Programming Academic

Quantum Algorithms for Triangle Cut Sparsification

🔐Cryptography Academic

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

📈Complexity Theory Academic

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

🎯Randomized Algorithms Academic

Graphical and algebraic methods for Boolean factoring

🔐Cryptography Academic

Engineering Scalable Distributed List Ranking

🎲Probabilistic Programming Academic

Worst-Case Update Complexity of the Preisach Extremum Stack

📊Information Theory Academic

Multilevel Stochastic Gradient Descent for Risk-Averse PDE-Constrained Optimization

📈Complexity Theory Academic

From Estimates to Schedules: Learning-Augmented Restricted Assignment

🎯Randomized Algorithms Academic

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

🔐Cryptography Academic

Quotient Admission Algorithms for Witness-Supported Graph Windows

🕸️Graph Theory Academic

Counting Hamiltonian Paths in 3-Regular Planar Graphs

🕸️Graph Theory Academic

Network node immunization: improving Netshield algorithm through random rooted forests

🕸️Graph Theory Academic

Differentially Private Range Subgraph Counting

🕸️Graph Theory Academic

Learning-Augmented Online Minimization with Dual Predictions

🎲Probabilistic Programming Academic

Log in to enable infinite scrolling