Conceptio
›
data-structures-and-algorithms
Topic
data-structures-and-algorithms
Knowledge-graph topic
· documents ABOUT data-structures-and-algorithms across the archive
570
Documents about data-structures-and-algorithms
Documents about data-structures-and-algorithms
The Cayley Completion of a Graph
#818933
arXiv (All)
Tight bounds on the number of non-equivalent parameterized squares in a word
#821663
arXiv (All)
Algebraic Geometry Codes Approach the Half-Singleton Bound with Constant Field Size
#971974
arXiv (All)
Separator Theorem for Minor-Free Graphs in Linear Time
#986177
arXiv (All)
A $(\log n)^{1/4}$ Bound for the Komlós Problem
#986510
arXiv (All)
Can SGD Select Good Fishermen? Local Convergence under Self-Selection Biases
#999649
arXiv (All)
A Near-Optimal Space Lower Bound for Euclidean Diameter Estimation in Dynamic Streams
#1013297
arXiv (All)
A quantitative tree-likeness bound from average hyperbolicity
#1014865
arXiv (All)
Metric Weighted Edit Distance: $(3+\varepsilon)$-Approximation in $\widetilde O_\varepsilon(N^{1.6})$ Time
#1034588
arXiv (All)
A lower bound for $\langle 3,2,m \rangle$ matrix multiplication
#1036464
arXiv (All)
Introduction to Machine Learning
#3579
MIT OpenCourseWare
Hyperplanes Avoiding Problem and Integer Points Counting in Polyhedra
#144227
arXiv (OAI)
Moser-Tardos Algorithm with small number of random bits
#163003
arXiv (OAI)
Moser-Tardos Algorithm with small number of random bits
#163962
arXiv (OAI Expanded)
Constant-Time Dynamic Enumeration of Word Infixes in a Regular Language
#617463
arXiv (OAI Expanded)
Constant-Time Dynamic Enumeration of Word Infixes in a Regular Language
#617963
arXiv (All)
Improving the matrix multiplication exponent with modern optimization and AlphaEvolve
#623156
arXiv (OAI Expanded)
Improving the matrix multiplication exponent with modern optimization and AlphaEvolve
#625429
arXiv (All)
PACO: A Fully Cache-Oblivious Parallel FFT with One Global Redistribution
#974025
arXiv (All)
Improved Upper Bounds for Dynamic Bin Packing of General, Unit-Fraction, and Power-Fraction Squares
#985323
arXiv (All)
Near-Optimal Quantum Lower Bounds for Convex Optimization via Fourier Rank
#986644
arXiv (All)
Tackling Parallelization Challenges of Randomized Preconditioners With Dependency Tracking
#997434
arXiv (All)
Convex Optimization with Nested Evolving Feasible Sets (CONES) under Time-Varying Loss Functions
#998755
arXiv (All)
A State-Space Model of Figured-Bass Realization: Local Constraints, Coupled Voices, and Polynomial-Time Solvability
#1013991
arXiv (All)
The Binary Tree Mechanism is Optimal for Differentially Private Continual Counting
#1035546
arXiv (All)
Discrete-Time Signal Processing: Oppenheim and Schafer
#461448
MIT OpenCourseWare
Fair Minimum Labeling: Efficient Temporal Network Activations for Reachability and Equity
#820260
arXiv (All)
Online Inverse Integer Linear Optimization via Small-Gradient Skipping: Constant Regret and Finite Mistakes
#996628
arXiv (All)
Kadison--Singer partitions and Bilu--Linial graph signings in polynomial time
#1050047
arXiv (All)
Breaking the Exponential Barrier: The First Polynomial-Time Algorithm for the Győri-Lovász Theorem
#808995
arXiv (OAI Expanded)
Breaking the Exponential Barrier: The First Polynomial-Time Algorithm for the Győri-Lovász Theorem
#818987
arXiv (All)
Parallelizing the Factorial Space: 3x SIMD Acceleration of the Steinhaus-Johnson-Trotter Algorithm via Dual-Lane AVX2 Execution
#987897
arXiv (All)
A Tight $\widetilde Ω(\sqrt{m})$ Information-Theoretic Lower Bound for Randomized Online Set Cover
#1000149
arXiv (All)
An Arboricity-Sensitive Algorithm for the $K_r-e$-Free Graph Sandwich Problem
#1049199
arXiv (All)
On the Offline Version of the Time-Optimal k-Server Problem
#1051673
arXiv (All)
Topics in Theoretical Computer Science : Internet Research Problems
#3525
MIT OpenCourseWare
Online coloring of short interval graphs and two-count interval graphs
#183183
arXiv (OAI)
Graph Streaming Lower Bounds for Parameter Estimation and Property Testing via a Streaming XOR Lemma
#609718
arXiv (All)
Spectral clustering in the Gaussian mixture block model
#609727
arXiv (All)
Noise tolerance via reinforcement in the quantum search problem
#614014
arXiv (OAI Expanded)
Noise tolerance via reinforcement in the quantum search problem
#614981
arXiv (All)
Parallel Minimum Cost Flow in Near-Linear Work and Square Root Depth for Dense Instances
#633228
arXiv (OAI Expanded)
Parallel Minimum Cost Flow in Near-Linear Work and Square Root Depth for Dense Instances
#635577
arXiv (All)
GPU-Native Approximate Nearest Neighbor Search with IVF-RaBitQ: Fast Index Build and Search
#783525
arXiv (OAI Expanded)
GPU-Native Approximate Nearest Neighbor Search with IVF-RaBitQ: Fast Index Build and Search
#785115
arXiv (All)
Beating Quadratic Time--Message Trade-off in Distributed Minimum Spanning Tree Construction
#798089
arXiv (OAI Expanded)
Beating Quadratic Time--Message Trade-off in Distributed Minimum Spanning Tree Construction
#799512
arXiv (All)
Finding a Shortest Vector and More in $2^{n/2+o(n)}$ Time using $q$-ary Coset Difference Tree
#920661
arXiv (OAI Expanded)
Finding a Shortest Vector and More in $2^{n/2+o(n)}$ Time using $q$-ary Coset Difference Tree
#924895
arXiv (All)
Quantum Algorithm for Elliptic Curve Discrete Logarithms with Space-Efficient Point Addition
#973273
arXiv (All)
← Previous
Page 12 of 15
Next →
Topic record
· derived from the Conceptio knowledge graph (shared subject terms across the corpus)
Conceptio Open Knowledge Archive — topic hubs link to canonical document pages with full provenance.