Pages that link to "Item:Q5383959"
From MaRDI portal
The following pages link to Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Q5383959):
Displayed 50 items.
- On the optimality of approximation schemes for the classical scheduling problem (Q5384011) (← links)
- Improved Concentration Bounds for Count-Sketch (Q5384012) (← links)
- Annotations for Sparse Data Streams (Q5384013) (← links)
- Relative Errors for Deterministic Low-Rank Matrix Approximations (Q5384014) (← links)
- An Optimal Lower Bound for Distinct Elements in the Message Passing Model (Q5384015) (← links)
- Approximating matching size from random streams (Q5384016) (← links)
- Intrinsic universality in tile self-assembly requires cooperation (Q5384017) (← links)
- Timing in chemical reaction networks (Q5384018) (← links)
- Faster Agreement via a Spectral Method for Detecting Malicious Behavior (Q5384019) (← links)
- Tight Bounds for Rumor Spreading with Vertex Expansion (Q5384020) (← links)
- Tight Lower Bounds for Greedy Routing in Higher-Dimensional Small-World Grids (Q5384021) (← links)
- Polynomiality for Bin Packing with a Constant Number of Item Types (Q5384022) (← links)
- Integer quadratic programming in the plane (Q5384023) (← links)
- Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles (Q5384024) (← links)
- Optimization Despite Chaos: Convex Relaxations to Complex Limit Sets via Poincaré Recurrence (Q5384025) (← links)
- Improved upper bounds for Random-Edge and Random-Jump on abstract cubes (Q5384026) (← links)
- Smoothed Analysis of Local Search for the Maximum-Cut Problem (Q5384027) (← links)
- Bilu–Linial Stable Instances of Max Cut and Minimum Multiway Cut (Q5384028) (← links)
- A constructive algorithm for the Lovász Local Lemma on permutations (Q5384029) (← links)
- Pipage Rounding, Pessimistic Estimators and Matrix Concentration (Q5384030) (← links)
- Maximizing Social Influence in Nearly Optimal Time (Q5384031) (← links)
- Cache-Adaptive Algorithms (Q5384033) (← links)
- Near-optimal labeling schemes for nearest common ancestors (Q5384034) (← links)
- Concurrent Range Reporting in Two-Dimensional Space (Q5384035) (← links)
- Selection and Sorting in the “Restore” Model (Q5384036) (← links)
- Disjoint Set Union with Randomized Linking (Q5384037) (← links)
- Beyond Locality-Sensitive Hashing (Q5384038) (← links)
- Cutting corners cheaply, or how to remove Steiner points (Q5384039) (← links)
- Better Approximation Algorithms for the Graph Diameter (Q5384040) (← links)
- A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths (Q5384041) (← links)
- Fault Tolerant Approximate BFS Structures (Q5384042) (← links)
- New Approximations for Reordering Buffer Management (Q5384043) (← links)
- Ranking on Arbitrary Graphs: Rematch via Continuous LP with Monotone and Boundary Condition Constraints (Q5384044) (← links)
- Primal Dual Gives Almost Optimal Energy Efficient Online Algorithms (Q5384045) (← links)
- Hallucination Helps: Energy Efficient Virtual Circuit Routing (Q5384046) (← links)
- Improvements and Generalizations of Stochastic Knapsack and Multi-Armed Bandit Approximation Algorithms: Extended Abstract (Q5384047) (← links)
- Hereditary properties of permutations are strongly testable (Q5384048) (← links)
- Testing equivalence between distributions using conditional samples (Q5384049) (← links)
- Optimal Algorithms for Testing Closeness of Discrete Distributions (Q5384050) (← links)
- Testing Surface Area (Q5384051) (← links)
- A Cubic Algorithm for Computing Gaussian Volume (Q5384052) (← links)
- Non-Uniform Graph Partitioning (Q5384053) (← links)
- Approximation Algorithm for Sparsest <i>k</i>-Partitioning (Q5384054) (← links)
- Partitioning into Expanders (Q5384055) (← links)
- Flow-Based Algorithms for Local Graph Clustering (Q5384056) (← links)
- Streaming Balanced Graph Partitioning Algorithms for Random Graphs (Q5384057) (← links)
- The Complexity of Optimal Mechanism Design (Q5384058) (← links)
- The Complexity of Optimal Multidimensional Pricing (Q5384059) (← links)
- On Computability of Equilibria in Markets with Production (Q5384060) (← links)
- Constrained Signaling in Auction Design (Q5384061) (← links)