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
Efficient Algorithms for Subdeterminant Maximization under Partition Matroids
#1011802
arXiv (All)
Hidden Circuits and Exact Counting in Ordered Graphs
#1011828
arXiv (All)
NP-Hardness and a Fixed-Parameter Algorithm for Translocation Distance
#1012583
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)
Counting Triangles in Graph Streams with Repeatable and Forgettable Edges
#1014988
arXiv (All)
Dynamic and Optimal Function Inversion in the Small-Time Regime
#1034008
arXiv (All)
Scaling Forced Alignment to End-User Devices
#1035113
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)
Online Algorithms with a Sample: Tight Bounds and Adversarial Robustness
#1036278
arXiv (All)
Busy Time Minimization with Preemption, Migration, and One Resource Requirement
#1048941
arXiv (All)
The Inverse Lyndon Array
#1049142
arXiv (All)
Budget-Independent Influence Maximization in Nearly Linear Time
#1049343
arXiv (All)
Clique-dependent strongly sublinear treewidth and strongly sublinear tree-independence number
#1051089
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)
Application of Artificial Intelligence to Support Design and Analysis of Steel Structures
#620321
IRIS
Algorithmic Lower Bounds: Fun with Hardness Proofs
#3416
MIT OpenCourseWare
The Art of Approximation in Science and Engineering
#3471
MIT OpenCourseWare
Software Construction
#3627
MIT OpenCourseWare
Data Structures For Statistical Computing In Python
#19658
OpenCitations
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)
Data archive of "Steering interfacial molecular structures by substrate-molecule charge transfer"
#368980
Universität Innsbruck
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)
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)
Sampling Balanced Forests of Grids in Polynomial Time
#650540
arXiv (OAI Expanded)
Forcing a unique minimum spanning tree and a unique shortest path
#650654
arXiv (OAI Expanded)
Sampling Balanced Forests of Grids in Polynomial Time
#651993
arXiv (All)
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)
Sublinear Algorithms for Estimating the Number of Hyperedges in Arbitrary Hypergraphs
#656987
arXiv (OAI Expanded)
Compact Representations of Geometric Bipartite Graphs via Weighted Biclique Covers
#657181
arXiv (OAI Expanded)
Simple Low-Overhead Communication-Efficient String Reconciliation and Edit Distance
#658899
arXiv (All)
Sublinear Algorithms for Estimating the Number of Hyperedges in Arbitrary Hypergraphs
#659123
arXiv (All)
Compact Representations of Geometric Bipartite Graphs via Weighted Biclique Covers
#659317
arXiv (All)
Stable Matching with Deviators and Conformists
#668405
arXiv (OAI Expanded)
Stable Matching with Deviators and Conformists
#670470
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 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.