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
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)
Computing linear sections of varieties: quantum entanglement, tensor decompositions and beyond
#1000437
arXiv (All)
A hierarchy of eigencomputations for polynomial optimization on the sphere
#1000446
arXiv (All)
A Walk From Free Probability to Matrix Discrepancy II: Weaver's Problem and the Kadison-Singer Conjecture
#1013070
arXiv (All)
Structural and Algorithmic Results for Stable Cycles and Partitions in the Roommates Problem
#920166
arXiv (OAI Expanded)
Structural and Algorithmic Results for Stable Cycles and Partitions in the Roommates Problem
#924397
arXiv (All)
Fast Quantum Amplitude Encoding of Typical Classical Data
#633230
arXiv (OAI Expanded)
Fast Quantum Amplitude Encoding of Typical Classical Data
#635579
arXiv (All)
Computing Gaussian and exponential integrals in ${\Bbb R}^n$
#614103
arXiv (OAI Expanded)
Computing Gaussian and exponential integrals in ${\Bbb R}^n$
#615070
arXiv (All)
An Empirical Evaluation of BMSSP and Dijkstra's Algorithm for the Lightning Network
#1013442
arXiv (All)
An $O\big((5/3)^n\mathrm{poly}(n)\big)$ One-Sided Monte Carlo Algorithm for Equal Subset Sum
#971845
arXiv (All)
Optimal Low-Rank Quantum State Tomography with Bounded-Sample Joint Measurements
#997386
arXiv (All)
Resident fitness computation in linear time and other algorithmic aspects of interacting trajectories
#141700
arXiv (OAI)
The 2020 US Decennial Census is more private than you (might) think
#153003
arXiv (OAI)
Support Recovery in One-bit Compressed Sensing with Near-Optimal Measurements and Sublinear Time
#674248
arXiv (OAI Expanded)
Support Recovery in One-bit Compressed Sensing with Near-Optimal Measurements and Sublinear Time
#677445
arXiv (All)
On two proofs of $d^2$ mixing of weighted Dikin walks
#788560
arXiv (OAI Expanded)
On two proofs of $d^2$ mixing of weighted Dikin walks
#792560
arXiv (All)
Parameterised graph theory for tensor networks: entanglement rerouting, structural simplification, and agnostic tomography
#927031
arXiv (All)
1.73-Optimal Echelon Stock (R,nQ) Policies in Two-Stage Stochastic Serial Systems
#973901
arXiv (All)
High-Magnetization Sampling at Low Temperatures: Ising Models and Bayesian Sparse Linear Regression
#986498
arXiv (All)
Spectral Gap of Down-Up Walks via Trickle-Down: A Simplified and Sharpened Analysis
#1014108
arXiv (All)
Designing Automated Market Makers for Combinatorial Securities: A Geometric Viewpoint
#1034639
arXiv (All)
An Incremental Algorithm for Checking the Possibility of Braess Paradox in Dynamic Nets
#1051123
arXiv (All)
The Facility Advantage in the One-Round Discrete Voronoi Game on a Line
#1051332
arXiv (All)
Algorithmic Collusion and the Complexity of Information-Value-Free Equilibria
#1037440
arXiv (All)
Fair Vertex Problems Parameterized by Cluster Vertex Deletion
#173251
arXiv (OAI)
Cross-Shift Analysis for Unrelated-Machine Weighted Completion Time A (1.3168+epsilon)-Approximation
#616158
arXiv (OAI Expanded)
Cross-Shift Analysis for Unrelated-Machine Weighted Completion Time A (1.3168+epsilon)-Approximation
#616658
arXiv (All)
Sum-of-Squares Degree Barriers for the Reweighted-Hinge Method in Robust Halfspace Learning: A Christoffel-Function Characterization
#617613
arXiv (OAI Expanded)
Sum-of-Squares Degree Barriers for the Reweighted-Hinge Method in Robust Halfspace Learning: A Christoffel-Function Characterization
#618113
arXiv (All)
Quantum Query Complexity of Finding a Tarski Fixed Point on a High-Dimensional Grid
#926685
arXiv (All)
An iterative rounding $2$-approximation for Feedback Vertex Set via AI-assisted proof of an extreme point property
#927704
arXiv (All)
Structural Parameterizations for Eternal Vertex Cover
#1011606
arXiv (All)
Maximum Matching Size for Bounded Arboricity Graphs in the Dynamic Graph Stream Model using $\tilde{O}(n^{2/3})$ space
#1013339
arXiv (All)
A Table-Free Index for Tapered Memoization Grids: Compact Out-of-Core Evaluation of Functions of Sorted Arguments
#1034044
arXiv (All)
The World's Fastest Matching Engine Algorithm
#617588
arXiv (OAI Expanded)
The World's Fastest Matching Engine Algorithm
#618088
arXiv (All)
Edge Geography is XNLP-hard for Pathwidth and in XP for Tree-Partition Width
#985164
arXiv (All)
The Cost of Privacy: Rates of Convergence for Parameter Estimation with Differential Privacy
#1036498
arXiv (All)
Spectral and combinatorial methods for efficiently computing the rank of unambiguous finite automata
#789505
arXiv (OAI Expanded)
Spectral and combinatorial methods for efficiently computing the rank of unambiguous finite automata
#793509
arXiv (All)
Polynomial Lower Bounds for Distributed Graph Sketching with Tiny Error: Connectivity and Spanning Tree Construction
#973425
arXiv (All)
A tight 1/3-approximation algorithm and fully polynomial-time approximation schemes for the Colored Knapsack Problem
#1011438
arXiv (All)
Equilibria of Round-Robin: Computational Hardness and Fairness for Few Subadditive Agents
#1012501
arXiv (All)
An Exposition of the $\widetilde{O}(\log^{1/4} n)$ Bound for the Komlós Problem
#788456
arXiv (OAI Expanded)
Automated Lower Bounds for Bilinear Complexity over Finite Fields
#789587
arXiv (OAI Expanded)
← Previous
Page 13 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.