Search

Your search keyword '"KHANNA, SANJEEV"' showing total 769 results

Search Constraints

Start Over You searched for: Author "KHANNA, SANJEEV" Remove constraint Author: "KHANNA, SANJEEV"
769 results on '"KHANNA, SANJEEV"'

Search Results

1. Near-optimal Size Linear Sketches for Hypergraph Cut Sparsifiers

2. Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemeredi Graphs

3. Maximum Bipartite Matching in $n^{2+o(1)}$ Time via a Combinatorial Algorithm

4. Characterizations of Sparsifiability for Affine CSPs and Symmetric CSPs

5. Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth

6. Almost-Tight Bounds on Preserving Cuts in Classes of Submodular Hypergraphs

7. A Faster Combinatorial Algorithm for Maximum Bipartite Matching

8. Code Sparsification and its Applications

9. Query Complexity of the Metric Steiner Tree Problem

10. On Weighted Graph Sparsification by Linear Sketching

11. On Regularity Lemma and Barriers in Streaming and Dynamic Matching

12. Sublinear Algorithms for Hierarchical Clustering

13. A Sharp Memory-Regret Trade-Off for Multi-Pass Streaming Bandits

17. Sublinear Algorithms and Lower Bounds for Estimating MST and TSP Cost in General Metrics

18. New Trade-Offs for Fully Dynamic Matching via Hierarchical EDCS

19. A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization and Matroid Intersection

21. Sublinear Time Hypergraph Sparsification via Cut and Edge Sampling Queries

22. Near-linear Size Hypergraph Cut Sparsifiers

23. Graph Connectivity and Single Element Recovery via Linear and OR Queries

24. An Efficient PTAS for Stochastic Load Balancing with Poisson Jobs

25. Sublinear Algorithms and Lower Bounds for Metric TSP Cost Estimation

26. Near-Perfect Recovery in the One-Dimensional Latent Space Model

27. Network Formation under Random Attack and Probabilistic Spread

28. A New Algorithm for Decremental Single-Source Shortest Paths with Applications to Vertex-Capacitated Flow and Cut Problems

29. Polynomial Pass Lower Bounds for Graph Streaming Algorithms

30. A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling

32. Stochastic Submodular Cover with Limited Adaptivity

33. Testing Graph Clusterability: Algorithms and Lower Bounds

34. Sublinear Algorithms for $(\Delta + 1)$ Vertex Coloring

35. Tight Bounds on the Round Complexity of the Distributed Maximum Coverage Problem

36. Better and Simpler Error Analysis of the Sinkhorn-Knopp Algorithm for Matrix Scaling

37. Randomized Composable Coresets for Matching and Vertex Cover

38. The Stochastic Matching Problem: Beating Half with a Non-Adaptive Algorithm

39. On Estimating Maximum Matching Size in Graph Streams

41. Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem

42. Flow and Heat Transfer in Micro Pin Fin Heat Sinks with Nano-Encapsulated Phase Change Materials

43. Algorithms for Provisioning Queries and Analytics

44. Strategic Network Formation with Attack and Immunization

48. Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches

49. Fast Convergence in the Double Oral Auction

50. Tight Bounds for Linear Sketches of Approximate Matchings

Catalog

Books, media, physical & digital resources