The SCEAS System
| |||||||

## Search the dblp DataBase
Sandeep Sen:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Neelima Gupta, Sandeep Sen
**Faster Output-Sensitive Parallel Convex Hulls for**[Citation Graph (0, 0)][DBLP]*d*<=3: Optimal Sublogarithmic Algorithms for Small Outputs. Symposium on Computational Geometry, 1996, pp:176-185 [Conf] - Ketan Mulmuley, Sandeep Sen
**Dynamic Point Location in Arrangements of Hyperplanes.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1991, pp:132-141 [Conf] - John H. Reif, Sandeep Sen
**An Efficient Output-Sensitive Hidden Surface Removal Algorithm and Its Parallelization.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1988, pp:193-200 [Conf] - Amit Kumar, Yogish Sabharwal, Sandeep Sen
**A Simple Linear Time (1+ ) -Approximation Algorithm for k-Means Clustering in Any Dimensions.**[Citation Graph (0, 0)][DBLP] FOCS, 2004, pp:454-462 [Conf] - Yiming Ma, Sandeep Sen, Isaac D. Scherson
**The Distance Bound for Sorting on Mesh-Connected Processor Arrays Is Tight (Preliminary Report)**[Citation Graph (0, 0)][DBLP] FOCS, 1986, pp:255-263 [Conf] - Surender Baswana, Sandeep Sen
**Planar Graph Blocking for External Searching.**[Citation Graph (0, 0)][DBLP] FSTTCS, 2000, pp:252-263 [Conf] - Sandeep Sen
**Lower Bounds for Parallel Algebraic Decision Trees, Complexity of Convex Hulls and Related Problems.**[Citation Graph (0, 0)][DBLP] FSTTCS, 1994, pp:193-204 [Conf] - Neelima Gupta, Sumit Chopra, Sandeep Sen
**Optimal, Output-Sensitive Algorithms for Constructing Upper Envelope of Line Segments in Parallel.**[Citation Graph (0, 0)][DBLP] FSTTCS, 2001, pp:183-194 [Conf] - Yogish Sabharwal, Nishant Sharma, Sandeep Sen
**Nearest Neighbors Search Using Point Location in Balls with Applications to Approximate Voronoi Decompositions.**[Citation Graph (0, 0)][DBLP] FSTTCS, 2002, pp:311-323 [Conf] - Akshat Verma, Sandeep Sen
**Algorithmic Ramifications of Prefetching in Memory Hierarchy.**[Citation Graph (0, 0)][DBLP] HiPC, 2006, pp:9-21 [Conf] - Siddhartha Chatterjee, Sandeep Sen
**Cache-Efficient Matrix Transposition.**[Citation Graph (0, 0)][DBLP] HPCA, 2000, pp:195-205 [Conf] - Surender Baswana, Sandeep Sen
**A Simple Linear Time Algorithm for Computing a (2k-1)-Spanner of O(n**[Citation Graph (0, 0)][DBLP]^{1+1/k}) Size in Weighted Graphs. ICALP, 2003, pp:384-296 [Conf] - Amit Kumar, Yogish Sabharwal, Sandeep Sen
**Linear Time Algorithms for Clustering Problems in Any Dimensions.**[Citation Graph (0, 0)][DBLP] ICALP, 2005, pp:1374-1385 [Conf] - John H. Reif, Sandeep Sen
**Optimal Randomized Parallel Algorithms for Computational Geometry.**[Citation Graph (0, 0)][DBLP] ICPP, 1987, pp:270-277 [Conf] - Sandeep Sen, Isaac D. Scherson, Adi Shamir
**Shear Sort: A True Two-Dimensional Sorting Techniques for VLSI Networks.**[Citation Graph (0, 0)][DBLP] ICPP, 1986, pp:903-908 [Conf] - John H. Reif, Sandeep Sen
**Randomized Parallel Algorithms.**[Citation Graph (0, 0)][DBLP] IFIP Congress, 1989, pp:455-458 [Conf] - Neelima Gupta, Sandeep Sen
**An Improved Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains.**[Citation Graph (0, 0)][DBLP] IPPS/SPDP, 1998, pp:215-219 [Conf] - Sanguthevar Rajasekaran, Sandeep Sen
**PDM Sorting Algorithms That Take A Small Number of Passes.**[Citation Graph (0, 0)][DBLP] IPDPS, 2005, pp:- [Conf] - Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen
**Output-Sensitive Algorithms for Uniform Partitions of Points.**[Citation Graph (0, 0)][DBLP] ISAAC, 1999, pp:403-414 [Conf] - Sanguthevar Rajasekaran, Sandeep Sen
**A Simple Optimal Randomized Algorithm for Sorting on the PDM.**[Citation Graph (0, 0)][DBLP] ISAAC, 2005, pp:543-552 [Conf] - Abhinav Kamra, Huzur Saran, Sandeep Sen, Rajeev Shorey
**Fair Adaptive Bandwidth Allocation: A Rate Control Based Active Queue Management Discipline.**[Citation Graph (0, 0)][DBLP] NETWORKING, 2002, pp:838-849 [Conf] - John H. Reif, Sandeep Sen
**Randomization in Parallel Algorithms and its Impact on Computational Geometry.**[Citation Graph (0, 0)][DBLP] Optimal Algorithms, 1989, pp:1-8 [Conf] - Surender Baswana, Ramesh Hariharan, Sandeep Sen
**Maintaining all-pairs approximate shortest paths under deletion of edges.**[Citation Graph (0, 0)][DBLP] SODA, 2003, pp:394-403 [Conf] - Surender Baswana, Sandeep Sen
**Approximate distance oracles for unweighted graphs in Õ(n**[Citation Graph (0, 0)][DBLP]^{2}) time. SODA, 2004, pp:271-280 [Conf] - Sandeep Sen, Siddhartha Chatterjee
**Towards a theory of cache-efficient algorithms.**[Citation Graph (0, 0)][DBLP] SODA, 2000, pp:829-838 [Conf] - Alok Aggarwal, Dina Kravets, James K. Park, S. Sen
**Parallel Searching in Generalized Monge Arrays with Applications.**[Citation Graph (0, 0)][DBLP] SPAA, 1990, pp:259-268 [Conf] - Sandeep Sen
**Parallel Multidimensional Search Using Approximation Algorithms: With Applications to Linear-Programming and Related Problems.**[Citation Graph (0, 0)][DBLP] SPAA, 1996, pp:251-260 [Conf] - John H. Reif, Sandeep Sen
**Randomized Algorithms for Binary Search and Load Balancing with Geometric Applications.**[Citation Graph (0, 0)][DBLP] SPAA, 1990, pp:327-339 [Conf] - Surender Baswana, Vishrut Goyal, Sandeep Sen
**All-Pairs Nearly 2-Approximate Shortest-Paths in O(n**[Citation Graph (0, 0)][DBLP]^{2}polylog n) Time. STACS, 2005, pp:666-679 [Conf] - Surender Baswana, Ramesh Hariharan, Sandeep Sen
**Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths.**[Citation Graph (0, 0)][DBLP] STOC, 2002, pp:117-123 [Conf] - John H. Reif, Sandeep Sen
**Polling: A New Randomized Sampling Technique for Computational Geometry**[Citation Graph (0, 0)][DBLP] STOC, 1989, pp:394-404 [Conf] - Pankaj K. Agarwal, Sandeep Sen
**Selection in Monotone Matrices and Computing k**[Citation Graph (0, 0)][DBLP]^{th}Nearest Neighbors. SWAT, 1994, pp:13-24 [Conf] - Sandeep Sen
**Fractional Cascading Simplified.**[Citation Graph (0, 0)][DBLP] SWAT, 1992, pp:212-220 [Conf] - Sandeep Sen, Neelima Gupta
**Distribution-Sensitive Algorithms.**[Citation Graph (0, 0)][DBLP] SWAT, 1998, pp:335-346 [Conf] - Sanguthevar Rajasekaran, Sandeep Sen
**On Parallel Integer Sorting.**[Citation Graph (0, 0)][DBLP] Acta Inf., 1992, v:29, n:1, pp:1-15 [Journal] - Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen
**Improved Algorithms for Uniform Partitions of Points.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2002, v:32, n:4, pp:521-539 [Journal] - Alok Aggarwal, Dina Kravets, James K. Park, S. Sen
**Parallel Searching in Generalized Monge Arrays.**[Citation Graph (0, 0)][DBLP] Algorithmica, 1997, v:19, n:3, pp:291-317 [Journal] - Surender Baswana, Sandeep Sen
**Planar Graph Blocking for External Searching.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2002, v:34, n:3, pp:298-308 [Journal] - Neelima Gupta, Sandeep Sen
**An Efficient Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2001, v:31, n:2, pp:179-207 [Journal] - John H. Reif, Sandeep Sen
**Optimal Randomized Parallel Algorithms for Computational Geometry.**[Citation Graph (0, 0)][DBLP] Algorithmica, 1992, v:7, n:1, pp:91-117 [Journal] - Abhinav Kamra, Huzur Saran, Sandeep Sen, Rajeev Shorey
**Fair adaptive bandwidth allocation: a rate control based active queue management discipline.**[Citation Graph (0, 0)][DBLP] Computer Networks, 2004, v:44, n:2, pp:135-152 [Journal] - Neelima Gupta, Sandeep Sen
**Optimal, Output-sensitive Algorithms for Constructing Planar Hulls in Parallel.**[Citation Graph (0, 0)][DBLP] Comput. Geom., 1997, v:8, n:, pp:151-166 [Journal] - Yogish Sabharwal, Sandeep Sen
**A linear time algorithm for approximate 2-means clustering.**[Citation Graph (0, 0)][DBLP] Comput. Geom., 2005, v:32, n:2, pp:159-172 [Journal] - Sandeep Sen, Siddhartha Chatterjee, Neeraj Dumir
**Towards a Theory of Cache-Efficient Algorithms**[Citation Graph (0, 0)][DBLP] CoRR, 2000, v:0, n:, pp:- [Journal] - Ketan Mulmuley, Sandeep Sen
**Dynamic Point Location in Arrangement of Hyperplanes.**[Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 1992, v:8, n:, pp:335-360 [Journal] - Sandeep Sen
**Finding an Approximate Median with High Probability in Constant Parallel Time.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1990, v:34, n:2, pp:77-80 [Journal] - Sandeep Sen
**Some Observations on Skip-Lists.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1991, v:39, n:4, pp:173-176 [Journal] - Sanguthevar Rajasekaran, Sandeep Sen
**A generalization of the 0-1 principle for sorting.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2005, v:94, n:1, pp:43-47 [Journal] - Sandeep Sen, Siddhartha Chatterjee, Neeraj Dumir
**Towards a theory of cache-efficient algorithms.**[Citation Graph (0, 0)][DBLP] J. ACM, 2002, v:49, n:6, pp:828-858 [Journal] - Pankaj K. Agarwal, Sandeep Sen
**Selection in Monotone Matrices and Computing**[Citation Graph (0, 0)][DBLP]*k*th Nearest Neighbors. J. Algorithms, 1996, v:20, n:3, pp:581-601 [Journal] - Binay K. Bhattacharya, Sandeep Sen
**On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1997, v:25, n:1, pp:177-193 [Journal] - Sandeep Sen
**Fractional Cascading Revisited.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1995, v:19, n:2, pp:161-172 [Journal] - Surender Baswana, Ramesh Hariharan, Sandeep Sen
**Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 2007, v:62, n:2, pp:74-92 [Journal] - Yogish Sabharwal, Nishant Sharma, Sandeep Sen
**Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2006, v:72, n:6, pp:955-977 [Journal] - Neelima Gupta, Sandeep Sen
**Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima.**[Citation Graph (0, 0)][DBLP] J. Parallel Distrib. Comput., 2003, v:63, n:4, pp:488-500 [Journal] - Isaac D. Scherson, Sandeep Sen, Yiming Ma
**Two Nearly Optimal Sorting Algorithms for Mesh-Connected Processor Arrays Using Shear-Sort.**[Citation Graph (0, 0)][DBLP] J. Parallel Distrib. Comput., 1989, v:6, n:1, pp:151-165 [Journal] - Sandeep Sen, Neelima Gupta
**Distribution-Sensitive Algorithms.**[Citation Graph (0, 0)][DBLP] Nord. J. Comput., 1999, v:6, n:2, pp:194-0 [Journal] - Martin E. Dyer, Sandeep Sen
**Fast and Optimal Parallel Multidimensional Search in PRAMs with Applications to Linear Programming and Related Problems.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2000, v:30, n:5, pp:1443-1461 [Journal] - John H. Reif, Sandeep Sen
**Randomized Algorithms for Binary Search and Load Balancing on Fixed Connection Networks with Geometric Applications.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1994, v:23, n:3, pp:633-651 [Journal] - John H. Reif, Sandeep Sen
**Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1992, v:21, n:3, pp:466-485 [Journal] - John H. Reif, Sandeep Sen
**Erratum: Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1994, v:23, n:2, pp:447-448 [Journal] - Surender Baswana, Sandeep Sen
**Approximate distance oracles for unweighted graphs in expected**[Citation Graph (0, 0)][DBLP]*O*(*n*^{2}) time. ACM Transactions on Algorithms, 2006, v:2, n:4, pp:557-577 [Journal] - Isaac D. Scherson, Sandeep Sen
**Parallel Sorting in Two-Dimensional VLSI Models of Computation.**[Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 1989, v:38, n:2, pp:238-249 [Journal] - Sandeep Sen
**Lower Bounds for Parallel Algebraic Decision Trees, Parallel Complexity of Convex Hulls and Related Problems.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1997, v:188, n:1-2, pp:59-78 [Journal] **Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error.**[Citation Graph (, )][DBLP]**A Result on the Distribution of Quadratic Residues with Applications to Elliptic Curve Cryptography.**[Citation Graph (, )][DBLP]**The Covert Set-Cover Problem with Application to Network Discovery.**[Citation Graph (, )][DBLP]**Approximating Shortest Paths in Graphs.**[Citation Graph (, )][DBLP]**Improvements on the Johnson bound for Reed-Solomon codes.**[Citation Graph (, )][DBLP]
Search in 0.045secs, Finished in 0.049secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |