The following pages link to Sandeep Sen (Q315535):
Displaying 50 items.
- (Q209596) (redirect page) (← links)
- The update complexity of selection and related problems (Q315536) (← links)
- The robust knapsack problem with queries (Q337391) (← links)
- A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems (Q486976) (← links)
- On parallel integer sorting (Q805234) (← links)
- Finding an approximate median with high probability in constant parallel time (Q911292) (← links)
- All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time (Q1001904) (← links)
- Improvements on the Johnson bound for Reed-Solomon codes (Q1028479) (← links)
- A generalization of the 0-1 principle for sorting (Q1041721) (← links)
- Some observations on skip-lists (Q1182095) (← links)
- Optimal randomized parallel algorithms for computational geometry (Q1187202) (← links)
- Dynamic point location in arrangements of hyperplanes (Q1199133) (← links)
- Improved algorithms for uniform partitions of points (Q1348950) (← links)
- Optimal, output-sensitive algorithms for constructing planar hulls in parallel (Q1367171) (← links)
- Parallel searching in generalized Monge arrays (Q1386363) (← links)
- Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems (Q1389649) (← links)
- Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima. (Q1398784) (← links)
- Faster coreset construction for projective clustering via low-rank approximation (Q1671019) (← links)
- An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains (Q1804963) (← links)
- Planar graph blocking for external searching (Q1849382) (← links)
- Fair adaptive bandwidth allocation: a rate control based active queue management discipline (Q1883569) (← links)
- A linear time deterministic algorithm to find a small subset that approximates the centroid (Q2380033) (← links)
- Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions (Q2507694) (← links)
- A linear time algorithm for approximate 2-means clustering (Q2573339) (← links)
- Fast and Optimal Parallel Multidimensional Search in PRAMs with Applications to Linear Programming and Related Problems (Q2706119) (← links)
- The update complexity of selection and related problems (Q2911635) (← links)
- A Simple D 2-Sampling Based PTAS for k-Means and other Clustering Problems (Q2914307) (← links)
- Approximate distance oracles for unweighted graphs in expected <i>O</i> ( <i>n</i> <sup>2</sup> ) time (Q2944530) (← links)
- (Q2957502) (← links)
- (Q3045149) (← links)
- IMPROVED SELECTION IN TOTALLY MONOTONE ARRAYS (Q3136720) (← links)
- The Covert Set-Cover Problem with Application to Network Discovery (Q3404448) (← links)
- Towards a theory of cache-efficient algorithms (Q3455551) (← links)
- (Q3484356) (← links)
- Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error (Q3521953) (← links)
- Linear-time approximation schemes for clustering problems in any dimensions (Q3578186) (← links)
- Approximating Shortest Paths in Graphs (Q3605483) (← links)
- Parallel sorting in two-dimensional VLSI models of computation (Q3823790) (← links)
- Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems (Q4016909) (← links)
- Erratum: Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems (Q4291568) (← links)
- Randomized Algorithms for Binary Search and Load Balancing on Fixed Connection Networks with Geometric Applications (Q4302288) (← links)
- On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm (Q4366880) (← links)
- (Q4415266) (← links)
- (Q4449190) (← links)
- (Q4470505) (← links)
- (Q4471322) (← links)
- (Q4472449) (← links)
- (Q4474217) (← links)
- (Q4511241) (← links)
- Optimal and Practical Algorithms for Sorting on the PDM (Q4589566) (← links)
