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 Simplified Analysis of the Good-Bad $3/2$-Approximation Algorithm for Some Minimum-Cost Graph Problems
#790063
arXiv (OAI Expanded)
An Exposition of the $\widetilde{O}(\log^{1/4} n)$ Bound for the Komlós Problem
#792456
arXiv (All)
Automated Lower Bounds for Bilinear Complexity over Finite Fields
#793591
arXiv (All)
A Simplified Analysis of the Good-Bad $3/2$-Approximation Algorithm for Some Minimum-Cost Graph Problems
#794082
arXiv (All)
On the Instance Optimality of Bidirectional Dijkstra's Algorithm
#820644
arXiv (All)
Random-Priority Frontier Routing: Tight $Θ(n^c)$ Bounds Against $c$-Node Cartels
#820895
arXiv (All)
Accelerated High-Accuracy Sampling from a Warm Start via the Proximal Bouncy Particle Sampler
#974984
arXiv (All)
Theory of Parallel Systems (SMA 5509)
#66859
MIT OpenCourseWare
Don't Be Afraid to Die: Black Hole Search in Dynamic Graphs with Fewer Agents
#974931
arXiv (All)
Scalable Composition of Byzantine Agreements under Reorder Attacks
#987959
arXiv (All)
A Better-Than-$3$ Approximation Algorithm for Demand Matching via Knapsack Intersection LP and Contention Resolution
#1011644
arXiv (All)
A Myhill-Nerode Theorem for Generalized Automata, with Applications to Pattern Matching and Compression
#158602
arXiv (OAI)
The Maximum Mutual Visibility Set on a Cactus Graph and the Self-stabilizing Constructions
#975304
arXiv (All)
Tight Time-Space Lower Bounds for Collision Finding and Element Distinctness under Label Symmetry
#997793
arXiv (All)
Robust Treasure Hunt in Anonymous Graphs with Quantum Pebbles by Oblivious Agents
#984892
arXiv (All)
Self-Referential $K$-SAT and the Finite Analogue of Gödel's Incompleteness Theorem
#1048722
arXiv (All)
A Sharp Barrier for Consistent Submodular Maximization: Any Improvement over $2-\sqrt{2}$ Entails Exponential Queries or Linear Recourse
#996790
arXiv (All)
Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor
#998825
arXiv (All)
Constant Factor Optimal 2-Resilient Local Failover Routing Scheme on Directed Graphs
#1013145
arXiv (All)
Exact Greedy Influence Maximization in Linear Time on Bounded-Treewidth Graphs
#1033742
arXiv (All)
A minimum witness for the 3/2 configuration-linear-program gap in two-weight graph balancing, unique at its size
#999284
arXiv (All)
Local Representatives and Shortest Completions for Next-to-Shortest Paths in Directed Graphs
#1037623
arXiv (All)
Do You Have My Size In Stock? Assortment and Inventory Optimization Under the Consider-Fit-Then-Choose Choice Model
#611118
arXiv (OAI Expanded)
Do You Have My Size In Stock? Assortment and Inventory Optimization Under the Consider-Fit-Then-Choose Choice Model
#612595
arXiv (All)
Bridging the Gap Between Stable Marriage and Stable Roommates: A Parameterized Algorithm for Optimal Stable Matchings
#820398
arXiv (All)
A Simple Algorithm for the Directed Multiple Source Replacement Paths Problem
#622916
arXiv (OAI Expanded)
A Simple Algorithm for the Directed Multiple Source Replacement Paths Problem
#625189
arXiv (All)
Universal Augmentation Schemes for Network Navigability: Overcoming the $\sqrtn$-Barrier
#665082
HAL Science
A constant-factor approximation of the Gromov-Hausdorff distance in the plane
#1050894
arXiv (All)
Cluster deletion and clique partitioning in graphs with bounded clique number
#617322
arXiv (OAI Expanded)
Cluster deletion and clique partitioning in graphs with bounded clique number
#617822
arXiv (All)
New Bounds on the Competitive Ratio of Longest Queue Drop: 1.46929591 <= CR(LQD) <= 1.683652
#1013758
arXiv (All)
Moore's Greedy Algorithm for Minimizing the Number of Late Jobs: Structure and Implementation
#633562
arXiv (OAI Expanded)
Moore's Greedy Algorithm for Minimizing the Number of Late Jobs: Structure and Implementation
#635911
arXiv (All)
Introduction to Computational Thinking with Julia, with Applications to Modeling the COVID-19 Pandemic
#3570
MIT OpenCourseWare
Extending Exact Integrality Gap Computations for the Metric TSP
#986210
arXiv (All)
A Note on Approximating the Rural Postman Problem below 3/2
#779537
arXiv (OAI Expanded)
A Note on Approximating the Rural Postman Problem below 3/2
#780912
arXiv (All)
Analysis of Polynomial Threshold Functions on Random Regular Graphs: Computational Complexity of Detecting Noisy Random Lifts
#972474
arXiv (All)
Stringological sequence prediction III: layered ziplines and a tradeoff between efficiency and expressivity
#1014985
arXiv (All)
A Structural Proof of the Lower Bound 21 for $3\times3$ Matrix Multiplication over $\mathbb F_2$
#1012889
arXiv (All)
On Solving Problems of Substantially Super-linear Complexity in $N^{o(1)}$ Rounds in the MPC Model
#986246
arXiv (All)
WI-LUX: What If Learning UX, an Educational Conceptual Framework Integrating UX and AI (Implementation Prospects)
#246865
HAL (France)
Maximum Covering Network Design on Graphs with Low Connectivity: Dynamic Programming and Block-Cut Trees
#661036
arXiv (OAI Expanded)
Maximum Covering Network Design on Graphs with Low Connectivity: Dynamic Programming and Block-Cut Trees
#662086
arXiv (All)
Geometric Complexity Theory and Graph Isomorphism
#1052213
arXiv (All)
DIRECTGO: A new DIRECT-type MATLAB toolbox for derivative-free global optimization
#986058
arXiv (All)
Integrating Data Science and Earth Science
#486872
Directory of Open Access Books
The Doublyte Language Paradigm: Deterministic Multi-Dimensional Topology Fabric Core Substrate Layer
#996432
Figshare
Unrestricted Boolean Multiplicative Complexity of Four-Term Binary Polynomial Multiplication: Rational Places, Hasse Jets, and the Failure of Nonlinear Feedback
#798033
arXiv (OAI Expanded)
← Previous
Page 14 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.