Pages that link to "Item:Q4575732"
From MaRDI portal
The following pages link to Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Q4575732):
Displaying 50 items.
- LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs (Q2009630) (← links)
- Parallel Algorithms and Concentration Bounds for the Lovász Local Lemma via Witness DAGs (Q4554943) (← links)
- Proximity in the Age of Distraction: Robust Approximate Nearest Neighbor Search (Q4575733) (← links)
- High-dimensional approximate <i>r</i>-nets (Q4575735) (← links)
- A Framework for Similarity Search with Space-Time Tradeoffs using Locality-Sensitive Filtering (Q4575736) (← links)
- Optimal Hashing-based Time-Space Trade-offs for Approximate Near Neighbors (Q4575737) (← links)
- LSH Forest: Practical Algorithms Made Theoretical (Q4575739) (← links)
- Faster approximation schemes for the two-dimensional knapsack problem (Q4575740) (← links)
- Split Packing: An Algorithm for Packing Circles with Optimal Worst-Case Density (Q4575741) (← links)
- Stochastic <i>k</i>-Center and <i>j</i>-Flat-Center Problems (Q4575742) (← links)
- Local Search for Max-Sum Diversification (Q4575743) (← links)
- Maximum Scatter TSP in Doubling Metrics (Q4575744) (← links)
- Matrix Balancing in <i>L</i><sub>p</sub> Norms: Bounding the Convergence Rate of Osborne's Iteration (Q4575746) (← links)
- Decidability of the Membership Problem for 2 <b>×</b> 2 integer matrices (Q4575747) (← links)
- The Identity Problem for Matrix Semigroups in SL<sub>2</sub>(ℤ) is <b>NP</b>-complete (Q4575748) (← links)
- Exploring an Infinite Space with Finite Memory Scouts (Q4575750) (← links)
- Universal Shape Replicators via Self-Assembly with Attractive and Repulsive Forces (Q4575751) (← links)
- Parameter-free Locality Sensitive Hashing for Spherical Range Reporting (Q4575752) (← links)
- Distance Sensitive Bloom Filters Without False Negatives (Q4575754) (← links)
- Optimal Approximate Polytope Membership (Q4575755) (← links)
- Massively-Parallel Similarity Join, Edge-Isoperimetry, and Distance Correlations on the Hypercube (Q4575756) (← links)
- Even Delta-Matroids and the Complexity of Planar Boolean CSPs (Q4575757) (← links)
- Linear Diophantine Equations, Group CSPs, and Graph Isomorphism (Q4575758) (← links)
- Robust algorithms with polynomial loss for near-unanimity CSPs (Q4575759) (← links)
- Parameterized Algorithms for Constraint Satisfaction Problems Above Average with Global Cardinality Constraints (Q4575760) (← links)
- Hardness of Permutation Pattern Matching (Q4575761) (← links)
- pBWT: Achieving Succinct Data Structures for Parameterized Pattern Matching and Related Problems (Q4575762) (← links)
- Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time (Q4575763) (← links)
- Sparse Suffix Tree Construction in Optimal Time and Space (Q4575764) (← links)
- Fully dynamic all-pairs shortest paths with worst-case update-time revisited (Q4575765) (← links)
- Deterministic Partially Dynamic Single Source Shortest Paths for Sparse Graphs (Q4575766) (← links)
- Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in <i>O</i>(log<sup>3</sup> <i>n</i>) Worst Case Update Time (Q4575767) (← links)
- Connectivity Oracles for Graphs Subject to Vertex Failures (Q4575768) (← links)
- Fully Dynamic Connectivity in <i>O</i>(log <i>n</i>(log log <i>n</i>)<sup>2</sup>) Amortized Expected Time (Q4575769) (← links)
- Best-Response Dynamics in Combinatorial Auctions with Item Bidding (Q4575770) (← links)
- Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds (Q4575771) (← links)
- Convergence of Incentive-Driven Dynamics in Fisher Markets (Q4575772) (← links)
- A Hierarchy of Lower Bounds for Sublinear Additive Spanners (Q4575773) (← links)
- Totally Unimodular Congestion Games (Q4575774) (← links)
- LAST but not Least: Online Spanners for Buy-at-Bulk (Q4575775) (← links)
- Linear Size Distance Preservers (Q4575776) (← links)
- Playing Anonymous Games using Simple Strategies (Q4575777) (← links)
- Computing Walrasian Equilibria: Fast Algorithms and Structural Properties (Q4575778) (← links)
- Efficient Algorithms for Constructing Very Sparse Spanners and Emulators (Q4575779) (← links)
- Metric embeddings with outliers (Q4575780) (← links)
- Probabilistic clustering of high dimensional norms (Q4575781) (← links)
- Near-Optimal (Euclidean) Metric Compression (Q4575783) (← links)
- A Treehouse with Custom Windows: Minimum Distortion Embeddings into Bounded Treewidth Graphs (Q4575784) (← links)
- Beyond Metric Embedding: Approximating Group Steiner Trees on Bounded Treewidth Graphs (Q4575785) (← links)
- Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ (<i>m</i><sup>10/7</sup> log <i>W</i>) Time (Extended Abstract) (Q4575786) (← links)
