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
On the Parameterized Complexity of Grundy Domination and Zero Forcing Problems
#177117
arXiv (OAI)
Quantitative relaxation of concurrent data structures
#442695
ISTA Publications
An Approximation Algorithm for 2-Vertex-Connectivity via Cycle-Restricted 2-Edge-Covers
#608876
arXiv (OAI Expanded)
An Approximation Algorithm for 2-Vertex-Connectivity via Cycle-Restricted 2-Edge-Covers
#609938
arXiv (All)
Fair Division Meets Scheduling: Approximately Envy-Free Interval Scheduling
#611107
arXiv (OAI Expanded)
Fair Division Meets Scheduling: Approximately Envy-Free Interval Scheduling
#612584
arXiv (All)
A Necessary and Sufficient Hall Condition for Hypergraphs
#614206
arXiv (OAI Expanded)
A Necessary and Sufficient Hall Condition for Hypergraphs
#615173
arXiv (All)
A more efficient algorithm to compute the Rand Index for change-point problems
#663917
arXiv (OAI Expanded)
A more efficient algorithm to compute the Rand Index for change-point problems
#665417
arXiv (All)
The Power of Local Marginals: An $O(\varepsilon^{-1})$-Aspect-Ratio Reduction for Dynamic Weighted Matching
#779721
arXiv (OAI Expanded)
The Power of Local Marginals: An $O(\varepsilon^{-1})$-Aspect-Ratio Reduction for Dynamic Weighted Matching
#781096
arXiv (All)
Powerful Algorithms too complex to implement
#787528
Stack Exchange
Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams
#789651
arXiv (OAI Expanded)
Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams
#793655
arXiv (All)
From b-Coloring to $b^*$-Coloring: Large Girth and Parameterized Complexity
#797617
arXiv (OAI Expanded)
From b-Coloring to $b^*$-Coloring: Large Girth and Parameterized Complexity
#799032
arXiv (All)
The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern
#808730
arXiv (OAI Expanded)
Different representation learning objectives recover distinct latent structures from the same psychometric data
#809577
arXiv (OAI Expanded)
The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern
#818722
arXiv (All)
Different representation learning objectives recover distinct latent structures from the same psychometric data
#819573
arXiv (All)
A Simpler Analysis of the Bansal-Jiang Quasi Monte-Carlo Algorithm via Haar Wavelets
#820655
arXiv (All)
Scalable Neighborhood Local Search for Single-Machine Scheduling with Family Setup Times
#920171
arXiv (OAI Expanded)
Scalable Neighborhood Local Search for Single-Machine Scheduling with Family Setup Times
#924402
arXiv (All)
Beyond Distance Ordering: Resource Complexity and Universal Optimality of Exact Labeled Directed Shortest Paths
#971490
arXiv (All)
On Maximizing a Weakly Submodular Function over a Matroid Constraint via the Greedy Algorithm
#971967
arXiv (All)
Integrality Gap Bounds for the Goemans-Linial SDP on Finite Abelian Cayley Graphs
#972296
arXiv (All)
Hardness of Regular Expression Matching with Extensions
#973024
arXiv (All)
Bounded Independence for $k$-Min-Wise Hashing: Tight Bounds and Limitations of Structured Hashing
#974510
arXiv (All)
A deterministic $(1+\varepsilon)^n$ approximation for the permanent of a nonnegative matrix
#998613
arXiv (All)
Lower Bounds for PIR with Preprocessing from Blackbox Cryptography
#999266
arXiv (All)
Online Multi-Level Aggregation with Per-Batch Maximum Delay
#999842
arXiv (All)
A Non-constant Lower Bound for Grammar-Based Compression with Greedy
#1000075
arXiv (All)
Deterministic Streaming Lower Bounds for Approximate Maximum Clique and Maximum Independent Set
#1012810
arXiv (All)
An $\tilde Ω(\log n \log m)$ Information-Theoretic Lower Bound for Randomized Online Set Cover
#1034420
arXiv (All)
Polynomial Algorithms for Simultaneous Unitary Similarity and Equivalence
#1036423
arXiv (All)
Moving Geometric Objects to Render Their Intersection Graph Connected or Locally Dense
#1048354
arXiv (All)
Large-Scale Trade-Off Curve Computation for Incentive Allocation with Cardinality and Matroid Constraints
#1048814
arXiv (All)
Practical Data Structures and Algorithms for Java Developers : From Fundamentals to Real-World Engineering / by Mikhail Davidovich
#1065166
Deutsche Nationalbibliothek
A hybrid deep learning and data mining approach for interpretable anomaly detection in high-dimensional time-series data
#477466
Springer Nature OA
Introduction to Algorithms (SMA 5503)
#67271
MIT OpenCourseWare
Efficient Rejection Sampling in the Entropy-Optimal Range
#173267
arXiv (OAI)
Exact and Efficient Sampling from Dynamic Discrete Distributions with Finite-Precision Weights
#173313
arXiv (OAI)
Enhancing functionality and performance in NVM applications with buffered durability
#241310
UR Research
Arctic Auctions, Linear Fisher Markets, and Rational Convex Programs
#664088
arXiv (OAI Expanded)
Arctic Auctions, Linear Fisher Markets, and Rational Convex Programs
#665588
arXiv (All)
Optimal Mixing of Glauber Dynamics for the Sherrington-Kirkpatrick Model at $β< 1/2$
#682831
arXiv (OAI Expanded)
Optimal Mixing of Glauber Dynamics for the Sherrington-Kirkpatrick Model at $β< 1/2$
#684609
arXiv (All)
Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Bicriteria Optimality in 2D
#779530
arXiv (OAI Expanded)
Diva++: Dynamic Range Filtering over Hard Workloads
#779544
arXiv (OAI Expanded)
← Previous
Page 11 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.