The following pages link to Sanjeev Khanna (Q178479):
Displaying 42 items.
- Stochastic Submodular Cover with Limited Adaptivity (Q5236202) (← links)
- Sublinear Algorithms for (Δ + 1) Vertex Coloring (Q5236231) (← links)
- Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling (Q5240418) (← links)
- Algorithms for Provisioning Queries and Analytics (Q5276198) (← links)
- Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches (Q5278310) (← links)
- A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem (Q5317574) (← links)
- Directed Network Design with Orientation Constraints (Q5317612) (← links)
- Tight bounds for single-pass streaming complexity of the set cover problem (Q5361872) (← links)
- On (1,<i>∊</i>)-Restricted Assignment Makespan Minimization (Q5363001) (← links)
- Connectivity in Random Forests and Credit Networks (Q5363077) (← links)
- Streaming Lower Bounds for Approximating MAX-CUT (Q5363106) (← links)
- (Q5365145) (← links)
- Approximating matching size from random streams (Q5384016) (← links)
- Disjoint Set Union with Randomized Linking (Q5384037) (← links)
- Influence Maximization in Undirected Networks (Q5384071) (← links)
- Dynamic and Nonuniform Pricing Strategies for Revenue Maximization (Q5408772) (← links)
- A Utility Equivalence Theorem for Concave Functions (Q5418990) (← links)
- On the Complexity of Graph Self-assembly in Accretive Systems (Q5452564) (← links)
- A Formal Investigation of Diff3 (Q5458859) (← links)
- Automata, Languages and Programming (Q5466464) (← links)
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem (Q5470710) (← links)
- Randomized Pursuit-Evasion with Local Visibility (Q5470813) (← links)
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (Q5479354) (← links)
- Algorithms for the Generalized Sorting Problem (Q5494998) (← links)
- Delays and the Capacity of Continuous-Time Channels (Q5495040) (← links)
- (Q5501353) (← links)
- (Q5501370) (← links)
- (Q5501799) (← links)
- (Q5692739) (← links)
- (Q5743414) (← links)
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems (Q5890864) (← links)
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems (Q5917535) (← links)
- On the hardness of approximating the chromatic number (Q5932643) (← links)
- Graph connectivity and single element recovery via linear and OR queries (Q6052041) (← links)
- (Q6126337) (← links)
- Query complexity of the metric Steiner tree problem (Q6538709) (← links)
- Nearly tight bounds for discrete search under outlier noise (Q6538774) (← links)
- New trade-offs for fully dynamic matching via hierarchical EDCS (Q6575221) (← links)
- Sublinear algorithms and lower bounds for estimating MST and TSP cost in general metrics (Q6638035) (← links)
- A faster combinatorial algorithm for maximum bipartite matching (Q6645438) (← links)
- Parallel approximate maximum flows in near-linear work and polylogarithmic depth (Q6645508) (← links)
- Code sparsification and its applications (Q6645557) (← links)
