The following pages link to Aravind Srinivasan (Q202117):
Displaying 50 items.
- Low discrepancy sets yield approximate min-wise independent permutation families (Q294714) (← links)
- The effect of random edge removal on network degree sequence (Q426822) (← links)
- Maximum bipartite flow in networks with adaptive channel width (Q541660) (← links)
- (Q676273) (redirect page) (← links)
- Improved parallel approximation of a class of integer programming problems (Q676274) (← links)
- Mix and match: Markov chains and mixing times for matching in rideshare (Q776248) (← links)
- A note on the distribution of the number of prime factors of the integers (Q975547) (← links)
- On finding the minimum bandwidth of interval graphs (Q1183610) (← links)
- Approximating hyper-rectangles: Learning and pseudorandom sets (Q1278043) (← links)
- When does a random Robin Hood win? (Q1401420) (← links)
- Improved algorithms via approximations of probability distributions (Q1582012) (← links)
- Approximating low-congestion routing and column-restricted packing problems (Q1607041) (← links)
- An improved approximation algorithm for knapsack median using sparsification (Q1751085) (← links)
- Improved bounds in stochastic matching and optimization (Q1755741) (← links)
- On the approximability of clique and related maximization problems (Q1877696) (← links)
- The local nature of \(\Delta\)-coloring and its algorithmic applications (Q1894705) (← links)
- Online stochastic matching: new algorithms and bounds (Q2006938) (← links)
- Attenuate locally, win globally: attenuation-based frameworks for online stochastic matching with timeouts (Q2285050) (← links)
- Scheduling on unrelated machines under tree-like precedence constraints (Q2391177) (← links)
- Cost-sharing mechanisms for network design (Q2471805) (← links)
- Provable algorithms for parallel generalized sweep scheduling (Q2495501) (← links)
- Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons (Q2575833) (← links)
- An improved approximation algorithm for vertex cover with hard capacities (Q2581755) (← links)
- Better Approximation Guarantees for Job-Shop Scheduling (Q2706190) (← links)
- Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems (Q2757635) (← links)
- (Q2768349) (← links)
- (Q2768400) (← links)
- Improved algorithms via approximations of probability distributions (extended abstract) (Q2817653) (← links)
- Efficient computation of sparse structures (Q2820273) (← links)
- Lower Bounds on the Deterministic and Quantum Communication Complexity of Hamming-Distance Problems (Q2828234) (← links)
- (Q2934726) (← links)
- (Q3002765) (← links)
- (Q3140437) (← links)
- (Q3191563) (← links)
- The value of strong inapproximability results for clique (Q3191981) (← links)
- An Extension of the Lovász Local Lemma, and its Applications to Integer Programming (Q3446810) (← links)
- A unified approach to scheduling on unrelated parallel machines (Q3452224) (← links)
- An Improved Approximation Algorithm for Knapsack Median Using Sparsification (Q3452792) (← links)
- A note on near-optimal coloring of shift hypergraphs (Q3467579) (← links)
- The Randomized Coloring Procedure with Symmetry-Breaking (Q3521929) (← links)
- Budgeted Allocations in the Full-Information Setting (Q3541799) (← links)
- Dependent rounding and its applications to approximation algorithms (Q3546323) (← links)
- Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm (Q3569822) (← links)
- On k-Column Sparse Packing Programs (Q3569831) (← links)
- (Q3579374) (← links)
- Maximum Bipartite Flow in Networks with Adaptive Channel Width (Q3638105) (← links)
- Explicit OR-dispersers with polylogarithmic degree (Q3841042) (← links)
- (Q4224936) (← links)
- (Q4231915) (← links)
- (Q4231923) (← links)
