data-structures-and-algorithms

Documents about data-structures-and-algorithms

• The clustered Sparrow algorithm#131164arXiv (OAI)
• Optimal Capacity Modification for Stable Matchings with Ties#141671arXiv (OAI)
• Resident fitness computation in linear time and other algorithmic aspects of interacting trajectories#141700arXiv (OAI)
• Online Algorithms with Randomly Infused Advice#144178arXiv (OAI)
• Moser-Tardos Algorithm with small number of random bits#163962arXiv (OAI Expanded)
• First Order Logic on Pathwidth Revisited Again#189108arXiv (OAI Expanded)
• An Approximation Algorithm for 2-Vertex-Connectivity via Cycle-Restricted 2-Edge-Covers#608876arXiv (OAI Expanded)
• Bitcoin Mempool Linearization#608942arXiv (OAI Expanded)
• Isomorphism of tournaments with bounded VC dimension#609648arXiv (All)
• Graph Streaming Lower Bounds for Parameter Estimation and Property Testing via a Streaming XOR Lemma#609718arXiv (All)
• Spectral clustering in the Gaussian mixture block model#609727arXiv (All)
• Differentially Private Verification of Distribution Properties#609910arXiv (All)
• An Approximation Algorithm for 2-Vertex-Connectivity via Cycle-Restricted 2-Edge-Covers#609938arXiv (All)
• Bitcoin Mempool Linearization#610004arXiv (All)
• Fair Division Meets Scheduling: Approximately Envy-Free Interval Scheduling#612584arXiv (All)
• Do You Have My Size In Stock? Assortment and Inventory Optimization Under the Consider-Fit-Then-Choose Choice Model#612595arXiv (All)
• An efficient polynomial-time approximation scheme for parallel multi-stage open shops#612694arXiv (All)
• Optimal-Time Contextual Pattern Matching in Compressed Space#664333arXiv (OAI Expanded)
• Practical Linear-Time Computation of Smallest Suffixient Sets#664334arXiv (OAI Expanded)
• Exploiting Low Scanwidth to Resolve Soft Polytomies#668366arXiv (OAI Expanded)
• Stable Matching with Deviators and Conformists#668405arXiv (OAI Expanded)
• Designing Efficient and Reachable Routes: The $k$-Step-Central Shortest Path Problem#668569arXiv (OAI Expanded)
• Online Correlation Clustering with Metric Weights#668667arXiv (OAI Expanded)
• Online Stochastic Packing and Combinatorial Allocation with General Correlations#674210arXiv (OAI Expanded)
• Support Recovery in One-bit Compressed Sensing with Near-Optimal Measurements and Sublinear Time#674248arXiv (OAI Expanded)
• SimdQuickHeap: The QuickHeap Reconsidered#674385arXiv (OAI Expanded)
• The Anti-Lexicographic SUS-Anchor: An Empirically Optimal Selection Scheme#674420arXiv (OAI Expanded)
• Revisiting $O(n \log \log n)$ chaining for anchored edit distance#674424arXiv (OAI Expanded)
• Support Recovery in One-bit Compressed Sensing with Near-Optimal Measurements and Sublinear Time#677445arXiv (All)
• SimdQuickHeap: The QuickHeap Reconsidered#677584arXiv (All)
• The Anti-Lexicographic SUS-Anchor: An Empirically Optimal Selection Scheme#677620arXiv (All)
• Revisiting $O(n \log \log n)$ chaining for anchored edit distance#677624arXiv (All)
• Quantum Computing: Lecture Notes#684130arXiv (All)
• A Tight Bound for Facial Distance Patterns in Planar Graphs#684573arXiv (All)
• Optimal Mixing of Glauber Dynamics for the Sherrington-Kirkpatrick Model at $β< 1/2$#684609arXiv (All)
• Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Bicriteria Optimality in 2D#780905arXiv (All)
• A Note on Approximating the Rural Postman Problem below 3/2#780912arXiv (All)
• Diva++: Dynamic Range Filtering over Hard Workloads#780919arXiv (All)

Related topics