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
A Tight Bound for Facial Distance Patterns in Planar Graphs
#682797
arXiv (OAI Expanded)
A Tight Bound for Facial Distance Patterns in Planar Graphs
#684573
arXiv (All)
Tight Bounds for Memory Allocation With and Without Request Fragmentation
#788466
arXiv (OAI Expanded)
Parameterized Complexity of Connected Network Microaggregation: The Role of Cluster Size
#789149
arXiv (OAI Expanded)
Tight Bounds for Memory Allocation With and Without Request Fragmentation
#792466
arXiv (All)
Parameterized Complexity of Connected Network Microaggregation: The Role of Cluster Size
#793153
arXiv (All)
On the maximum weight convex problem for some geometric graph-convexities
#808790
arXiv (OAI Expanded)
On the maximum weight convex problem for some geometric graph-convexities
#818782
arXiv (All)
Approximation algorithms for the square min-sum bin packing problem
#920782
arXiv (OAI Expanded)
Approximation algorithms for the square min-sum bin packing problem
#925016
arXiv (All)
A Near-Linear Element Kernel for \(d\)-Hitting Set
#974083
arXiv (All)
A 52-Addition, Rank-23 Scheme for Exact 3 x 3 Matrix Multiplication
#974697
arXiv (All)
Tight Bounds on the Cost of Adaptivity for the Meyerson Sketch
#974773
arXiv (All)
Smoothed Picard Hamiltonian Monte Carlo
#974985
arXiv (All)
Dasgupta's Hierarchical Clustering Objective: Geometry and the Price of the Cardinality Constraint
#975258
arXiv (All)
Better Late Than Never: Online Flow Time Scheduling with Online Estimates
#984328
arXiv (All)
List coloring uncrowded hypergraphs at the shattering threshold
#985137
arXiv (All)
A General Reduction from Near-Additive Emulators to Near-Exact Hopsets
#985167
arXiv (All)
On the Parameterized Complexity of Coloring Discovery
#996655
arXiv (All)
Single-Exponential Algorithms and a Polynomial Kernel for Strong Connectivity Augmentation
#998712
arXiv (All)
Efficient Robust Learning at the Information-Theoretic Limit
#1011384
arXiv (All)
Serial-batch scheduling to minimise the total weighted late work
#1011753
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)
Improved Algorithms for Beck--Fiala with Bounded Sets
#1014302
arXiv (All)
Integrality gap preserving reductions
#1033749
arXiv (All)
Optimal Sparsifiers for Minkowski Sums and Sums of Seminorms
#1034006
arXiv (All)
VAC: A Volume-sampling-based Elimination Rule for Approximate Cholesky Factorization
#1034009
arXiv (All)
Quantum Speedups for Log-Concave Sampling from Local Structure
#1034021
arXiv (All)
Tight Lower Bounds for Differentially Private Continual Counting
#1034780
arXiv (All)
A Refined Analysis of the Sequential Access Theorem for Splay Trees
#1035644
arXiv (All)
Bounds on Longest Simple Cycles in Weighted Directed Graphs via Optimum Cycle Means
#1048544
arXiv (All)
Single-Pass Estimation of the Clustering Coefficient Distribution in Graph Streams
#1049228
arXiv (All)
A Fixed-Parameter Algorithm for 4-Block Integer Programming
#1049447
arXiv (All)
A Proof of the Most Informative Boolean Function Conjecture
#1051327
arXiv (All)
Design and Analysis of Algorithms
#3602
MIT OpenCourseWare
Computational Methods of Scientific Programming
#3663
MIT OpenCourseWare
A visual analytic method to investigate patterns and structures of missing data
#437357
PLOS
Supplementary data for: Investigations to reduce rarefied gap flows within positive displacement vacuum pumps by utilising surface structures
#466486
TUDOdata Dataverse OAI Archive
Computation Structures
#3465
MIT OpenCourseWare
Database Systems
#66937
MIT OpenCourseWare
Algorithms for Computational Biology
#67319
MIT OpenCourseWare
Generalized plithogenic whole hypersoft set, PFHSS-Matrix, operators and applications as COVID-19 data structures
#79527
PhilArchive
Local Limits of Small World Networks
#177031
arXiv (OAI)
An efficient polynomial-time approximation scheme for parallel multi-stage open shops
#611217
arXiv (OAI Expanded)
An efficient polynomial-time approximation scheme for parallel multi-stage open shops
#612694
arXiv (All)
Optimal Repairs for Unary Functional Dependencies: Resolving the Case of Updates
#614333
arXiv (OAI Expanded)
Optimal Repairs for Unary Functional Dependencies: Resolving the Case of Updates
#615300
arXiv (All)
Witness-Certified Fair Division with Comparison Queries
#618844
arXiv (OAI Expanded)
Witness-Certified Fair Division with Comparison Queries
#620523
arXiv (All)
← Previous
Page 8 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.