Conceptio
›
data-structures
Topic
data-structures
Knowledge-graph topic
· documents ABOUT data-structures across the archive
11
Documents about data-structures
Documents about data-structures
Improving the matrix multiplication exponent with modern optimization and AlphaEvolve
#625429
arXiv (All)
Additive, Near-Additive, and Multiplicative Approximations for APSP in Weighted Undirected Graphs: Trade-offs and Algorithms
#627960
arXiv (OAI Expanded)
Additive, Near-Additive, and Multiplicative Approximations for APSP in Weighted Undirected Graphs: Trade-offs and Algorithms
#629822
arXiv (All)
Designing Efficient and Reachable Routes: The $k$-Step-Central Shortest Path Problem
#668569
arXiv (OAI Expanded)
Designing Efficient and Reachable Routes: The $k$-Step-Central Shortest Path Problem
#670634
arXiv (All)
Recent advances in computer science since 2010?
#787561
Stack Exchange
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)
Emergence of Complex Web Structures
#820418
arXiv (All)
Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching
#920196
arXiv (OAI Expanded)
Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching
#924427
arXiv (All)
Quantum lower bounds for convex optimization and real matrix-vector query problems
#972730
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)
Parallelizing the Factorial Space: 3x SIMD Acceleration of the Steinhaus-Johnson-Trotter Algorithm via Dual-Lane AVX2 Execution
#987897
arXiv (All)
Minimum-makespan completion and vertex selection leave the Wang-Sitters constant at 11/6
#996802
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 Tight $\widetilde Ω(\sqrt{m})$ Information-Theoretic Lower Bound for Randomized Online Set Cover
#1000149
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)
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)
A non-convex clustering shared memory folding compression method applied to digital office data clusters
#316795
Springer Nature OA
Statistical potential for assessment and prediction of protein structures
#6702
OpenAlex
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)
Beyond Quantum Advantage: Improved Classical Algorithms for the Binary Paint Shop Problem
#633439
arXiv (OAI Expanded)
Parallel Minimum Cost Flow in Near-Linear Work and Square Root Depth for Dense Instances
#635577
arXiv (All)
Beyond Quantum Advantage: Improved Classical Algorithms for the Binary Paint Shop Problem
#635788
arXiv (All)
Order-preserving structural mapping for message prioritization in intuitionistic fuzzy soft sets
#637752
Springer Nature OA
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)
What's the difference between a binary search tree and a binary heap?
#796533
Stack Exchange
Why are Red-Black trees so popular?
#796582
Stack Exchange
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)
Fair Minimum Labeling: Efficient Temporal Network Activations for Reachability and Equity
#820260
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)
An $O\big((5/3)^n\mathrm{poly}(n)\big)$ One-Sided Monte Carlo Algorithm for Equal Subset Sum
#971845
arXiv (All)
Quantum Algorithm for Elliptic Curve Discrete Logarithms with Space-Efficient Point Addition
#973273
arXiv (All)
Homomorphism Indistinguishability, Multiplicity Automata Equivalence, and Polynomial Identity Testing
#974279
arXiv (All)
Sequential Offering in On-Demand Platforms: On the Optimality of Greedy Ranking
#985402
arXiv (All)
Adaptive Black-Box Exactness Barriers for Nearest-Source Girth Estimation in CONGEST
#986322
arXiv (All)
← Previous
Page 13 of 19
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.