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
Almost Linear 3-Spanners of Temporal Cliques
#920736
arXiv (OAI Expanded)
Almost Linear 3-Spanners of Temporal Cliques
#924970
arXiv (All)
Counterfactual Routing Using Integer Programming with Constraint Generation
#926599
arXiv (All)
Computing Lewis Weights to High Precision by Fixed-Point Iteration
#927634
arXiv (All)
Beyond Cut Balance: Spectral Sparsification of the Nonlinear Directed Laplacian
#985555
arXiv (All)
Distributed Quantum Property Testing with Quantum Carrier Pigeons
#986489
arXiv (All)
Block Encoding of Sparse Matrices via Coherent Permutation
#987467
arXiv (All)
SparseStack Is an Optimal Oblivious Subspace Embedding
#996948
arXiv (All)
Routing Multiple Agents Below the Sum of Distances
#1012965
arXiv (All)
Degree-Free Spectral Independence for Log-Concave Holant Measures
#1012994
arXiv (All)
A Separator-based Algorithm for the Graph Edit Distance Problem
#1014788
arXiv (All)
The Complexity of Computing Class Probabilities in BID Probabilistic Databases
#1035211
arXiv (All)
Optimal Trajectories in Discrete Space with Acceleration Constraints
#1035409
arXiv (All)
An Approximation Algorithm for Non-uniform Non-contiguous Translocation Distance
#1051913
arXiv (All)
Tight Fréchet bounds for $λ$-low density curves
#1052141
arXiv (All)
Stable Matching with Deviators and Conformists
#668405
arXiv (OAI Expanded)
Stable Matching with Deviators and Conformists
#670470
arXiv (All)
Programming for the Puzzled
#3413
MIT OpenCourseWare
Quantum Information Science II
#3625
MIT OpenCourseWare
When Shall We $k$ Meet Again? Tight Algorithms for Diameter and Radius under the Meet Distance
#1037252
arXiv (All)
Stable Regularity Lemmas: Efficient Algorithms and Essentially Tight Littlestone Bounds
#1051620
arXiv (All)
Tree-Packing Revisited: Faster Fully Dynamic Min-Cut and Arboricity
#633192
arXiv (OAI Expanded)
Tree-Packing Revisited: Faster Fully Dynamic Min-Cut and Arboricity
#635541
arXiv (All)
Forcing a unique minimum spanning tree and a unique shortest path
#650654
arXiv (OAI Expanded)
Forcing a unique minimum spanning tree and a unique shortest path
#652107
arXiv (All)
Simple Low-Overhead Communication-Efficient String Reconciliation and Edit Distance
#656763
arXiv (OAI Expanded)
Simple Low-Overhead Communication-Efficient String Reconciliation and Edit Distance
#658899
arXiv (All)
Tight Bounds for Memory Allocation With and Without Request Fragmentation
#788466
arXiv (OAI Expanded)
Tight Bounds for Memory Allocation With and Without Request Fragmentation
#792466
arXiv (All)
Dasgupta's Hierarchical Clustering Objective: Geometry and the Price of the Cardinality Constraint
#975258
arXiv (All)
Deterministic online matching under short augmenting paths and restricted vertex reassignments
#1013156
arXiv (All)
Universal set families for maximization of nonnegative submodular and XOS functions
#1014121
arXiv (All)
Optimal Sparsifiers for Minkowski Sums and Sums of Seminorms
#1034006
arXiv (All)
Tight Lower Bounds for Differentially Private Continual Counting
#1034780
arXiv (All)
Counting with the quantum alternating operator ansatz
#144262
arXiv (OAI)
Color Fault-Tolerant Distance Preservers: Õptimal Size in Conditionally Õptimal Time
#183233
arXiv (OAI)
First Order Logic on Pathwidth Revisited Again
#189008
arXiv
First Order Logic on Pathwidth Revisited Again
#189058
arXiv Biology
First Order Logic on Pathwidth Revisited Again
#189108
arXiv (OAI Expanded)
First Order Logic on Pathwidth Revisited Again
#189158
arXiv (OAI)
A Simple Active-Set Method for PageRank-Based Local Graph Clustering
#619060
arXiv (OAI Expanded)
A Simple Active-Set Method for PageRank-Based Local Graph Clustering
#620739
arXiv (All)
Stealing From the Dragon's Hoard: Online Unbounded Knapsack With Removal
#627969
arXiv (OAI Expanded)
Stealing From the Dragon's Hoard: Online Unbounded Knapsack With Removal
#629831
arXiv (All)
Sampling Balanced Forests of Grids in Polynomial Time
#650540
arXiv (OAI Expanded)
Sampling Balanced Forests of Grids in Polynomial Time
#651993
arXiv (All)
Compact Representations of Geometric Bipartite Graphs via Weighted Biclique Covers
#657181
arXiv (OAI Expanded)
Compact Representations of Geometric Bipartite Graphs via Weighted Biclique Covers
#659317
arXiv (All)
Revisiting $O(n \log \log n)$ chaining for anchored edit distance
#674424
arXiv (OAI Expanded)
Revisiting $O(n \log \log n)$ chaining for anchored edit distance
#677624
arXiv (All)
← Previous
Page 7 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.