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
Query-Optimal and Gate-Efficient Lindbladian Simulation
#1012923
arXiv (All)
Gain-Sharing Optimization in Randomized Primal--Dual Analysis: Structure and Certification
#1036545
arXiv (All)
A general counting and sampling Lovász local lemma
#1049408
arXiv (All)
Computational Geometry
#3535
MIT OpenCourseWare
Beyond Quantum Advantage: Improved Classical Algorithms for the Binary Paint Shop Problem
#633439
arXiv (OAI Expanded)
Beyond Quantum Advantage: Improved Classical Algorithms for the Binary Paint Shop Problem
#635788
arXiv (All)
Retroactive Monotonic Priority Queues via Range Searching
#144345
arXiv (OAI)
Expander Hierarchies for Normalized Cuts on Graphs
#163040
arXiv (OAI)
Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges
#173242
arXiv (OAI)
Submodular Maximization under Supermodular Constraint: Greedy Guarantees
#613954
arXiv (OAI Expanded)
The Power of the Score Sequence of a Tournament
#614133
arXiv (OAI Expanded)
Submodular Maximization under Supermodular Constraint: Greedy Guarantees
#614921
arXiv (All)
The Power of the Score Sequence of a Tournament
#615100
arXiv (All)
Incremental Directed Minimum Cut by Dynamizing Gabow's Algorithm
#619101
arXiv (OAI Expanded)
Incremental Directed Minimum Cut by Dynamizing Gabow's Algorithm
#620780
arXiv (All)
Query Efficient Structured Matrix Learning
#650628
arXiv (OAI Expanded)
Query Efficient Structured Matrix Learning
#652081
arXiv (All)
The Anti-Lexicographic SUS-Anchor: An Empirically Optimal Selection Scheme
#674420
arXiv (OAI Expanded)
The Anti-Lexicographic SUS-Anchor: An Empirically Optimal Selection Scheme
#677620
arXiv (All)
Quantum Computing: Lecture Notes
#682355
arXiv (OAI Expanded)
Quantum Computing: Lecture Notes
#684130
arXiv (All)
A Configuration-LP Framework for Connected $k$-Median Clustering
#783253
arXiv (OAI Expanded)
DAG Covers for Structured Graphs: The Steiner Point Effect
#783552
arXiv (OAI Expanded)
A Configuration-LP Framework for Connected $k$-Median Clustering
#784843
arXiv (All)
DAG Covers for Structured Graphs: The Steiner Point Effect
#785142
arXiv (All)
Parameterized Complexity of Edge-Constrained Graph Partitioning
#789007
arXiv (OAI Expanded)
Parameterized Complexity of Edge-Constrained Graph Partitioning
#793011
arXiv (All)
The Exact Online Threshold for the Asymmetric Binary Perceptron
#822524
arXiv (All)
On Randomized Online Span Minimization
#973302
arXiv (All)
Random Schreier graphs as expanders
#984010
arXiv (All)
Limited Independence Suffices for Large-k Min-wise Hashing
#984191
arXiv (All)
A Tight Analysis of Khatri-Rao Oblivious Subspace Embeddings
#986343
arXiv (All)
Approximate Nearest Neighbor in Ultra-High Dimensional $\ell_\infty$
#987175
arXiv (All)
Exact (n + 1) Comparison Complexity for the N-Repeated Element Problem
#987578
arXiv (All)
Learning Depth-3 Circuits with Polynomial Savings
#1011861
arXiv (All)
A Walk From Free Probability to Matrix Discrepancy I: Matrix Spencer
#1013071
arXiv (All)
Machine-Verifying Toom-Cook Multiplication with Integer Evaluation Points
#1013523
arXiv (All)
Streaming Hypergraph Coloring via Palette Sparsification
#1013660
arXiv (All)
Almost Optimal FPT Inapproximability for k-SetCover
#1014273
arXiv (All)
ZigZag Trie: A Novel Index for Contextual Queries
#1014960
arXiv (All)
Fast FPRAS for the Permanent
#1034514
arXiv (All)
The Strong Secretary Conjecture is True for Linear Matroids
#1034589
arXiv (All)
Computing markings for fuzzy minimax nets over the Gödel structure
#1034759
arXiv (All)
The Nelson-Nguyen Conjecture via Mean-to-Moments Concentration
#1037231
arXiv (All)
A Polynomial Kernel for Planar Directed Feedback Vertex Set
#1049406
arXiv (All)
Optimal Analysis of Greedy for Stochastic Online Euclidean Matching
#1050136
arXiv (All)
Near-Feasible Stable Matchings: Incentives and Optimality
#920276
arXiv (OAI Expanded)
Near-Feasible Stable Matchings: Incentives and Optimality
#924507
arXiv (All)
Systematic Data Structure Lower Bounds via the Query-with-Sketch Model
#1011731
arXiv (All)
Essential Coding Theory
#67322
MIT OpenCourseWare
← Previous
Page 5 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.