Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Sandeep Sen
@inproceedings{DBLP:conf/dcc/BanchhorGSS21,
author = {Shashwat Banchhor and
Rishikesh R. Gajjala and
Yogish Sabharwal and
Sandeep Sen},
editor = {Ali Bilgin and
Michael W. Marcellin and
Joan Serra{-}Sagrist{\`{a}} and
James A. Storer},
title = {Efficient algorithms for decode efficient prefix codes},
booktitle = {31st Data Compression Conference, {DCC} 2021, Snowbird, UT, USA, March
23-26, 2021},
pages = {338},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/DCC50243.2021.00080},
doi = {10.1109/DCC50243.2021.00080},
timestamp = {Mon, 17 May 2021 15:23:04 +0200},
biburl = {https://dblp.org/rec/conf/dcc/BanchhorGSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BanchhorGSS21,
author = {Shashwat Banchhor and
Rishikesh R. Gajjala and
Yogish Sabharwal and
Sandeep Sen},
editor = {Mikolaj Bojanczyk and
Chandra Chekuri},
title = {Generalizations of Length Limited Huffman Coding for Hierarchical
Memory Settings},
booktitle = {41st {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2021, December 15-17, 2021,
Virtual Conference},
series = {LIPIcs},
volume = {213},
pages = {8:1--8:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2021.8},
doi = {10.4230/LIPICS.FSTTCS.2021.8},
timestamp = {Tue, 30 Nov 2021 13:59:34 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/BanchhorGSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcc/BanchhorGSS20,
author = {Shashwat Banchhor and
Rishikesh R. Gajjala and
Yogish Sabharwal and
Sandeep Sen},
editor = {Ali Bilgin and
Michael W. Marcellin and
Joan Serra{-}Sagrist{\`{a}} and
James A. Storer},
title = {Decode-Efficient Prefix Codes for Hierarchical Memory Models},
booktitle = {Data Compression Conference, {DCC} 2020, Snowbird, UT, USA, March
24-27, 2020},
pages = {360},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/DCC47342.2020.00077},
doi = {10.1109/DCC47342.2020.00077},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dcc/BanchhorGSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2010-05005,
author = {Shashwat Banchhor and
Rishikesh R. Gajjala and
Yogish Sabharwal and
Sandeep Sen},
title = {Decode efficient prefix codes},
journal = {CoRR},
volume = {abs/2010.05005},
year = {2020},
url = {https://arxiv.org/abs/2010.05005},
eprinttype = {arXiv},
eprint = {2010.05005},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2010-05005.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Sen19,
author = {Sandeep Sen},
editor = {Rolf Niedermeier and
Christophe Paul},
title = {A Unified Approach to Tail Estimates for Randomized Incremental Construction},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2019, March 13-16, 2019, Berlin, Germany},
series = {LIPIcs},
volume = {126},
pages = {58:1--58:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.STACS.2019.58},
doi = {10.4230/LIPICS.STACS.2019.58},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/Sen19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BaswanaGS18,
author = {Surender Baswana and
Manoj Gupta and
Sandeep Sen},
title = {Fully Dynamic Maximal Matching in O(log n) Update Time (Corrected
Version)},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {3},
pages = {617--650},
year = {2018},
url = {https://doi.org/10.1137/16M1106158},
doi = {10.1137/16M1106158},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BaswanaGS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/PratapS18,
author = {Rameshwar Pratap and
Sandeep Sen},
editor = {Costas S. Iliopoulos and
Hon Wai Leong and
Wing{-}Kin Sung},
title = {Faster Coreset Construction for Projective Clustering via Low-Rank
Approximation},
booktitle = {Combinatorial Algorithms - 29th International Workshop, {IWOCA} 2018,
Singapore, July 16-19, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10979},
pages = {336--348},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-94667-2\_28},
doi = {10.1007/978-3-319-94667-2\_28},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/PratapS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/tf/18/JaiswalS18,
author = {Ragesh Jaiswal and
Sandeep Sen},
editor = {Teofilo F. Gonzalez},
title = {Approximate Clustering},
booktitle = {Handbook of Approximation Algorithms and Metaheuristics, Second Edition,
Volume 2: Contemporary and Emerging Applications},
publisher = {Chapman and Hall/CRC},
year = {2018},
timestamp = {Mon, 28 Oct 2019 16:49:19 +0100},
biburl = {https://dblp.org/rec/books/tf/18/JaiswalS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-06875,
author = {Arijit Bishnu and
Arijit Ghosh and
Gopinath Mishra and
Sandeep Sen},
title = {On the streaming complexity of fundamental geometric problems},
journal = {CoRR},
volume = {abs/1803.06875},
year = {2018},
url = {http://arxiv.org/abs/1803.06875},
eprinttype = {arXiv},
eprint = {1803.06875},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-06875.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-02356,
author = {Sandeep Sen},
title = {On tail estimates for Randomized Incremental Construction},
journal = {CoRR},
volume = {abs/1808.02356},
year = {2018},
url = {http://arxiv.org/abs/1808.02356},
eprinttype = {arXiv},
eprint = {1808.02356},
timestamp = {Sun, 02 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-02356.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GuptaSS16,
author = {Manoj Gupta and
Yogish Sabharwal and
Sandeep Sen},
title = {The Update Complexity of Selection and Related Problems},
journal = {Theory Comput. Syst.},
volume = {59},
number = {1},
pages = {112--132},
year = {2016},
url = {https://doi.org/10.1007/s00224-015-9664-y},
doi = {10.1007/S00224-015-9664-Y},
timestamp = {Tue, 25 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/GuptaSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/todaes/ChakrabortyPS16,
author = {Prasenjit Chakraborty and
Preeti Ranjan Panda and
Sandeep Sen},
title = {Partitioning and Data Mapping in Reconfigurable Cache and Scratchpad
Memory-Based Architectures},
journal = {{ACM} Trans. Design Autom. Electr. Syst.},
volume = {22},
number = {1},
pages = {12:1--12:25},
year = {2016},
url = {https://doi.org/10.1145/2934680},
doi = {10.1145/2934680},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/todaes/ChakrabortyPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/fsttcs/2016,
editor = {Akash Lal and
S. Akshay and
Saket Saurabh and
Sandeep Sen},
title = {36th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2016, December 13-15, 2016,
Chennai, India},
series = {LIPIcs},
volume = {65},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {http://www.dagstuhl.de/dagpub/978-3-95977-027-9},
isbn = {978-3-95977-027-9},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/2016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/BaswanaGS16,
author = {Surender Baswana and
Manoj Gupta and
Sandeep Sen},
title = {Matching in Dynamic Graphs},
booktitle = {Encyclopedia of Algorithms},
pages = {1195--1199},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_567},
doi = {10.1007/978-1-4939-2864-4\_567},
timestamp = {Wed, 26 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/BaswanaGS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/BaswanaS16,
author = {Surender Baswana and
Sandeep Sen},
title = {Simple Algorithms for Spanners in Weighted Graphs},
booktitle = {Encyclopedia of Algorithms},
pages = {1981--1986},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_10},
doi = {10.1007/978-1-4939-2864-4\_10},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/BaswanaS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/PratapS16,
author = {Rameshwar Pratap and
Sandeep Sen},
title = {Faster coreset construction for subspace and projective clustering},
journal = {CoRR},
volume = {abs/1606.07992},
year = {2016},
url = {http://arxiv.org/abs/1606.07992},
eprinttype = {arXiv},
eprint = {1606.07992},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/PratapS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GoerigkSSS16,
author = {Marc Goerigk and
Yogish Sabharwal and
Anita Sch{\"{o}}bel and
Sandeep Sen},
title = {Improvable Knapsack Problems},
journal = {CoRR},
volume = {abs/1607.08338},
year = {2016},
url = {http://arxiv.org/abs/1607.08338},
eprinttype = {arXiv},
eprint = {1607.08338},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GoerigkSSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/GoerigkGISS15,
author = {Marc Goerigk and
Manoj Gupta and
Jonas Ide and
Anita Sch{\"{o}}bel and
Sandeep Sen},
title = {The robust knapsack problem with queries},
journal = {Comput. Oper. Res.},
volume = {55},
pages = {12--22},
year = {2015},
url = {https://doi.org/10.1016/j.cor.2014.09.010},
doi = {10.1016/J.COR.2014.09.010},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/GoerigkGISS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BaswanaGS15,
author = {Surender Baswana and
Manoj Gupta and
Sandeep Sen},
title = {Fully Dynamic Maximal Matching in O(log n) Update Time},
journal = {{SIAM} J. Comput.},
volume = {44},
number = {1},
pages = {88--113},
year = {2015},
url = {https://doi.org/10.1137/130914140},
doi = {10.1137/130914140},
timestamp = {Tue, 25 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BaswanaGS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BishnuCNS15,
author = {Arijit Bishnu and
Amit Chakrabarti and
Subhas C. Nandy and
Sandeep Sen},
editor = {Prahladh Harsha and
G. Ramalingam},
title = {On Density, Threshold and Emptiness Queries for Intervals in the Streaming
Model},
booktitle = {35th {IARCS} Annual Conference on Foundation of Software Technology
and Theoretical Computer Science, {FSTTCS} 2015, December 16-18, 2015,
Bangalore, India},
series = {LIPIcs},
volume = {45},
pages = {336--349},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2015.336},
doi = {10.4230/LIPICS.FSTTCS.2015.336},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/BishnuCNS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MadanS15,
author = {Dhiraj Madan and
Sandeep Sen},
title = {Randomised Rounding with Applications},
journal = {CoRR},
volume = {abs/1507.08501},
year = {2015},
url = {http://arxiv.org/abs/1507.08501},
eprinttype = {arXiv},
eprint = {1507.08501},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MadanS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Jaiswal0S14,
author = {Ragesh Jaiswal and
Amit Kumar and
Sandeep Sen},
title = {A Simple {D} 2-Sampling Based {PTAS} for k-Means and Other Clustering
Problems},
journal = {Algorithmica},
volume = {70},
number = {1},
pages = {22--46},
year = {2014},
url = {https://doi.org/10.1007/s00453-013-9833-9},
doi = {10.1007/S00453-013-9833-9},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Jaiswal0S14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/GoerigkSSS14,
author = {Marc Goerigk and
Yogish Sabharwal and
Anita Sch{\"{o}}bel and
Sandeep Sen},
editor = {T. V. Gopal and
Manindra Agrawal and
Angsheng Li and
S. Barry Cooper},
title = {Approximation Algorithms for the Weight-Reducible Knapsack Problem},
booktitle = {Theory and Applications of Models of Computation - 11th Annual Conference,
{TAMC} 2014, Chennai, India, April 11-13, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8402},
pages = {203--215},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-06089-7\_14},
doi = {10.1007/978-3-319-06089-7\_14},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/tamc/GoerigkSSS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/SaharoyS14,
author = {Debjyoti Saharoy and
Sandeep Sen},
title = {Approximation Algorithms for Budget Constrained Network Upgradeable
Problems},
journal = {CoRR},
volume = {abs/1412.3721},
year = {2014},
url = {http://arxiv.org/abs/1412.3721},
eprinttype = {arXiv},
eprint = {1412.3721},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/SaharoyS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/NandyS12,
author = {Subhas C. Nandy and
Sandeep Sen},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {442},
pages = {1},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2012.05.019},
doi = {10.1016/J.TCS.2012.05.019},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/NandyS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/JaiswalKS12,
author = {Ragesh Jaiswal and
Amit Kumar and
Sandeep Sen},
editor = {Joachim Gudmundsson and
Juli{\'{a}}n Mestre and
Taso Viglas},
title = {A Simple {D} 2-Sampling Based {PTAS} for k-Means and other Clustering
Problems},
booktitle = {Computing and Combinatorics - 18th Annual International Conference,
{COCOON} 2012, Sydney, Australia, August 20-22, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7434},
pages = {13--24},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32241-9\_2},
doi = {10.1007/978-3-642-32241-9\_2},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/JaiswalKS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/AnandBGS12,
author = {Abhash Anand and
Surender Baswana and
Manoj Gupta and
Sandeep Sen},
editor = {Deepak D'Souza and
Telikepalli Kavitha and
Jaikumar Radhakrishnan},
title = {Maintaining Approximate Maximum Weighted Matching in Fully Dynamic
Graphs},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2012, December 15-17, 2012,
Hyderabad, India},
series = {LIPIcs},
volume = {18},
pages = {257--266},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2012.257},
doi = {10.4230/LIPICS.FSTTCS.2012.257},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/AnandBGS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/SharmaS12,
author = {Neeraj Sharma and
Sandeep Sen},
editor = {Guy E. Blelloch and
Maurice Herlihy},
title = {Brief announcement: efficient cache oblivious algorithms for randomized
divide-and-conquer on the multicore model},
booktitle = {24th {ACM} Symposium on Parallelism in Algorithms and Architectures,
{SPAA} '12, Pittsburgh, PA, USA, June 25-27, 2012},
pages = {74--76},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2312005.2312020},
doi = {10.1145/2312005.2312020},
timestamp = {Wed, 21 Nov 2018 11:16:54 +0100},
biburl = {https://dblp.org/rec/conf/spaa/SharmaS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1201-4206,
author = {Ragesh Jaiswal and
Amit Kumar and
Sandeep Sen},
title = {A simple D{\^{}}2-sampling based {PTAS} for k-means and other Clustering
Problems},
journal = {CoRR},
volume = {abs/1201.4206},
year = {2012},
url = {http://arxiv.org/abs/1201.4206},
eprinttype = {arXiv},
eprint = {1201.4206},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1201-4206.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-1090,
author = {Sandeep Sen and
V. N. Muralidhara},
title = {The covert set-cover problem with application to Network Discovery},
journal = {CoRR},
volume = {abs/1202.1090},
year = {2012},
url = {http://arxiv.org/abs/1202.1090},
eprinttype = {arXiv},
eprint = {1202.1090},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-1090.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1204-6508,
author = {Neeraj Sharma and
Sandeep Sen},
title = {Efficient cache oblivious algorithms for randomized divide-and-conquer
on the multicore model},
journal = {CoRR},
volume = {abs/1204.6508},
year = {2012},
url = {http://arxiv.org/abs/1204.6508},
eprinttype = {arXiv},
eprint = {1204.6508},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1204-6508.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-3976,
author = {Abhash Anand and
Surender Baswana and
Manoj Gupta and
Sandeep Sen},
title = {Maintaining Approximate Maximum Weighted Matching in Fully Dynamic
Graphs},
journal = {CoRR},
volume = {abs/1207.3976},
year = {2012},
url = {http://arxiv.org/abs/1207.3976},
eprinttype = {arXiv},
eprint = {1207.3976},
timestamp = {Tue, 25 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1207-3976.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BaswanaGS11,
author = {Surender Baswana and
Manoj Gupta and
Sandeep Sen},
editor = {Rafail Ostrovsky},
title = {Fully Dynamic Maximal Matching in {O} (log n) Update Time},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {383--392},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.89},
doi = {10.1109/FOCS.2011.89},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BaswanaGS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/GuptaSS11,
author = {Manoj Gupta and
Yogish Sabharwal and
Sandeep Sen},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {The update complexity of selection and related problems},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {325--338},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.325},
doi = {10.4230/LIPICS.FSTTCS.2011.325},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/GuptaSS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1103-1109,
author = {Surender Baswana and
Manoj Gupta and
Sandeep Sen},
title = {Fully dynamic maximal matching in O(log n) update time},
journal = {CoRR},
volume = {abs/1103.1109},
year = {2011},
url = {http://arxiv.org/abs/1103.1109},
eprinttype = {arXiv},
eprint = {1103.1109},
timestamp = {Tue, 25 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1103-1109.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1108-5525,
author = {Manoj Gupta and
Yogish Sabharwal and
Sandeep Sen},
title = {The update complexity of selection and related problems},
journal = {CoRR},
volume = {abs/1108.5525},
year = {2011},
url = {http://arxiv.org/abs/1108.5525},
eprinttype = {arXiv},
eprint = {1108.5525},
timestamp = {Tue, 25 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1108-5525.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KumarSS10,
author = {Amit Kumar and
Yogish Sabharwal and
Sandeep Sen},
title = {Linear-time approximation schemes for clustering problems in any dimensions},
journal = {J. {ACM}},
volume = {57},
number = {2},
pages = {5:1--5:32},
year = {2010},
url = {https://doi.org/10.1145/1667053.1667054},
doi = {10.1145/1667053.1667054},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/KumarSS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/SenM10,
author = {Sandeep Sen and
V. N. Muralidhara},
editor = {Md. Saidur Rahman and
Satoshi Fujita},
title = {The Covert Set-Cover Problem with Application to Network Discovery},
booktitle = {{WALCOM:} Algorithms and Computation, 4th International Workshop,
{WALCOM} 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5942},
pages = {228--239},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-11440-3\_21},
doi = {10.1007/978-3-642-11440-3\_21},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/walcom/SenM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MuralidharaS09,
author = {V. N. Muralidhara and
Sandeep Sen},
title = {Improvements on the Johnson bound for Reed-Solomon codes},
journal = {Discret. Appl. Math.},
volume = {157},
number = {4},
pages = {812--818},
year = {2009},
url = {https://doi.org/10.1016/j.dam.2008.06.014},
doi = {10.1016/J.DAM.2008.06.014},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/MuralidharaS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BaswanaGS09,
author = {Surender Baswana and
Vishrut Goyal and
Sandeep Sen},
title = {All-pairs nearly 2-approximate shortest paths in \emph{I} time},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {1},
pages = {84--93},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.10.018},
doi = {10.1016/J.TCS.2008.10.018},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BaswanaGS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/Sen09,
author = {Sandeep Sen},
editor = {Sandip Das and
Ryuhei Uehara},
title = {Approximating Shortest Paths in Graphs},
booktitle = {{WALCOM:} Algorithms and Computation, Third International Workshop,
{WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5431},
pages = {32--43},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00202-1\_3},
doi = {10.1007/978-3-642-00202-1\_3},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/walcom/Sen09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tc/RajasekaranS08,
author = {Sanguthevar Rajasekaran and
Sandeep Sen},
title = {Optimal and Practical Algorithms for Sorting on the {PDM}},
journal = {{IEEE} Trans. Computers},
volume = {57},
number = {4},
pages = {547--561},
year = {2008},
url = {https://doi.org/10.1109/TC.2007.70810},
doi = {10.1109/TC.2007.70810},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tc/RajasekaranS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tjs/VermaS08,
author = {Akshat Verma and
Sandeep Sen},
title = {Combating {I-O} bottleneck using prefetching: model, algorithms, and
ramifications},
journal = {J. Supercomput.},
volume = {45},
number = {2},
pages = {205--235},
year = {2008},
url = {https://doi.org/10.1007/s11227-007-0170-0},
doi = {10.1007/S11227-007-0170-0},
timestamp = {Fri, 22 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tjs/VermaS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BaswanaGSU08,
author = {Surender Baswana and
Akshay Gaur and
Sandeep Sen and
Jayant Upadhyay},
editor = {Luca Aceto and
Ivan Damg{\aa}rd and
Leslie Ann Goldberg and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Anna Ing{\'{o}}lfsd{\'{o}}ttir and
Igor Walukiewicz},
title = {Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier
with Constant Additive Error},
booktitle = {Automata, Languages and Programming, 35th International Colloquium,
{ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part
{I:} Tack {A:} Algorithms, Automata, Complexity, and Games},
series = {Lecture Notes in Computer Science},
volume = {5125},
pages = {609--621},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-70575-8\_50},
doi = {10.1007/978-3-540-70575-8\_50},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/BaswanaGSU08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/BaswanaS08,
author = {Surender Baswana and
Sandeep Sen},
editor = {Ming{-}Yang Kao},
title = {Algorithms for Spanners in Weighted Graphs},
booktitle = {Encyclopedia of Algorithms - 2008 Edition},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-0-387-30162-4\_10},
doi = {10.1007/978-0-387-30162-4\_10},
timestamp = {Thu, 27 Jun 2019 16:25:31 +0200},
biburl = {https://dblp.org/rec/reference/algo/BaswanaS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WorahS07,
author = {Pratik Worah and
Sandeep Sen},
title = {A linear time deterministic algorithm to find a small subset that
approximates the centroid},
journal = {Inf. Process. Lett.},
volume = {105},
number = {1},
pages = {17--19},
year = {2007},
url = {https://doi.org/10.1016/j.ipl.2007.07.008},
doi = {10.1016/J.IPL.2007.07.008},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WorahS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BaswanaHS07,
author = {Surender Baswana and
Ramesh Hariharan and
Sandeep Sen},
title = {Improved decremental algorithms for maintaining transitive closure
and all-pairs shortest paths},
journal = {J. Algorithms},
volume = {62},
number = {2},
pages = {74--92},
year = {2007},
url = {https://doi.org/10.1016/j.jalgor.2004.08.004},
doi = {10.1016/J.JALGOR.2004.08.004},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/BaswanaHS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BaswanaS07,
author = {Surender Baswana and
Sandeep Sen},
title = {A simple and linear time randomized algorithm for computing sparse
spanners in weighted graphs},
journal = {Random Struct. Algorithms},
volume = {30},
number = {4},
pages = {532--563},
year = {2007},
url = {https://doi.org/10.1002/rsa.20130},
doi = {10.1002/RSA.20130},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BaswanaS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/indocrypt/MuralidharaS07,
author = {V. N. Muralidhara and
Sandeep Sen},
editor = {K. Srinathan and
C. Pandu Rangan and
Moti Yung},
title = {A Result on the Distribution of Quadratic Residues with Applications
to Elliptic Curve Cryptography},
booktitle = {Progress in Cryptology - {INDOCRYPT} 2007, 8th International Conference
on Cryptology in India, Chennai, India, December 9-13, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4859},
pages = {48--57},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77026-8\_5},
doi = {10.1007/978-3-540-77026-8\_5},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/indocrypt/MuralidharaS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/SabharwalSS06,
author = {Yogish Sabharwal and
Nishant Sharma and
Sandeep Sen},
title = {Nearest neighbors search using point location in balls with applications
to approximate Voronoi decompositions},
journal = {J. Comput. Syst. Sci.},
volume = {72},
number = {6},
pages = {955--977},
year = {2006},
url = {https://doi.org/10.1016/j.jcss.2006.01.007},
doi = {10.1016/J.JCSS.2006.01.007},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/SabharwalSS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BaswanaS06,
author = {Surender Baswana and
Sandeep Sen},
title = {Approximate distance oracles for unweighted graphs in expected \emph{O}(\emph{n}\({}^{\mbox{2}}\))
time},
journal = {{ACM} Trans. Algorithms},
volume = {2},
number = {4},
pages = {557--577},
year = {2006},
url = {https://doi.org/10.1145/1198513.1198518},
doi = {10.1145/1198513.1198518},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/BaswanaS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/hipc/VermaS06,
author = {Akshat Verma and
Sandeep Sen},
editor = {Yves Robert and
Manish Parashar and
Ramamurthy Badrinath and
Viktor K. Prasanna},
title = {Algorithmic Ramifications of Prefetching in Memory Hierarchy},
booktitle = {High Performance Computing - HiPC 2006, 13th International Conference,
Bangalore, India, December 18-21, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4297},
pages = {9--21},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11945918\_8},
doi = {10.1007/11945918\_8},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/hipc/VermaS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/SabharwalS05,
author = {Yogish Sabharwal and
Sandeep Sen},
title = {A linear time algorithm for approximate 2-means clustering},
journal = {Comput. Geom.},
volume = {32},
number = {2},
pages = {159--172},
year = {2005},
url = {https://doi.org/10.1016/j.comgeo.2005.01.003},
doi = {10.1016/J.COMGEO.2005.01.003},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/SabharwalS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RajasekaranS05,
author = {Sanguthevar Rajasekaran and
Sandeep Sen},
title = {A generalization of the 0-1 principle for sorting},
journal = {Inf. Process. Lett.},
volume = {94},
number = {1},
pages = {43--47},
year = {2005},
url = {https://doi.org/10.1016/j.ipl.2004.11.013},
doi = {10.1016/J.IPL.2004.11.013},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RajasekaranS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/KumarSS05,
author = {Amit Kumar and
Yogish Sabharwal and
Sandeep Sen},
editor = {Lu{\'{\i}}s Caires and
Giuseppe F. Italiano and
Lu{\'{\i}}s Monteiro and
Catuscia Palamidessi and
Moti Yung},
title = {Linear Time Algorithms for Clustering Problems in Any Dimensions},
booktitle = {Automata, Languages and Programming, 32nd International Colloquium,
{ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3580},
pages = {1374--1385},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11523468\_111},
doi = {10.1007/11523468\_111},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/KumarSS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/RajasekaranS05,
author = {Sanguthevar Rajasekaran and
Sandeep Sen},
title = {{PDM} Sorting Algorithms That Take {A} Small Number of Passes},
booktitle = {19th International Parallel and Distributed Processing Symposium {(IPDPS}
2005), {CD-ROM} / Abstracts Proceedings, 4-8 April 2005, Denver, CO,
{USA}},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/IPDPS.2005.334},
doi = {10.1109/IPDPS.2005.334},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipps/RajasekaranS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/RajasekaranS05,
author = {Sanguthevar Rajasekaran and
Sandeep Sen},
editor = {Xiaotie Deng and
Ding{-}Zhu Du},
title = {A Simple Optimal Randomized Algorithm for Sorting on the {PDM}},
booktitle = {Algorithms and Computation, 16th International Symposium, {ISAAC}
2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3827},
pages = {543--552},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11602613\_55},
doi = {10.1007/11602613\_55},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/RajasekaranS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BaswanaGS05,
author = {Surender Baswana and
Vishrut Goyal and
Sandeep Sen},
editor = {Volker Diekert and
Bruno Durand},
title = {All-Pairs Nearly 2-Approximate Shortest-Paths in O(n\({}^{\mbox{2}}\)
polylog n) Time},
booktitle = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3404},
pages = {666--679},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/978-3-540-31856-9\_55},
doi = {10.1007/978-3-540-31856-9\_55},
timestamp = {Wed, 19 May 2021 12:05:43 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BaswanaGS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/fsttcs/2005,
editor = {Ramaswamy Ramanujam and
Sandeep Sen},
title = {{FSTTCS} 2005: Foundations of Software Technology and Theoretical
Computer Science, 25th International Conference, Hyderabad, India,
December 15-18, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3821},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11590156},
doi = {10.1007/11590156},
isbn = {3-540-30495-9},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/2005.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cn/KamraSSS04,
author = {Abhinav Kamra and
Huzur Saran and
Sandeep Sen and
Rajeev Shorey},
title = {Fair adaptive bandwidth allocation: a rate control based active queue
management discipline},
journal = {Comput. Networks},
volume = {44},
number = {2},
pages = {135--152},
year = {2004},
url = {https://doi.org/10.1016/S1389-1286(03)00347-5},
doi = {10.1016/S1389-1286(03)00347-5},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cn/KamraSSS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KumarSS04,
author = {Amit Kumar and
Yogish Sabharwal and
Sandeep Sen},
title = {A Simple Linear Time (1+{\(\acute{\epsilon}\)})-Approximation Algorithm
for k-Means Clustering in Any Dimensions},
booktitle = {45th Symposium on Foundations of Computer Science {(FOCS} 2004), 17-19
October 2004, Rome, Italy, Proceedings},
pages = {454--462},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/FOCS.2004.7},
doi = {10.1109/FOCS.2004.7},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KumarSS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BaswanaS04,
author = {Surender Baswana and
Sandeep Sen},
editor = {J. Ian Munro},
title = {Approximate distance oracles for unweighted graphs in {\~{O}}(n\({}^{\mbox{2}}\))
time},
booktitle = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14,
2004},
pages = {271--280},
publisher = {{SIAM}},
year = {2004},
url = {http://dl.acm.org/citation.cfm?id=982792.982830},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/BaswanaS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/crc/BaswanaS04,
author = {Surender Baswana and
Sandeep Sen},
editor = {Dinesh P. Mehta and
Sartaj Sahni},
title = {Randomized Graph Data-Structures for Approximate Shortest Paths},
booktitle = {Handbook of Data Structures and Applications},
publisher = {Chapman and Hall/CRC},
year = {2004},
url = {https://doi.org/10.1201/9781420035179.ch38},
doi = {10.1201/9781420035179.CH38},
timestamp = {Thu, 19 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/reference/crc/BaswanaS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jpdc/GuptaS03a,
author = {Neelima Gupta and
Sandeep Sen},
title = {Faster output-sensitive parallel algorithms for 3D convex hulls and
vector maxima},
journal = {J. Parallel Distributed Comput.},
volume = {63},
number = {4},
pages = {488--500},
year = {2003},
url = {https://doi.org/10.1016/S0743-7315(03)00035-2},
doi = {10.1016/S0743-7315(03)00035-2},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jpdc/GuptaS03a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BaswanaS03,
author = {Surender Baswana and
Sandeep Sen},
editor = {Jos C. M. Baeten and
Jan Karel Lenstra and
Joachim Parrow and
Gerhard J. Woeginger},
title = {A Simple Linear Time Algorithm for Computing a (2k-1)-Spanner of O(n\({}^{\mbox{1+1/k}}\))
Size in Weighted Graphs},
booktitle = {Automata, Languages and Programming, 30th International Colloquium,
{ICALP} 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2719},
pages = {384--296},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-45061-0\_32},
doi = {10.1007/3-540-45061-0\_32},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BaswanaS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BaswanaHS03,
author = {Surender Baswana and
Ramesh Hariharan and
Sandeep Sen},
title = {Maintaining all-pairs approximate shortest paths under deletion of
edges},
booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}},
pages = {394--403},
publisher = {{ACM/SIAM}},
year = {2003},
url = {http://dl.acm.org/citation.cfm?id=644108.644171},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/BaswanaHS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AgarwalBS02,
author = {Pankaj K. Agarwal and
Binay K. Bhattacharya and
Sandeep Sen},
title = {Improved Algorithms for Uniform Partitions of Points},
journal = {Algorithmica},
volume = {32},
number = {4},
pages = {521--539},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0084-9},
doi = {10.1007/S00453-001-0084-9},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AgarwalBS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BaswanaS02,
author = {Surender Baswana and
Sandeep Sen},
title = {Planar Graph Blocking for External Searching},
journal = {Algorithmica},
volume = {34},
number = {3},
pages = {298--308},
year = {2002},
url = {https://doi.org/10.1007/s00453-002-0969-2},
doi = {10.1007/S00453-002-0969-2},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BaswanaS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SenCD02,
author = {Sandeep Sen and
Siddhartha Chatterjee and
Neeraj Dumir},
title = {Towards a theory of cache-efficient algorithms},
journal = {J. {ACM}},
volume = {49},
number = {6},
pages = {828--858},
year = {2002},
url = {https://doi.org/10.1145/602220.602225},
doi = {10.1145/602220.602225},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/SenCD02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/SabharwalSS02,
author = {Yogish Sabharwal and
Nishant Sharma and
Sandeep Sen},
editor = {Manindra Agrawal and
Anil Seth},
title = {Nearest Neighbors Search Using Point Location in Balls with Applications
to Approximate Voronoi Decompositions},
booktitle = {{FST} {TCS} 2002: Foundations of Software Technology and Theoretical
Computer Science, 22nd Conference Kanpur, India, December 12-14, 2002,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2556},
pages = {311--323},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-36206-1\_28},
doi = {10.1007/3-540-36206-1\_28},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/SabharwalSS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/networking/KamraSSS02,
author = {Abhinav Kamra and
Huzur Saran and
Sandeep Sen and
Rajeev Shorey},
editor = {Enrico Gregori and
Marco Conti and
Andrew T. Campbell and
Cambyse Guy Omidyar and
Moshe Zukerman},
title = {Fair Adaptive Bandwidth Allocation: {A} Rate Control Based Active
Queue Management Discipline},
booktitle = {{NETWORKING} 2002, Networking Technologies, Services, and Protocols;
Performance of Computer and Communication Networks; and Mobile and
Wireless Communications, Second International {IFIP-TC6} Networking
Conference, Pisa, Italy, May 19-24, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2345},
pages = {838--849},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-47906-6\_68},
doi = {10.1007/3-540-47906-6\_68},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/networking/KamraSSS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BaswanaHS02,
author = {Surender Baswana and
Ramesh Hariharan and
Sandeep Sen},
editor = {John H. Reif},
title = {Improved decremental algorithms for maintaining transitive closure
and all-pairs shortest paths},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {117--123},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509928},
doi = {10.1145/509907.509928},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BaswanaHS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GuptaS01,
author = {Neelima Gupta and
Sandeep Sen},
title = {An Efficient Output-Size Sensitive Parallel Algorithm for Hidden-Surface
Removal for Terrains},
journal = {Algorithmica},
volume = {31},
number = {2},
pages = {179--207},
year = {2001},
url = {https://doi.org/10.1007/s00453-001-0042-6},
doi = {10.1007/S00453-001-0042-6},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GuptaS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/GuptaCS01,
author = {Neelima Gupta and
Sumit Chopra and
Sandeep Sen},
editor = {Ramesh Hariharan and
Madhavan Mukund and
V. Vinay},
title = {Optimal, Output-Sensitive Algorithms for Constructing Upper Envelope
of Line Segments in Parallel},
booktitle = {{FST} {TCS} 2001: Foundations of Software Technology and Theoretical
Computer Science, 21st Conference, Bangalore, India, December 13-15,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2245},
pages = {183--194},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45294-X\_16},
doi = {10.1007/3-540-45294-X\_16},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/GuptaCS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DyerS00,
author = {Martin E. Dyer and
Sandeep Sen},
title = {Fast and Optimal Parallel Multidimensional Search in PRAMs with Applications
to Linear Programming and Related Problems},
journal = {{SIAM} J. Comput.},
volume = {30},
number = {5},
pages = {1443--1461},
year = {2000},
url = {https://doi.org/10.1137/S0097539797325727},
doi = {10.1137/S0097539797325727},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/DyerS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BaswanaS00,
author = {Surender Baswana and
Sandeep Sen},
editor = {Sanjiv Kapoor and
Sanjiva Prasad},
title = {Planar Graph Blocking for External Searching},
booktitle = {Foundations of Software Technology and Theoretical Computer Science,
20th Conference, {FST} {TCS} 2000 New Delhi, India, December 13-15,
2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1974},
pages = {252--263},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44450-5\_20},
doi = {10.1007/3-540-44450-5\_20},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/BaswanaS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/hpca/ChatterjeeS00,
author = {Siddhartha Chatterjee and
Sandeep Sen},
title = {Cache-Efficient Matrix Transposition},
booktitle = {Proceedings of the Sixth International Symposium on High-Performance
Computer Architecture, Toulouse, France, January 8-12, 2000},
pages = {195--205},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/HPCA.2000.824350},
doi = {10.1109/HPCA.2000.824350},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/hpca/ChatterjeeS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/SenC00,
author = {Sandeep Sen and
Siddhartha Chatterjee},
editor = {David B. Shmoys},
title = {Towards a theory of cache-efficient algorithms},
booktitle = {Proceedings of the Eleventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 9-11, 2000, San Francisco, CA, {USA}},
pages = {829--838},
publisher = {{ACM/SIAM}},
year = {2000},
url = {http://dl.acm.org/citation.cfm?id=338219.338646},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/SenC00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/el/00/ReifS00,
author = {John H. Reif and
Sandeep Sen},
editor = {J{\"{o}}rg{-}R{\"{u}}diger Sack and
Jorge Urrutia},
title = {Parallel Computational Geometry: An Approach using Randomization},
booktitle = {Handbook of Computational Geometry},
pages = {765--828},
publisher = {North Holland / Elsevier},
year = {2000},
url = {https://doi.org/10.1016/b978-044482537-7/50019-x},
doi = {10.1016/B978-044482537-7/50019-X},
timestamp = {Fri, 28 Jun 2019 09:10:30 +0200},
biburl = {https://dblp.org/rec/books/el/00/ReifS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-AR-0010007,
author = {Sandeep Sen and
Siddhartha Chatterjee and
Neeraj Dumir},
title = {Towards a Theory of Cache-Efficient Algorithms},
journal = {CoRR},
volume = {cs.AR/0010007},
year = {2000},
url = {https://arxiv.org/abs/cs/0010007},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-AR-0010007.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/SenG99,
author = {Sandeep Sen and
Neelima Gupta},
title = {Distribution-Sensitive Algorithms},
journal = {Nord. J. Comput.},
volume = {6},
number = {2},
pages = {194},
year = {1999},
timestamp = {Wed, 14 Jan 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/njc/SenG99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/AgarwalBS99,
author = {Pankaj K. Agarwal and
Binay K. Bhattacharya and
Sandeep Sen},
editor = {Alok Aggarwal and
C. Pandu Rangan},
title = {Output-Sensitive Algorithms for Uniform Partitions of Points},
booktitle = {Algorithms and Computation, 10th International Symposium, {ISAAC}
'99, Chennai, India, December 16-18, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1741},
pages = {403--414},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-46632-0\_41},
doi = {10.1007/3-540-46632-0\_41},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/AgarwalBS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/GuptaS98,
author = {Neelima Gupta and
Sandeep Sen},
title = {An Improved Output-Size Sensitive Parallel Algorithm for Hidden-Surface
Removal for Terrains},
booktitle = {12th International Parallel Processing Symposium / 9th Symposium on
Parallel and Distributed Processing {(IPPS/SPDP} '98), March 30 -
April 3, 1998, Orlando, Florida, USA, Proceedings},
pages = {215--219},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/IPPS.1998.669913},
doi = {10.1109/IPPS.1998.669913},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipps/GuptaS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/SenG98,
author = {Sandeep Sen and
Neelima Gupta},
editor = {Stefan Arnborg and
Lars Ivansson},
title = {Distribution-Sensitive Algorithms},
booktitle = {Algorithm Theory - {SWAT} '98, 6th Scandinavian Workshop on Algorithm
Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1432},
pages = {335--346},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054380},
doi = {10.1007/BFB0054380},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/SenG98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AggarwalKPS97,
author = {Alok Aggarwal and
Dina Kravets and
James K. Park and
Sandeep Sen},
title = {Parallel Searching in Generalized Monge Arrays},
journal = {Algorithmica},
volume = {19},
number = {3},
pages = {291--317},
year = {1997},
url = {https://doi.org/10.1007/PL00009175},
doi = {10.1007/PL00009175},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AggarwalKPS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/GuptaS97,
author = {Neelima Gupta and
Sandeep Sen},
title = {Optimal, Output-sensitive Algorithms for Constructing Planar Hulls
in Parallel},
journal = {Comput. Geom.},
volume = {8},
pages = {151--166},
year = {1997},
url = {https://doi.org/10.1016/S0925-7721(97)00009-6},
doi = {10.1016/S0925-7721(97)00009-6},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/GuptaS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BhattacharyaS97,
author = {Binay K. Bhattacharya and
Sandeep Sen},
title = {On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar
Convex Hull Algorithm},
journal = {J. Algorithms},
volume = {25},
number = {1},
pages = {177--193},
year = {1997},
url = {https://doi.org/10.1006/jagm.1997.0869},
doi = {10.1006/JAGM.1997.0869},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/BhattacharyaS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Sen97,
author = {Sandeep Sen},
title = {Lower Bounds for Parallel Algebraic Decision Trees, Parallel Complexity
of Convex Hulls and Related Problems},
journal = {Theor. Comput. Sci.},
volume = {188},
number = {1-2},
pages = {59--78},
year = {1997},
url = {https://doi.org/10.1016/S0304-3975(96)00212-5},
doi = {10.1016/S0304-3975(96)00212-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Sen97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/AgarwalS96,
author = {Pankaj K. Agarwal and
Sandeep Sen},
title = {Selection in Monotone Matrices and Computing \emph{k}th Nearest Neighbors},
journal = {J. Algorithms},
volume = {20},
number = {3},
pages = {581--601},
year = {1996},
url = {https://doi.org/10.1006/jagm.1996.0028},
doi = {10.1006/JAGM.1996.0028},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/AgarwalS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/GuptaS96,
author = {Neelima Gupta and
Sandeep Sen},
editor = {Sue Whitesides},
title = {Faster Output-Sensitive Parallel Convex Hulls for \emph{d}{\textless}=3:
Optimal Sublogarithmic Algorithms for Small Outputs},
booktitle = {Proceedings of the Twelfth Annual Symposium on Computational Geometry,
Philadelphia, PA, USA, May 24-26, 1996},
pages = {176--185},
publisher = {{ACM}},
year = {1996},
url = {https://doi.org/10.1145/237218.237351},
doi = {10.1145/237218.237351},
timestamp = {Mon, 14 Jun 2021 16:25:18 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/GuptaS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/Sen96,
author = {Sandeep Sen},
editor = {Guy E. Blelloch},
title = {Parallel Multidimensional Search Using Approximation Algorithms: With
Applications to Linear-Programming and Related Problems},
booktitle = {Proceedings of the 8th Annual {ACM} Symposium on Parallel Algorithms
and Architectures, {SPAA} '96, Padua, Italy, June 24-26, 1996},
pages = {251--260},
publisher = {{ACM}},
year = {1996},
url = {https://doi.org/10.1145/237502.237564},
doi = {10.1145/237502.237564},
timestamp = {Wed, 21 Nov 2018 12:27:44 +0100},
biburl = {https://dblp.org/rec/conf/spaa/Sen96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Sen95,
author = {Sandeep Sen},
title = {Fractional Cascading Revisited},
journal = {J. Algorithms},
volume = {19},
number = {2},
pages = {161--172},
year = {1995},
url = {https://doi.org/10.1006/jagm.1995.1032},
doi = {10.1006/JAGM.1995.1032},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Sen95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ReifS94,
author = {John H. Reif and
Sandeep Sen},
title = {Erratum: Optimal Parallel Randomized Algorithms for Three-Dimensional
Convex Hulls and Related Problems},
journal = {{SIAM} J. Comput.},
volume = {23},
number = {2},
pages = {447--448},
year = {1994},
url = {https://doi.org/10.1137/0223030},
doi = {10.1137/0223030},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ReifS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ReifS94a,
author = {John H. Reif and
Sandeep Sen},
title = {Randomized Algorithms for Binary Search and Load Balancing on Fixed
Connection Networks with Geometric Applications},
journal = {{SIAM} J. Comput.},
volume = {23},
number = {3},
pages = {633--651},
year = {1994},
url = {https://doi.org/10.1137/S0097539790184298},
doi = {10.1137/S0097539790184298},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ReifS94a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Sen94,
author = {Sandeep Sen},
editor = {P. S. Thiagarajan},
title = {Lower Bounds for Parallel Algebraic Decision Trees, Complexity of
Convex Hulls and Related Problems},
booktitle = {Foundations of Software Technology and Theoretical Computer Science,
14th Conference, Madras, India, December 15-17, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {880},
pages = {193--204},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58715-2\_125},
doi = {10.1007/3-540-58715-2\_125},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/Sen94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AgarwalS94,
author = {Pankaj K. Agarwal and
Sandeep Sen},
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {Selection in Monotone Matrices and Computing k\({}^{\mbox{th}}\) Nearest
Neighbors},
booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
pages = {13--24},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5\_2},
doi = {10.1007/3-540-58218-5\_2},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/AgarwalS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/MansourPSS93,
author = {Yishay Mansour and
James K. Park and
Baruch Schieber and
Sandeep Sen},
title = {Improved selection in totally monotone arrays},
journal = {Int. J. Comput. Geom. Appl.},
volume = {3},
number = {2},
pages = {115--132},
year = {1993},
url = {https://doi.org/10.1142/S0218195993000087},
doi = {10.1142/S0218195993000087},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/MansourPSS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/RajasekaranS92,
author = {Sanguthevar Rajasekaran and
Sandeep Sen},
title = {On Parallel Integer Sorting},
journal = {Acta Informatica},
volume = {29},
number = {1},
pages = {1--15},
year = {1992},
url = {https://doi.org/10.1007/BF01178563},
doi = {10.1007/BF01178563},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/RajasekaranS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ReifS92,
author = {John H. Reif and
Sandeep Sen},
title = {Optimal Randomized Parallel Algorithms for Computational Geometry},
journal = {Algorithmica},
volume = {7},
number = {1},
pages = {91--117},
year = {1992},
url = {https://doi.org/10.1007/BF01758753},
doi = {10.1007/BF01758753},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ReifS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/MulmuleyS92,
author = {Ketan Mulmuley and
Sandeep Sen},
title = {Dynamic Point Location in Arrangement of Hyperplanes},
journal = {Discret. Comput. Geom.},
volume = {8},
pages = {335--360},
year = {1992},
url = {https://doi.org/10.1007/BF02293052},
doi = {10.1007/BF02293052},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/MulmuleyS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ReifS92,
author = {John H. Reif and
Sandeep Sen},
title = {Optimal Parallel Randomized Algorithms for Three-Dimensional Convex
Hulls and Related Problems},
journal = {{SIAM} J. Comput.},
volume = {21},
number = {3},
pages = {466--485},
year = {1992},
url = {https://doi.org/10.1137/0221031},
doi = {10.1137/0221031},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ReifS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Sen92,
author = {Sandeep Sen},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Fractional Cascading Simplified},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {212--220},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_18},
doi = {10.1007/3-540-55706-7\_18},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/Sen92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Sen91,
author = {Sandeep Sen},
title = {Some Observations on Skip-Lists},
journal = {Inf. Process. Lett.},
volume = {39},
number = {4},
pages = {173--176},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90175-H},
doi = {10.1016/0020-0190(91)90175-H},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Sen91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/MulmuleyS91,
author = {Ketan Mulmuley and
Sandeep Sen},
editor = {Robert L. Scot Drysdale},
title = {Dynamic Point Location in Arrangements of Hyperplanes},
booktitle = {Proceedings of the Seventh Annual Symposium on Computational Geometry,
North Conway, NH, USA, , June 10-12, 1991},
pages = {132--141},
publisher = {{ACM}},
year = {1991},
url = {https://doi.org/10.1145/109648.109663},
doi = {10.1145/109648.109663},
timestamp = {Mon, 14 Jun 2021 16:25:13 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/MulmuleyS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Sen90,
author = {Sandeep Sen},
title = {Finding an Approximate Median with High Probability in Constant Parallel
Time},
journal = {Inf. Process. Lett.},
volume = {34},
number = {2},
pages = {77--80},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90140-S},
doi = {10.1016/0020-0190(90)90140-S},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Sen90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/AggarwalKPS90,
author = {Alok Aggarwal and
Dina Kravets and
James K. Park and
Sandeep Sen},
editor = {Frank Thomson Leighton},
title = {Parallel Searching in Generalized Monge Arrays with Applications},
booktitle = {Proceedings of the 2nd Annual {ACM} Symposium on Parallel Algorithms
and Architectures, {SPAA} '90, Island of Crete, Greece, July 2-6,
1990},
pages = {259--268},
publisher = {{ACM}},
year = {1990},
url = {https://doi.org/10.1145/97444.97693},
doi = {10.1145/97444.97693},
timestamp = {Wed, 21 Nov 2018 12:27:44 +0100},
biburl = {https://dblp.org/rec/conf/spaa/AggarwalKPS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/ReifS90,
author = {John H. Reif and
Sandeep Sen},
editor = {Frank Thomson Leighton},
title = {Randomized Algorithms for Binary Search and Load Balancing with Geometric
Applications},
booktitle = {Proceedings of the 2nd Annual {ACM} Symposium on Parallel Algorithms
and Architectures, {SPAA} '90, Island of Crete, Greece, July 2-6,
1990},
pages = {327--339},
publisher = {{ACM}},
year = {1990},
url = {https://doi.org/10.1145/97444.97700},
doi = {10.1145/97444.97700},
timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/spaa/ReifS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jpdc/SchersonSM89,
author = {Isaac D. Scherson and
Sandeep Sen and
Yiming Ma},
title = {Two Nearly Optimal Sorting Algorithms for Mesh-Connected Processor
Arrays Using Shear-Sort},
journal = {J. Parallel Distributed Comput.},
volume = {6},
number = {1},
pages = {151--165},
year = {1989},
url = {https://doi.org/10.1016/0743-7315(89)90047-6},
doi = {10.1016/0743-7315(89)90047-6},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jpdc/SchersonSM89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tc/SchersonS89,
author = {Isaac D. Scherson and
Sandeep Sen},
title = {Parallel Sorting in Two-Dimensional {VLSI} Models of Computation},
journal = {{IEEE} Trans. Computers},
volume = {38},
number = {2},
pages = {238--249},
year = {1989},
url = {https://doi.org/10.1109/12.16500},
doi = {10.1109/12.16500},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tc/SchersonS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ifip/ReifS89,
author = {John H. Reif and
Sandeep Sen},
editor = {Gerhard X. Ritter},
title = {Randomized Parallel Algorithms},
booktitle = {Information Processing 89, Proceedings of the {IFIP} 11th World Computer
Congress, San Francisco, USA, August 28 - September 1, 1989},
pages = {455--458},
publisher = {North-Holland/IFIP},
year = {1989},
timestamp = {Wed, 02 Feb 2022 21:17:54 +0100},
biburl = {https://dblp.org/rec/conf/ifip/ReifS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/oa/ReifS89,
author = {John H. Reif and
Sandeep Sen},
editor = {Hristo N. Djidjev},
title = {Randomization in Parallel Algorithms and its Impact on Computational
Geometry},
booktitle = {Optimal Algorithms, International Symposium, Varna, Bulgaria, May
29 - June 2, 1989, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {401},
pages = {1--8},
publisher = {Springer},
year = {1989},
url = {https://doi.org/10.1007/3-540-51859-2\_1},
doi = {10.1007/3-540-51859-2\_1},
timestamp = {Wed, 14 Jul 2021 17:16:13 +0200},
biburl = {https://dblp.org/rec/conf/oa/ReifS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ReifS89,
author = {John H. Reif and
Sandeep Sen},
editor = {David S. Johnson},
title = {Polling: {A} New Randomized Sampling Technique for Computational Geometry},
booktitle = {Proceedings of the 21st Annual {ACM} Symposium on Theory of Computing,
May 14-17, 1989, Seattle, Washington, {USA}},
pages = {394--404},
publisher = {{ACM}},
year = {1989},
url = {https://doi.org/10.1145/73007.73045},
doi = {10.1145/73007.73045},
timestamp = {Wed, 24 Nov 2021 12:15:31 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ReifS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/ReifS89,
author = {John H. Reif and
Sandeep Sen},
editor = {Herbert Edelsbrunner},
title = {An Efficient Output-Sensitive Hidden Surface Removal Algorithm and
Its Parallelization},
booktitle = {Proceedings of the Fourth Annual Symposium on Computational Geometry,
Urbana-Champaign, IL, USA, June 6-8, 1988},
pages = {193--200},
publisher = {{ACM}},
year = {1988},
url = {https://doi.org/10.1145/73393.73413},
doi = {10.1145/73393.73413},
timestamp = {Mon, 14 Jun 2021 16:25:17 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/ReifS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icpp/ReifS87,
author = {John H. Reif and
Sandeep Sen},
title = {Optimal Randomized Parallel Algorithms for Computational Geometry},
booktitle = {International Conference on Parallel Processing, ICPP'87, University
Park, PA, USA, August 1987},
pages = {270--277},
publisher = {Pennsylvania State University Press},
year = {1987},
timestamp = {Mon, 28 Jul 2014 17:06:01 +0200},
biburl = {https://dblp.org/rec/conf/icpp/ReifS87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MaSS86,
author = {Yiming Ma and
Sandeep Sen and
Isaac D. Scherson},
title = {The Distance Bound for Sorting on Mesh-Connected Processor Arrays
Is Tight (Preliminary Report)},
booktitle = {27th Annual Symposium on Foundations of Computer Science, Toronto,
Canada, 27-29 October 1986},
pages = {255--263},
publisher = {{IEEE} Computer Society},
year = {1986},
url = {https://doi.org/10.1109/SFCS.1986.54},
doi = {10.1109/SFCS.1986.54},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/MaSS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icpp/SenSS86,
author = {Sandeep Sen and
Isaac D. Scherson and
Adi Shamir},
title = {Shear Sort: {A} True Two-Dimensional Sorting Techniques for {VLSI}
Networks},
booktitle = {International Conference on Parallel Processing, ICPP'86, University
Park, PA, USA, August 1986},
pages = {903--908},
publisher = {{IEEE} Computer Society Press},
year = {1986},
timestamp = {Mon, 28 Jul 2014 17:06:02 +0200},
biburl = {https://dblp.org/rec/conf/icpp/SenSS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-21 17:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
