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
Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams
#793655
arXiv (All)
The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern
#808730
arXiv (OAI Expanded)
The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern
#818722
arXiv (All)
A Simpler Analysis of the Bansal-Jiang Quasi Monte-Carlo Algorithm via Haar Wavelets
#820655
arXiv (All)
Scalable Neighborhood Local Search for Single-Machine Scheduling with Family Setup Times
#920171
arXiv (OAI Expanded)
Scalable Neighborhood Local Search for Single-Machine Scheduling with Family Setup Times
#924402
arXiv (All)
On Maximizing a Weakly Submodular Function over a Matroid Constraint via the Greedy Algorithm
#971967
arXiv (All)
Integrality Gap Bounds for the Goemans-Linial SDP on Finite Abelian Cayley Graphs
#972296
arXiv (All)
A deterministic $(1+\varepsilon)^n$ approximation for the permanent of a nonnegative matrix
#998613
arXiv (All)
An $\tilde Ω(\log n \log m)$ Information-Theoretic Lower Bound for Randomized Online Set Cover
#1034420
arXiv (All)
Moving Geometric Objects to Render Their Intersection Graph Connected or Locally Dense
#1048354
arXiv (All)
Practical Data Structures and Algorithms for Java Developers : From Fundamentals to Real-World Engineering / by Mikhail Davidovich
#1065166
Deutsche Nationalbibliothek
Statistical Learning Theory and Applications
#3506
MIT OpenCourseWare
Exact and Efficient Sampling from Dynamic Discrete Distributions with Finite-Precision Weights
#173313
arXiv (OAI)
Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Bicriteria Optimality in 2D
#779530
arXiv (OAI Expanded)
Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Bicriteria Optimality in 2D
#780905
arXiv (All)
Connectivity Oracles Under Vertex Failures via a Simple and Fast Low-Degree Steiner Forest Decomposition
#920041
arXiv (OAI Expanded)
Connectivity Oracles Under Vertex Failures via a Simple and Fast Low-Degree Steiner Forest Decomposition
#924272
arXiv (All)
Simple and Almost Non-Adaptive \(\frac{1}{2}\)-Approximation for Matroid Prophet Inequalities
#973276
arXiv (All)
An FPTAS for 7/9-Approximation to Maximin Share Allocations
#974264
arXiv (All)
Oracle Complexity of Stochastic Fixed-Point Equations with Nonexpansive Maps
#987263
arXiv (All)
The 11/6 supremum of the Wang-Sitters rounding scheme for graph balancing
#998384
arXiv (All)
Spatial Mixing and Deterministic Approximate Counting of Multi-spin Systems beyond Bounded Degree Graphs
#1000308
arXiv (All)
Optimizing Both Checking and Update Costs in Random Walk Search
#1012992
arXiv (All)
A Reachable-State Operator Formulation of Deferred Acceptance: Progress Invariants and Structural Diagnostics
#1013835
arXiv (All)
Interactive proofs for verifying (quantum) learning and testing
#1014478
arXiv (All)
Critical and near-critical influence bounds for ferromagnetic Ising models
#1034841
arXiv (All)
Target-Stratified Fair Range Summaries: Improved Fair $\varepsilon$-Nets and Geometric Hitting Sets
#1034869
arXiv (All)
A Walk From Free Probability to Matrix Discrepancy III: Higher Rank Kadison-Singer and Spectrally Thin Trees
#1035687
arXiv (All)
A Simpler and Faster Min-Cost Flow Solver via Min-Ratio Cycles from Distance Oracles
#1050044
arXiv (All)
Byzantine Causal Reliable Broadcast (BCRB) with Constant-Size Message Metadata
#1050205
arXiv (All)
Techniques in Artificial Intelligence (SMA 5504)
#3381
MIT OpenCourseWare
Spectral Gaps of Hit-and-Run and Coordinate Hit-and-Run
#623150
arXiv (OAI Expanded)
Spectral Gaps of Hit-and-Run and Coordinate Hit-and-Run
#625423
arXiv (All)
Geometric Burning Under $L_1$ and $L_\infty$ Metrics, and Beyond
#616566
arXiv (OAI Expanded)
Geometric Burning Under $L_1$ and $L_\infty$ Metrics, and Beyond
#617066
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)
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)
Minimum-makespan completion and vertex selection leave the Wang-Sitters constant at 11/6
#996802
arXiv (All)
Efficient Rejection Sampling in the Entropy-Optimal Range
#173267
arXiv (OAI)
Optimal Mixing of Glauber Dynamics for the Sherrington-Kirkpatrick Model at $β< 1/2$
#682831
arXiv (OAI Expanded)
Optimal Mixing of Glauber Dynamics for the Sherrington-Kirkpatrick Model at $β< 1/2$
#684609
arXiv (All)
Diva++: Dynamic Range Filtering over Hard Workloads
#779544
arXiv (OAI Expanded)
Diva++: Dynamic Range Filtering over Hard Workloads
#780919
arXiv (All)
Recognizing Graphs Close to Bipartite Graphs with an Application to Colouring Reconfiguration
#799789
arXiv (All)
Approximate Dual Separation for the Cluster LP: a 1.387 approximation for Correlation Clustering
#800121
arXiv (All)
The Cayley Completion of a Graph
#808941
arXiv (OAI Expanded)
← Previous
Page 11 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.