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
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)
Parameterized Complexity of Connected Network Microaggregation: The Role of Cluster Size
#789149
arXiv (OAI Expanded)
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)
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)
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)
Efficient Robust Learning at the Information-Theoretic Limit
#1011384
arXiv (All)
Serial-batch scheduling to minimise the total weighted late work
#1011753
arXiv (All)
Integrality gap preserving reductions
#1033749
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)
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)
Motifs in temporal hypergraphs
#1000141
arXiv (All)
Introduction to Numerical Methods
#3332
MIT OpenCourseWare
Machine Learning
#3547
MIT OpenCourseWare
Database Systems
#66937
MIT OpenCourseWare
Local Limits of Small World Networks
#177031
arXiv (OAI)
Witness-Certified Fair Division with Comparison Queries
#618844
arXiv (OAI Expanded)
Witness-Certified Fair Division with Comparison Queries
#620523
arXiv (All)
Flow Shop Scheduling with Stochastic Reentry
#783559
arXiv (OAI Expanded)
Flow Shop Scheduling with Stochastic Reentry
#785149
arXiv (All)
Strong Conflict-Free Vertex-Connection via Twin Cover: Kernelization and Chromatic Bounds
#809376
arXiv (OAI Expanded)
Strong Conflict-Free Vertex-Connection via Twin Cover: Kernelization and Chromatic Bounds
#819369
arXiv (All)
Infrequent Resolving Algorithm for Online Linear Programming
#820150
arXiv (All)
Prediction-Assisted Pricing and Admission for LLM APIs with Stochastic Token Consumption
#820725
arXiv (All)
Sensitivity Oracles for Matroid Packing, Matroid Covering, and Matching Problems with Applications
#821236
arXiv (All)
A Minimax Perspective on Almost-Stable Matchings
#920263
arXiv (OAI Expanded)
A Minimax Perspective on Almost-Stable Matchings
#924494
arXiv (All)
Batched Pandora's Box
#926904
arXiv (All)
Finding Many Overlapping Dense Subgraphs Using Triadic Cohorts
#971551
arXiv (All)
Strategic Facility Location in Euclidean Spaces
#972081
arXiv (All)
Almost Sharp Equivalence between Approximate Message Passing and Low-Degree Polynomials
#975061
arXiv (All)
Parameterized Complexity of Scheduling Problems in Robotic Process Automation
#984966
arXiv (All)
Navigating Small-World Networks with Distance Predictions
#997858
arXiv (All)
A Group-Based Resource Allocation Model for the Fractional Knapsack Problem
#998403
arXiv (All)
Intrinsic-Dimensional Wasserstein Guarantees for Private Synthetic Measures
#1011356
arXiv (All)
Introduction to Mathematical Programming
#3612
MIT OpenCourseWare
An efficient polynomial-time approximation scheme for parallel multi-stage open shops
#611217
arXiv (OAI Expanded)
← Previous
Page 8 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.