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
Amplitude amplification and estimation require inverses
#163176
arXiv (OAI)
Fast Deterministic Distributed Degree Splitting
#617510
arXiv (OAI Expanded)
Fast Deterministic Distributed Degree Splitting
#618010
arXiv (All)
Two-State Max-Plus Comparison Is Decidable
#921021
arXiv (OAI Expanded)
Two-State Max-Plus Comparison Is Decidable
#925257
arXiv (All)
DDPM Score Matching and Distribution Learning
#972372
arXiv (All)
Improved Multilayered PCPs and Hypergraph Vertex Cover
#974864
arXiv (All)
Multi-Objective Submodular Maximization with Differential Privacy
#987697
arXiv (All)
Free-Probabilistic State Evolution and Random Matrix Discrepancy
#999518
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)
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)
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)
Prediction: Machine Learning and Statistics
#3209
MIT OpenCourseWare
Quantum Complexity Theory
#3678
MIT OpenCourseWare
Design and Analysis of Algorithms
#66864
MIT OpenCourseWare
Convex Analysis and Optimization
#3239
MIT OpenCourseWare
Parallel Computing
#3391
MIT OpenCourseWare
Topics in Theoretical Computer Science: Probabilistically Checkable Proofs
#67037
MIT OpenCourseWare
Answering Related Questions
#158659
arXiv (OAI)
Isomorphism of tournaments with bounded VC dimension
#609648
arXiv (All)
Differentially Private Verification of Distribution Properties
#609910
arXiv (All)
Recoverable robust representatives selection problem under interval continuous budgeted uncertainty
#616469
arXiv (OAI Expanded)
Recoverable robust representatives selection problem under interval continuous budgeted uncertainty
#616969
arXiv (All)
Derandomizing Karger's Contraction Algorithm for Matroids
#619019
arXiv (OAI Expanded)
Correlation Clustering with Random Partial Information
#619036
arXiv (OAI Expanded)
Derandomizing Karger's Contraction Algorithm for Matroids
#620698
arXiv (All)
Correlation Clustering with Random Partial Information
#620715
arXiv (All)
The Lanczos algorithm for matrix functions: a handbook for scientists
#627882
arXiv (OAI Expanded)
The Lanczos algorithm for matrix functions: a handbook for scientists
#629744
arXiv (All)
Stochastic Multi-Robot Monitoring on Graphs under Markovian Mobility
#657044
arXiv (OAI Expanded)
Stochastic Multi-Robot Monitoring on Graphs under Markovian Mobility
#659180
arXiv (All)
Reconfiguration of Connected Graph Partitions
#663911
arXiv (OAI Expanded)
Reconfiguration of Connected Graph Partitions
#665411
arXiv (All)
Exploiting Low Scanwidth to Resolve Soft Polytomies
#668366
arXiv (OAI Expanded)
Exploiting Low Scanwidth to Resolve Soft Polytomies
#670431
arXiv (All)
On the Parameterized Complexity of $s$-Club Cluster Edge Deletion
#789490
arXiv (OAI Expanded)
Scheduling to Maximize Weighted Throughput with an Active-Time Budget
#790189
arXiv (OAI Expanded)
On the Parameterized Complexity of $s$-Club Cluster Edge Deletion
#793494
arXiv (All)
Scheduling to Maximize Weighted Throughput with an Active-Time Budget
#794208
arXiv (All)
Structural Corrections to the Bethe Approximation of the Permanent
#809096
arXiv (OAI Expanded)
Optimality of Random Regular Graphs in Sparse Network Designs
#809403
arXiv (OAI Expanded)
Structural Corrections to the Bethe Approximation of the Permanent
#819088
arXiv (All)
Optimality of Random Regular Graphs in Sparse Network Designs
#819396
arXiv (All)
Hardness of Multi-Agent Path Finding on Trees: A Unified Approach
#821898
arXiv (All)
← Previous
Page 6 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.