default search action
BibTeX records: Satish Rao
@inproceedings{DBLP:conf/soda/HenzingerLRW24, author = {Monika Henzinger and Jason Li and Satish Rao and Di Wang}, editor = {David P. Woodruff}, title = {Deterministic Near-Linear Time Minimum Cut in Weighted Graphs}, booktitle = {Proceedings of the 2024 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2024, Alexandria, VA, USA, January 7-10, 2024}, pages = {3089--3139}, publisher = {{SIAM}}, year = {2024}, url = {https://doi.org/10.1137/1.9781611977912.111}, doi = {10.1137/1.9781611977912.111}, timestamp = {Thu, 04 Apr 2024 19:38:10 +0200}, biburl = {https://dblp.org/rec/conf/soda/HenzingerLRW24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2401-05627, author = {Monika Henzinger and Jason Li and Satish Rao and Di Wang}, title = {Deterministic Near-Linear Time Minimum Cut in Weighted Graphs}, journal = {CoRR}, volume = {abs/2401.05627}, year = {2024}, url = {https://doi.org/10.48550/arXiv.2401.05627}, doi = {10.48550/ARXIV.2401.05627}, eprinttype = {arXiv}, eprint = {2401.05627}, timestamp = {Wed, 24 Jul 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2401-05627.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2407-04976, author = {Jason Li and Satish Rao and Di Wang}, title = {Congestion-Approximators from the Bottom Up}, journal = {CoRR}, volume = {abs/2407.04976}, year = {2024}, url = {https://doi.org/10.48550/arXiv.2407.04976}, doi = {10.48550/ARXIV.2407.04976}, eprinttype = {arXiv}, eprint = {2407.04976}, timestamp = {Mon, 12 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2407-04976.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcbb/LeSMZRW21, author = {Thien Le and Aaron Sy and Erin K. Molloy and Qiuyi Zhang and Satish Rao and Tandy J. Warnow}, title = {Using Constrained-INC for Large-Scale Gene Tree and Species Tree Estimation}, journal = {{IEEE} {ACM} Trans. Comput. Biol. Bioinform.}, volume = {18}, number = {1}, pages = {2--15}, year = {2021}, url = {https://doi.org/10.1109/TCBB.2020.2990867}, doi = {10.1109/TCBB.2020.2990867}, timestamp = {Thu, 27 Jul 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcbb/LeSMZRW21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/HenzingerRW20, author = {Monika Henzinger and Satish Rao and Di Wang}, title = {Local Flow Partitioning for Faster Edge Connectivity}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {1}, pages = {1--36}, year = {2020}, url = {https://doi.org/10.1137/18M1180335}, doi = {10.1137/18M1180335}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/HenzingerRW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/almob/ZhangRW19, author = {Qiuyi Zhang and Satish Rao and Tandy J. Warnow}, title = {Constrained incremental tree building: new absolute fast converging phylogeny estimation methods with improved scalability and accuracy}, journal = {Algorithms Mol. Biol.}, volume = {14}, number = {1}, pages = {2:1--2:12}, year = {2019}, url = {https://doi.org/10.1186/s13015-019-0136-9}, doi = {10.1186/S13015-019-0136-9}, timestamp = {Fri, 29 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/almob/ZhangRW19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alcob/LeSMZRW19, author = {Thien Le and Aaron Sy and Erin K. Molloy and Qiuyi (Richard) Zhang and Satish Rao and Tandy J. Warnow}, editor = {Ian H. Holmes and Carlos Mart{\'{\i}}n{-}Vide and Miguel A. Vega{-}Rodr{\'{\i}}guez}, title = {Using {INC} Within Divide-and-Conquer Phylogeny Estimation}, booktitle = {Algorithms for Computational Biology - 6th International Conference, AlCoB 2019, Berkeley, CA, USA, May 28-30, 2019, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11488}, pages = {167--178}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-18174-1\_12}, doi = {10.1007/978-3-030-18174-1\_12}, timestamp = {Tue, 09 Nov 2021 09:18:33 +0100}, biburl = {https://dblp.org/rec/conf/alcob/LeSMZRW19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/SchildRS18, author = {Aaron Schild and Satish Rao and Nikhil Srivastava}, editor = {Artur Czumaj}, title = {Localization of Electrical Flows}, booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018}, pages = {1577--1584}, publisher = {{SIAM}}, year = {2018}, url = {https://doi.org/10.1137/1.9781611975031.103}, doi = {10.1137/1.9781611975031.103}, timestamp = {Tue, 02 Feb 2021 17:07:58 +0100}, biburl = {https://dblp.org/rec/conf/soda/SchildRS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wabi/ZhangRW18, author = {Qiuyi (Richard) Zhang and Satish Rao and Tandy J. Warnow}, editor = {Laxmi Parida and Esko Ukkonen}, title = {New Absolute Fast Converging Phylogeny Estimation Methods with Improved Scalability and Accuracy}, booktitle = {18th International Workshop on Algorithms in Bioinformatics, {WABI} 2018, August 20-22, 2018, Helsinki, Finland}, series = {LIPIcs}, volume = {113}, pages = {8:1--8:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.WABI.2018.8}, doi = {10.4230/LIPICS.WABI.2018.8}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/wabi/ZhangRW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icml/WangFHMR17, author = {Di Wang and Kimon Fountoulakis and Monika Henzinger and Michael W. Mahoney and Satish Rao}, editor = {Doina Precup and Yee Whye Teh}, title = {Capacity Releasing Diffusion for Speed and Locality}, booktitle = {Proceedings of the 34th International Conference on Machine Learning, {ICML} 2017, Sydney, NSW, Australia, 6-11 August 2017}, series = {Proceedings of Machine Learning Research}, volume = {70}, pages = {3598--3607}, publisher = {{PMLR}}, year = {2017}, url = {http://proceedings.mlr.press/v70/wang17b.html}, timestamp = {Wed, 29 May 2019 08:41:45 +0200}, biburl = {https://dblp.org/rec/conf/icml/WangFHMR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/HenzingerRW17, author = {Monika Henzinger and Satish Rao and Di Wang}, editor = {Philip N. Klein}, title = {Local Flow Partitioning for Faster Edge Connectivity}, booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19}, pages = {1919--1938}, publisher = {{SIAM}}, year = {2017}, url = {https://doi.org/10.1137/1.9781611974782.125}, doi = {10.1137/1.9781611974782.125}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/HenzingerRW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/RaghavendraRS17, author = {Prasad Raghavendra and Satish Rao and Tselil Schramm}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Strongly refuting random CSPs below the spectral threshold}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {121--131}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055417}, doi = {10.1145/3055399.3055417}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/RaghavendraRS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/HenzingerRW17, author = {Monika Henzinger and Satish Rao and Di Wang}, title = {Local Flow Partitioning for Faster Edge Connectivity}, journal = {CoRR}, volume = {abs/1704.01254}, year = {2017}, url = {http://arxiv.org/abs/1704.01254}, eprinttype = {arXiv}, eprint = {1704.01254}, timestamp = {Wed, 05 Sep 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/HenzingerRW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/WangFHMR17, author = {Di Wang and Kimon Fountoulakis and Monika Henzinger and Michael W. Mahoney and Satish Rao}, title = {Capacity Releasing Diffusion for Speed and Locality}, journal = {CoRR}, volume = {abs/1706.05826}, year = {2017}, url = {http://arxiv.org/abs/1706.05826}, eprinttype = {arXiv}, eprint = {1706.05826}, timestamp = {Wed, 05 Sep 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/WangFHMR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1708-01632, author = {Aaron Schild and Satish Rao and Nikhil Srivastava}, title = {Localization of Electrical Flows}, journal = {CoRR}, volume = {abs/1708.01632}, year = {2017}, url = {http://arxiv.org/abs/1708.01632}, eprinttype = {arXiv}, eprint = {1708.01632}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1708-01632.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/bmcbi/LamHCR16, author = {Ka{-}Kit Lam and Richard Hall and Alicia Clum and Satish Rao}, title = {{BIGMAC} : breaking inaccurate genomes and merging assembled contigs for long read metagenomic assembly}, journal = {{BMC} Bioinform.}, volume = {17}, pages = {435}, year = {2016}, url = {https://doi.org/10.1186/s12859-016-1288-y}, doi = {10.1186/S12859-016-1288-Y}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/bmcbi/LamHCR16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/WangRM16, author = {Di Wang and Satish Rao and Michael W. Mahoney}, editor = {Ioannis Chatzigiannakis and Michael Mitzenmacher and Yuval Rabani and Davide Sangiorgi}, title = {Unified Acceleration Method for Packing and Covering Problems via Diameter Reduction}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming, {ICALP} 2016, July 11-15, 2016, Rome, Italy}, series = {LIPIcs}, volume = {55}, pages = {50:1--50:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2016.50}, doi = {10.4230/LIPICS.ICALP.2016.50}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/icalp/WangRM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/MahoneyRWZ16, author = {Michael W. Mahoney and Satish Rao and Di Wang and Peng Zhang}, editor = {Ioannis Chatzigiannakis and Michael Mitzenmacher and Yuval Rabani and Davide Sangiorgi}, title = {Approximating the Solution to Mixed Packing and Covering LPs in Parallel O{\texttildelow}(epsilon{\^{}}\{-3\}) Time}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming, {ICALP} 2016, July 11-15, 2016, Rome, Italy}, series = {LIPIcs}, volume = {55}, pages = {52:1--52:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2016.52}, doi = {10.4230/LIPICS.ICALP.2016.52}, timestamp = {Mon, 28 Mar 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/MahoneyRWZ16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:reference/algo/FakcharoenpholRT16, author = {Jittat Fakcharoenphol and Satish Rao and Kunal Talwar}, title = {Approximating Metric Spaces by Tree Metrics}, booktitle = {Encyclopedia of Algorithms}, pages = {113--116}, year = {2016}, url = {https://doi.org/10.1007/978-1-4939-2864-4\_25}, doi = {10.1007/978-1-4939-2864-4\_25}, timestamp = {Wed, 12 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/reference/algo/FakcharoenpholRT16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:reference/algo/FakcharoenpholR16, author = {Jittat Fakcharoenphol and Satish Rao}, title = {Shortest Paths in Planar Graphs with Negative Weight Edges}, booktitle = {Encyclopedia of Algorithms}, pages = {1971--1974}, year = {2016}, url = {https://doi.org/10.1007/978-1-4939-2864-4\_372}, doi = {10.1007/978-1-4939-2864-4\_372}, timestamp = {Wed, 12 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/reference/algo/FakcharoenpholR16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/RaghavendraRS16, author = {Prasad Raghavendra and Satish Rao and Tselil Schramm}, title = {Strongly Refuting Random CSPs Below the Spectral Threshold}, journal = {CoRR}, volume = {abs/1605.00058}, year = {2016}, url = {http://arxiv.org/abs/1605.00058}, eprinttype = {arXiv}, eprint = {1605.00058}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/RaghavendraRS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/WangRM15, author = {Di Wang and Satish Rao and Michael W. Mahoney}, title = {Unified Acceleration Method for Packing and Covering Problems via Diameter Reduction}, journal = {CoRR}, volume = {abs/1508.02439}, year = {2015}, url = {http://arxiv.org/abs/1508.02439}, eprinttype = {arXiv}, eprint = {1508.02439}, timestamp = {Wed, 05 Sep 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/WangRM15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/WangMMR15, author = {Di Wang and Michael W. Mahoney and Nishanth Mohan and Satish Rao}, title = {Faster Parallel Solver for Positive Linear Programs via Dynamically-Bucketed Selective Coordinate Descent}, journal = {CoRR}, volume = {abs/1511.06468}, year = {2015}, url = {http://arxiv.org/abs/1511.06468}, eprinttype = {arXiv}, eprint = {1511.06468}, timestamp = {Wed, 05 Sep 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/WangMMR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/MihaescuHR13, author = {Radu Mihaescu and Cameron Hill and Satish Rao}, title = {Fast Phylogeny Reconstruction Through Learning of Ancestral Sequences}, journal = {Algorithmica}, volume = {66}, number = {2}, pages = {419--449}, year = {2013}, url = {https://doi.org/10.1007/s00453-012-9644-4}, doi = {10.1007/S00453-012-9644-4}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/MihaescuHR13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/LeeRS13, author = {Yin Tat Lee and Satish Rao and Nikhil Srivastava}, editor = {Dan Boneh and Tim Roughgarden and Joan Feigenbaum}, title = {A new approach to computing maximum flows using electrical flows}, booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013}, pages = {755--764}, publisher = {{ACM}}, year = {2013}, url = {https://doi.org/10.1145/2488608.2488704}, doi = {10.1145/2488608.2488704}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/LeeRS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jmlr/NelsonRHJLRT12, author = {Blaine Nelson and Benjamin I. P. Rubinstein and Ling Huang and Anthony D. Joseph and Steven J. Lee and Satish Rao and J. D. Tygar}, title = {Query Strategies for Evading Convex-Inducing Classifiers}, journal = {J. Mach. Learn. Res.}, volume = {13}, pages = {1293--1332}, year = {2012}, url = {https://dl.acm.org/doi/10.5555/2503308.2343688}, doi = {10.5555/2503308.2343688}, timestamp = {Thu, 02 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jmlr/NelsonRHJLRT12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/talg/AwerbuchKR12, author = {Baruch Awerbuch and Rohit Khandekar and Satish Rao}, title = {Distributed algorithms for multicommodity flow problems via approximate steepest descent framework}, journal = {{ACM} Trans. Algorithms}, volume = {9}, number = {1}, pages = {3:1--3:14}, year = {2012}, url = {https://doi.org/10.1145/2390176.2390179}, doi = {10.1145/2390176.2390179}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/talg/AwerbuchKR12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/CharikarHKR10, author = {Moses Charikar and Mohammad Taghi Hajiaghayi and Howard J. Karloff and Satish Rao}, title = {\emph{\emph{l}}\({}_{\mbox{2}}\)\({}^{\mbox{2}}\) Spreading Metrics for Vertex Ordering Problems}, journal = {Algorithmica}, volume = {56}, number = {4}, pages = {577--604}, year = {2010}, url = {https://doi.org/10.1007/s00453-008-9191-1}, doi = {10.1007/S00453-008-9191-1}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/CharikarHKR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/BiswalLR10, author = {Punyashloka Biswal and James R. Lee and Satish Rao}, title = {Eigenvalue bounds, spectral partitioning, and metrical deformations via flows}, journal = {J. {ACM}}, volume = {57}, number = {3}, pages = {13:1--13:23}, year = {2010}, url = {https://doi.org/10.1145/1706591.1706593}, doi = {10.1145/1706591.1706593}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/BiswalLR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/RaoZ10, author = {Satish Rao and Shuheng Zhou}, title = {Edge Disjoint Paths in Moderately Connected Graphs}, journal = {{SIAM} J. Comput.}, volume = {39}, number = {5}, pages = {1856--1887}, year = {2010}, url = {https://doi.org/10.1137/080715093}, doi = {10.1137/080715093}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/RaoZ10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcbb/SnirR10, author = {Sagi Snir and Satish Rao}, title = {Quartets MaxCut: {A} Divide and Conquer Quartets Algorithm}, journal = {{IEEE} {ACM} Trans. Comput. Biol. Bioinform.}, volume = {7}, number = {4}, pages = {704--718}, year = {2010}, url = {https://doi.org/10.1109/TCBB.2008.133}, doi = {10.1109/TCBB.2008.133}, timestamp = {Mon, 03 Apr 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcbb/SnirR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:journals/jmlr/NelsonRHJLLRTT10, author = {Blaine Nelson and Benjamin I. P. Rubinstein and Ling Huang and Anthony D. Joseph and Shing{-}hon Lau and Steven J. Lee and Satish Rao and Anthony Tran and J. Doug Tygar}, editor = {Yee Whye Teh and D. Mike Titterington}, title = {Near-Optimal Evasion of Convex-Inducing Classifiers}, booktitle = {Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics, {AISTATS} 2010, Chia Laguna Resort, Sardinia, Italy, May 13-15, 2010}, series = {{JMLR} Proceedings}, volume = {9}, pages = {549--556}, publisher = {JMLR.org}, year = {2010}, url = {http://proceedings.mlr.press/v9/nelson10a.html}, timestamp = {Wed, 29 May 2019 08:41:44 +0200}, biburl = {https://dblp.org/rec/journals/jmlr/NelsonRHJLLRTT10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1003-2751, author = {Blaine Nelson and Benjamin I. P. Rubinstein and Ling Huang and Anthony D. Joseph and Shing{-}hon Lau and Steven J. Lee and Satish Rao and Anthony Tran and J. D. Tygar}, title = {Near-Optimal Evasion of Convex-Inducing Classifiers}, journal = {CoRR}, volume = {abs/1003.2751}, year = {2010}, url = {http://arxiv.org/abs/1003.2751}, eprinttype = {arXiv}, eprint = {1003.2751}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1003-2751.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1007-0484, author = {Blaine Nelson and Benjamin I. P. Rubinstein and Ling Huang and Anthony D. Joseph and Steven J. Lee and Satish Rao and J. D. Tygar}, title = {Query Strategies for Evading Convex-Inducing Classifiers}, journal = {CoRR}, volume = {abs/1007.0484}, year = {2010}, url = {http://arxiv.org/abs/1007.0484}, eprinttype = {arXiv}, eprint = {1007.0484}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1007-0484.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/ChaudhuriRRT09, author = {Kamalika Chaudhuri and Satish Rao and Samantha J. Riesenfeld and Kunal Talwar}, title = {What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs}, journal = {Algorithmica}, volume = {55}, number = {1}, pages = {157--189}, year = {2009}, url = {https://doi.org/10.1007/s00453-007-9115-5}, doi = {10.1007/S00453-007-9115-5}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/ChaudhuriRRT09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/AroraRV09, author = {Sanjeev Arora and Satish Rao and Umesh V. Vazirani}, title = {Expander flows, geometric embeddings and graph partitioning}, journal = {J. {ACM}}, volume = {56}, number = {2}, pages = {5:1--5:37}, year = {2009}, url = {https://doi.org/10.1145/1502793.1502794}, doi = {10.1145/1502793.1502794}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/AroraRV09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/KhandekarRV09, author = {Rohit Khandekar and Satish Rao and Umesh V. Vazirani}, title = {Graph partitioning using single commodity flows}, journal = {J. {ACM}}, volume = {56}, number = {4}, pages = {19:1--19:15}, year = {2009}, url = {https://doi.org/10.1145/1538902.1538903}, doi = {10.1145/1538902.1538903}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/KhandekarRV09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sigmetrics/RubinsteinNHJLRTT09, author = {Benjamin I. P. Rubinstein and Blaine Nelson and Ling Huang and Anthony D. Joseph and Shing{-}hon Lau and Satish Rao and Nina Taft and J. D. Tygar}, title = {Stealthy poisoning attacks on PCA-based anomaly detectors}, journal = {{SIGMETRICS} Perform. Evaluation Rev.}, volume = {37}, number = {2}, pages = {73--74}, year = {2009}, url = {https://doi.org/10.1145/1639562.1639592}, doi = {10.1145/1639562.1639592}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sigmetrics/RubinsteinNHJLRTT09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ChaudhuriRRT09, author = {Kamalika Chaudhuri and Satish Rao and Samantha J. Riesenfeld and Kunal Talwar}, title = {A push-relabel approximation algorithm for approximating the minimum-degree {MST} problem and its generalization to matroids}, journal = {Theor. Comput. Sci.}, volume = {410}, number = {44}, pages = {4489--4503}, year = {2009}, url = {https://doi.org/10.1016/j.tcs.2009.07.029}, doi = {10.1016/J.TCS.2009.07.029}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/ChaudhuriRRT09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/imc/RubinsteinNHJLRTT09, author = {Benjamin I. P. Rubinstein and Blaine Nelson and Ling Huang and Anthony D. Joseph and Shing{-}hon Lau and Satish Rao and Nina Taft and J. D. Tygar}, editor = {Anja Feldmann and Laurent Mathy}, title = {{ANTIDOTE:} understanding and defending against poisoning of anomaly detectors}, booktitle = {Proceedings of the 9th {ACM} {SIGCOMM} Internet Measurement Conference, {IMC} 2009, Chicago, Illinois, USA, November 4-6, 2009}, pages = {1--14}, publisher = {{ACM}}, year = {2009}, url = {https://doi.org/10.1145/1644893.1644895}, doi = {10.1145/1644893.1644895}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/imc/RubinsteinNHJLRTT09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cacm/AroraRV08, author = {Sanjeev Arora and Satish Rao and Umesh V. Vazirani}, title = {Geometry, flows, and graph-partitioning algorithms}, journal = {Commun. {ACM}}, volume = {51}, number = {10}, pages = {96--105}, year = {2008}, url = {https://doi.org/10.1145/1400181.1400204}, doi = {10.1145/1400181.1400204}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cacm/AroraRV08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcb/SnirWR08, author = {Sagi Snir and Tandy J. Warnow and Satish Rao}, title = {Short Quartet Puzzling: {A} New Quartet-Based Phylogeny Reconstruction Algorithm}, journal = {J. Comput. Biol.}, volume = {15}, number = {1}, pages = {91--103}, year = {2008}, url = {https://doi.org/10.1089/cmb.2007.0103}, doi = {10.1089/CMB.2007.0103}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcb/SnirWR08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/ChaudhuriR08, author = {Kamalika Chaudhuri and Satish Rao}, editor = {Rocco A. Servedio and Tong Zhang}, title = {Learning Mixtures of Product Distributions Using Correlations and Independence}, booktitle = {21st Annual Conference on Learning Theory - {COLT} 2008, Helsinki, Finland, July 9-12, 2008}, pages = {9--20}, publisher = {Omnipress}, year = {2008}, url = {http://colt2008.cs.helsinki.fi/papers/7-Chaudhuri.pdf}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/colt/ChaudhuriR08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/ChaudhuriR08a, author = {Kamalika Chaudhuri and Satish Rao}, editor = {Rocco A. Servedio and Tong Zhang}, title = {Beyond Gaussians: Spectral Methods for Learning Mixtures of Heavy-Tailed Distributions}, booktitle = {21st Annual Conference on Learning Theory - {COLT} 2008, Helsinki, Finland, July 9-12, 2008}, pages = {21--32}, publisher = {Omnipress}, year = {2008}, url = {http://colt2008.cs.helsinki.fi/papers/44-Chaudhuri.pdf}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/colt/ChaudhuriR08a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/BiswalLR08, author = {Punyashloka Biswal and James R. Lee and Satish Rao}, title = {Eigenvalue Bounds, Spectral Partitioning, and Metrical Deformations via Flows}, booktitle = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS} 2008, October 25-28, 2008, Philadelphia, PA, {USA}}, pages = {751--760}, publisher = {{IEEE} Computer Society}, year = {2008}, url = {https://doi.org/10.1109/FOCS.2008.78}, doi = {10.1109/FOCS.2008.78}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/BiswalLR08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:reference/algo/FakcharoenpholR08, author = {Jittat Fakcharoenphol and Satish Rao}, editor = {Ming{-}Yang Kao}, title = {Shortest Paths in Planar Graphs with Negative Weight Edges}, booktitle = {Encyclopedia of Algorithms - 2008 Edition}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-0-387-30162-4\_372}, doi = {10.1007/978-0-387-30162-4\_372}, timestamp = {Thu, 27 Jun 2019 16:25:31 +0200}, biburl = {https://dblp.org/rec/reference/algo/FakcharoenpholR08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:reference/algo/FakcharoenpholRT08, author = {Jittat Fakcharoenphol and Satish Rao and Kunal Talwar}, editor = {Ming{-}Yang Kao}, title = {Approximating Metric Spaces by Tree Metrics}, booktitle = {Encyclopedia of Algorithms - 2008 Edition}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-0-387-30162-4\_25}, doi = {10.1007/978-0-387-30162-4\_25}, timestamp = {Wed, 12 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/reference/algo/FakcharoenpholRT08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0808-0148, author = {Punyashloka Biswal and James R. Lee and Satish Rao}, title = {Eigenvalue bounds, spectral partitioning, and metrical deformations via flows}, journal = {CoRR}, volume = {abs/0808.0148}, year = {2008}, url = {http://arxiv.org/abs/0808.0148}, eprinttype = {arXiv}, eprint = {0808.0148}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0808-0148.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0812-1587, author = {Radu Mihaescu and Cameron Hill and Satish Rao}, title = {Fast phylogeny reconstruction through learning of ancestral sequences}, journal = {CoRR}, volume = {abs/0812.1587}, year = {2008}, url = {http://arxiv.org/abs/0812.1587}, eprinttype = {arXiv}, eprint = {0812.1587}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0812-1587.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/KolliopoulosR07, author = {Stavros G. Kolliopoulos and Satish Rao}, title = {A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem}, journal = {{SIAM} J. Comput.}, volume = {37}, number = {3}, pages = {757--782}, year = {2007}, url = {https://doi.org/10.1137/S0097539702404055}, doi = {10.1137/S0097539702404055}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/KolliopoulosR07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/talg/FakcharoenpholHR07, author = {Jittat Fakcharoenphol and Chris Harrelson and Satish Rao}, title = {The \emph{k}-traveling repairmen problem}, journal = {{ACM} Trans. Algorithms}, volume = {3}, number = {4}, pages = {40}, year = {2007}, url = {https://doi.org/10.1145/1290672.1290677}, doi = {10.1145/1290672.1290677}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/talg/FakcharoenpholHR07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/recomb/SridharRH07, author = {Srinath Sridhar and Satish Rao and Eran Halperin}, editor = {Terence P. Speed and Haiyan Huang}, title = {An Efficient and Accurate Graph-Based Approach to Detect Population Substructure}, booktitle = {Research in Computational Molecular Biology, 11th Annual International Conference, {RECOMB} 2007, Oakland, CA, USA, April 21-25, 2007, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4453}, pages = {503--517}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-71681-5\_35}, doi = {10.1007/978-3-540-71681-5\_35}, timestamp = {Mon, 13 May 2019 09:30:09 +0200}, biburl = {https://dblp.org/rec/conf/recomb/SridharRH07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/AwerbuchKR07, author = {Baruch Awerbuch and Rohit Khandekar and Satish Rao}, editor = {Nikhil Bansal and Kirk Pruhs and Clifford Stein}, title = {Distributed algorithms for multicommodity flow problems via approximate steepest descent framework}, booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9, 2007}, pages = {949--957}, publisher = {{SIAM}}, year = {2007}, url = {http://dl.acm.org/citation.cfm?id=1283383.1283485}, timestamp = {Tue, 15 Feb 2022 07:54:27 +0100}, biburl = {https://dblp.org/rec/conf/soda/AwerbuchKR07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/ChaudhuriHRZ07, author = {Kamalika Chaudhuri and Eran Halperin and Satish Rao and Shuheng Zhou}, editor = {Nikhil Bansal and Kirk Pruhs and Clifford Stein}, title = {A rigorous analysis of population stratification with limited data}, booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9, 2007}, pages = {1046--1055}, publisher = {{SIAM}}, year = {2007}, url = {http://dl.acm.org/citation.cfm?id=1283383.1283496}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/ChaudhuriHRZ07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/FakcharoenpholR06, author = {Jittat Fakcharoenphol and Satish Rao}, title = {Planar graphs, negative weight edges, shortest paths, and near linear time}, journal = {J. Comput. Syst. Sci.}, volume = {72}, number = {5}, pages = {868--889}, year = {2006}, url = {https://doi.org/10.1016/j.jcss.2005.05.007}, doi = {10.1016/J.JCSS.2005.05.007}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/FakcharoenpholR06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcbb/SnirR06, author = {Sagi Snir and Satish Rao}, title = {Using Max Cut to Enhance Rooted Trees Consistency}, journal = {{IEEE} {ACM} Trans. Comput. Biol. Bioinform.}, volume = {3}, number = {4}, pages = {323--333}, year = {2006}, url = {https://doi.org/10.1109/TCBB.2006.58}, doi = {10.1109/TCBB.2006.58}, timestamp = {Mon, 03 Apr 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcbb/SnirR06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/ChaudhuriRRT06, author = {Kamalika Chaudhuri and Satish Rao and Samantha J. Riesenfeld and Kunal Talwar}, editor = {Michele Bugliesi and Bart Preneel and Vladimiro Sassone and Ingo Wegener}, title = {A Push-Relabel Algorithm for Approximating Degree Bounded MSTs}, booktitle = {Automata, Languages and Programming, 33rd International Colloquium, {ICALP} 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {4051}, pages = {191--201}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11786986\_18}, doi = {10.1007/11786986\_18}, timestamp = {Wed, 25 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icalp/ChaudhuriRRT06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/RaoZ06, author = {Satish Rao and Shuheng Zhou}, editor = {Michele Bugliesi and Bart Preneel and Vladimiro Sassone and Ingo Wegener}, title = {Edge Disjoint Paths in Moderately Connected Graphs}, booktitle = {Automata, Languages and Programming, 33rd International Colloquium, {ICALP} 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {4051}, pages = {202--213}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11786986\_19}, doi = {10.1007/11786986\_19}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/RaoZ06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/recomb/DaskalakisHJMMR06, author = {Constantinos Daskalakis and Cameron Hill and Alexander Jaffe and Radu Mihaescu and Elchanan Mossel and Satish Rao}, editor = {Alberto Apostolico and Concettina Guerra and Sorin Istrail and Pavel A. Pevzner and Michael S. Waterman}, title = {Maximal Accurate Forests from Distance Matrices}, booktitle = {Research in Computational Molecular Biology, 10th Annual International Conference, {RECOMB} 2006, Venice, Italy, April 2-5, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3909}, pages = {281--295}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11732990\_24}, doi = {10.1007/11732990\_24}, timestamp = {Mon, 13 May 2019 09:30:09 +0200}, biburl = {https://dblp.org/rec/conf/recomb/DaskalakisHJMMR06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/ChaudhuriCMR06, author = {Kamalika Chaudhuri and Kevin C. Chen and Radu Mihaescu and Satish Rao}, title = {On the tandem duplication-random loss model of genome rearrangement}, booktitle = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006}, pages = {564--570}, publisher = {{ACM} Press}, year = {2006}, url = {http://dl.acm.org/citation.cfm?id=1109557.1109619}, timestamp = {Wed, 01 Jul 2015 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/ChaudhuriCMR06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/CharikarHKR06, author = {Moses Charikar and Mohammad Taghi Hajiaghayi and Howard J. Karloff and Satish Rao}, title = {\emph{l}\({}^{\mbox{2}}\)\({}_{\mbox{2}}\) spreading metrics for vertex ordering problems}, booktitle = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006}, pages = {1018--1027}, publisher = {{ACM} Press}, year = {2006}, url = {http://dl.acm.org/citation.cfm?id=1109557.1109670}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/CharikarHKR06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KhandekarRV06, author = {Rohit Khandekar and Satish Rao and Umesh V. Vazirani}, editor = {Jon M. Kleinberg}, title = {Graph partitioning using single commodity flows}, booktitle = {Proceedings of the 38th Annual {ACM} Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006}, pages = {385--390}, publisher = {{ACM}}, year = {2006}, url = {https://doi.org/10.1145/1132516.1132574}, doi = {10.1145/1132516.1132574}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/KhandekarRV06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/ChaudhuriRRT05, author = {Kamalika Chaudhuri and Satish Rao and Samantha J. Riesenfeld and Kunal Talwar}, editor = {Chandra Chekuri and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Luca Trevisan}, title = {What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs}, booktitle = {Approximation, Randomization and Combinatorial Optimization, Algorithms and Techniques, 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2005 and 9th InternationalWorkshop on Randomization and Computation, {RANDOM} 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3624}, pages = {26--39}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11538462\_3}, doi = {10.1007/11538462\_3}, timestamp = {Tue, 21 Sep 2021 09:36:24 +0200}, biburl = {https://dblp.org/rec/conf/approx/ChaudhuriRRT05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/recomb/BachrachCHMRS05, author = {Abraham Bachrach and Kevin C. Chen and Chris Harrelson and Radu Mihaescu and Satish Rao and Apurva Shah}, editor = {Aoife McLysaght and Daniel H. Huson}, title = {Lower Bounds for Maximum Parsimony with Gene Order Data}, booktitle = {Comparative Genomics, {RECOMB} 2005 International Workshop, {RCG} 2005, Dublin, Ireland, September 18-20, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3678}, pages = {1--10}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11554714\_1}, doi = {10.1007/11554714\_1}, timestamp = {Mon, 13 May 2019 09:30:09 +0200}, biburl = {https://dblp.org/rec/conf/recomb/BachrachCHMRS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wabi/MoranRS05, author = {Shlomo Moran and Satish Rao and Sagi Snir}, editor = {Rita Casadio and Gene Myers}, title = {Using Semi-definite Programming to Enhance Supertree Resolvability}, booktitle = {Algorithms in Bioinformatics, 5th International Workshop, {WABI} 2005, Mallorca, Spain, October 3-6, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3692}, pages = {89--103}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11557067\_8}, doi = {10.1007/11557067\_8}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/wabi/MoranRS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/FakcharoenpholRT04, author = {Jittat Fakcharoenphol and Satish Rao and Kunal Talwar}, title = {A tight bound on approximating arbitrary metrics by tree metrics}, journal = {J. Comput. Syst. Sci.}, volume = {69}, number = {3}, pages = {485--497}, year = {2004}, url = {https://doi.org/10.1016/j.jcss.2004.04.011}, doi = {10.1016/J.JCSS.2004.04.011}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/FakcharoenpholRT04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/HildrumKRZ04, author = {Kirsten Hildrum and John D. Kubiatowicz and Satish Rao and Ben Y. Zhao}, title = {Distributed Object Location in a Dynamic Network}, journal = {Theory Comput. Syst.}, volume = {37}, number = {3}, pages = {405--440}, year = {2004}, url = {https://doi.org/10.1007/s00224-004-1146-6}, doi = {10.1007/S00224-004-1146-6}, timestamp = {Tue, 12 Mar 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mst/HildrumKRZ04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/RaoR04, author = {Satish Rao and Andr{\'{e}}a W. Richa}, title = {New Approximation Techniques for Some Linear Ordering Problems}, journal = {{SIAM} J. Comput.}, volume = {34}, number = {2}, pages = {388--404}, year = {2004}, url = {https://doi.org/10.1137/S0097539702413197}, doi = {10.1137/S0097539702413197}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/RaoR04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sigact/FakcharoenpholRT04, author = {Jittat Fakcharoenphol and Satish Rao and Kunal Talwar}, title = {Approximating metrics by tree metrics}, journal = {{SIGACT} News}, volume = {35}, number = {2}, pages = {60--70}, year = {2004}, url = {https://doi.org/10.1145/992287.992300}, doi = {10.1145/992287.992300}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/sigact/FakcharoenpholRT04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/LangR04, author = {Kevin J. Lang and Satish Rao}, editor = {George L. Nemhauser and Daniel Bienstock}, title = {A Flow-Based Method for Improving the Expansion or Conductance of Graph Cuts}, booktitle = {Integer Programming and Combinatorial Optimization, 10th International {IPCO} Conference, New York, NY, USA, June 7-11, 2004, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3064}, pages = {325--337}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-25960-2\_25}, doi = {10.1007/978-3-540-25960-2\_25}, timestamp = {Tue, 14 May 2019 10:00:50 +0200}, biburl = {https://dblp.org/rec/conf/ipco/LangR04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/HildrumMR04, author = {Kirsten Hildrum and Sean Ma and Satish Rao}, editor = {Soma Chaudhuri and Shay Kutten}, title = {Brief announcement: randomized rumor spreading with fewer phone calls}, booktitle = {Proceedings of the Twenty-Third Annual {ACM} Symposium on Principles of Distributed Computing, {PODC} 2004, St. John's, Newfoundland, Canada, July 25-28, 2004}, pages = {380}, publisher = {{ACM}}, year = {2004}, url = {https://doi.org/10.1145/1011767.1011839}, doi = {10.1145/1011767.1011839}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/podc/HildrumMR04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/HildrumKMR04, author = {Kirsten Hildrum and John Kubiatowicz and Sean Ma and Satish Rao}, editor = {J. Ian Munro}, title = {A note on the nearest neighbor in growth-restricted metrics}, booktitle = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14, 2004}, pages = {560--561}, publisher = {{SIAM}}, year = {2004}, url = {http://dl.acm.org/citation.cfm?id=982792.982874}, timestamp = {Fri, 07 Dec 2012 17:02:08 +0100}, biburl = {https://dblp.org/rec/conf/soda/HildrumKMR04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AroraRV04, author = {Sanjeev Arora and Satish Rao and Umesh V. Vazirani}, editor = {L{\'{a}}szl{\'{o}} Babai}, title = {Expander flows, geometric embeddings and graph partitioning}, booktitle = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004}, pages = {222--231}, publisher = {{ACM}}, year = {2004}, url = {https://doi.org/10.1145/1007352.1007355}, doi = {10.1145/1007352.1007355}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AroraRV04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/ChaudhuriGRT03, author = {Kamalika Chaudhuri and Brighten Godfrey and Satish Rao and Kunal Talwar}, title = {Paths, Trees, and Minimum Latency Tours}, booktitle = {44th Symposium on Foundations of Computer Science {(FOCS} 2003), 11-14 October 2003, Cambridge, MA, USA, Proceedings}, pages = {36--45}, publisher = {{IEEE} Computer Society}, year = {2003}, url = {https://doi.org/10.1109/SFCS.2003.1238179}, doi = {10.1109/SFCS.2003.1238179}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/ChaudhuriGRT03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/FakcharoenpholHRT03, author = {Jittat Fakcharoenphol and Chris Harrelson and Satish Rao and Kunal Talwar}, title = {An improved approximation algorithm for the 0-extension problem}, booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}}, pages = {257--265}, publisher = {{ACM/SIAM}}, year = {2003}, url = {http://dl.acm.org/citation.cfm?id=644108.644153}, timestamp = {Fri, 07 Dec 2012 17:02:08 +0100}, biburl = {https://dblp.org/rec/conf/soda/FakcharoenpholHRT03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/FakcharoenpholHR03, author = {Jittat Fakcharoenphol and Chris Harrelson and Satish Rao}, title = {The k-traveling repairman problem}, booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}}, pages = {655--664}, publisher = {{ACM/SIAM}}, year = {2003}, url = {http://dl.acm.org/citation.cfm?id=644108.644215}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/FakcharoenpholHR03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/spaa/HarrelsonHR03, author = {Chris Harrelson and Kirsten Hildrum and Satish Rao}, editor = {Arnold L. Rosenberg and Friedhelm Meyer auf der Heide}, title = {A polynomial-time tree decomposition to minimize congestion}, booktitle = {{SPAA} 2003: Proceedings of the Fifteenth Annual {ACM} Symposium on Parallelism in Algorithms and Architectures, June 7-9, 2003, San Diego, California, {USA} (part of {FCRC} 2003)}, pages = {34--43}, publisher = {{ACM}}, year = {2003}, url = {https://doi.org/10.1145/777412.777419}, doi = {10.1145/777412.777419}, timestamp = {Wed, 21 Nov 2018 11:11:22 +0100}, biburl = {https://dblp.org/rec/conf/spaa/HarrelsonHR03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AmirKR03, author = {Eyal Amir and Robert Krauthgamer and Satish Rao}, editor = {Lawrence L. Larmore and Michel X. Goemans}, title = {Constant factor approximation of vertex-cuts in planar graphs}, booktitle = {Proceedings of the 35th Annual {ACM} Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, {USA}}, pages = {90--99}, publisher = {{ACM}}, year = {2003}, url = {https://doi.org/10.1145/780542.780557}, doi = {10.1145/780542.780557}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/AmirKR03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/FakcharoenpholRT03, author = {Jittat Fakcharoenphol and Satish Rao and Kunal Talwar}, editor = {Lawrence L. Larmore and Michel X. Goemans}, title = {A tight bound on approximating arbitrary metrics by tree metrics}, booktitle = {Proceedings of the 35th Annual {ACM} Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, {USA}}, pages = {448--455}, publisher = {{ACM}}, year = {2003}, url = {https://doi.org/10.1145/780542.780608}, doi = {10.1145/780542.780608}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/FakcharoenpholRT03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/spaa/HildrumKRZ02, author = {Kirsten Hildrum and John Kubiatowicz and Satish Rao and Ben Y. Zhao}, editor = {Arnold L. Rosenberg and Bruce M. Maggs}, title = {Distributed object location in a dynamic network}, booktitle = {Proceedings of the Fourteenth Annual {ACM} Symposium on Parallel Algorithms and Architectures, {SPAA} 2002, Winnipeg, Manitoba, Canada, August 11-13, 2002}, pages = {41--52}, publisher = {{ACM}}, year = {2002}, url = {https://doi.org/10.1145/564870.564877}, doi = {10.1145/564870.564877}, timestamp = {Wed, 21 Nov 2018 12:27:44 +0100}, biburl = {https://dblp.org/rec/conf/spaa/HildrumKRZ02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/LeightonLRS01, author = {Frank Thomson Leighton and Chi{-}Jen Lu and Satish Rao and Aravind Srinivasan}, title = {New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning}, journal = {{SIAM} J. Comput.}, volume = {31}, number = {2}, pages = {626--641}, year = {2001}, url = {https://doi.org/10.1137/S0097539700379760}, doi = {10.1137/S0097539700379760}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/LeightonLRS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/FakcharoenpholR01, author = {Jittat Fakcharoenphol and Satish Rao}, title = {Planar Graphs, Negative Weight Edges, Shortest Paths, Near Linear Time}, booktitle = {42nd Annual Symposium on Foundations of Computer Science, {FOCS} 2001, 14-17 October 2001, Las Vegas, Nevada, {USA}}, pages = {232--241}, publisher = {{IEEE} Computer Society}, year = {2001}, url = {https://doi.org/10.1109/SFCS.2001.959897}, doi = {10.1109/SFCS.2001.959897}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/FakcharoenpholR01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/EvenNRS00, author = {Guy Even and Joseph Naor and Satish Rao and Baruch Schieber}, title = {Divide-and-conquer approximation algorithms via spreading metrics}, journal = {J. {ACM}}, volume = {47}, number = {4}, pages = {585--616}, year = {2000}, url = {https://doi.org/10.1145/347476.347478}, doi = {10.1145/347476.347478}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/EvenNRS00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/HenzingerRG00, author = {Monika Rauch Henzinger and Satish Rao and Harold N. Gabow}, title = {Computing Vertex Connectivity: New Bounds from Old Techniques}, journal = {J. Algorithms}, volume = {34}, number = {2}, pages = {222--250}, year = {2000}, url = {https://doi.org/10.1006/jagm.1999.1055}, doi = {10.1006/JAGM.1999.1055}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/HenzingerRG00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/infocom/GoudreauKR00, author = {Mark W. Goudreau and Stavros G. Kolliopoulos and Satish Rao}, title = {Scheduling Algorithms for Input-Queued Switches: Randomized Techniques and Experimental Evaluation}, booktitle = {Proceedings {IEEE} {INFOCOM} 2000, The Conference on Computer Communications, Nineteenth Annual Joint Conference of the {IEEE} Computer and Communications Societies, Reaching the Promised Land of Communications, Tel Aviv, Israel, March 26-30, 2000}, pages = {1624--1643}, publisher = {{IEEE} Computer Society}, year = {2000}, url = {https://doi.org/10.1109/INFCOM.2000.832562}, doi = {10.1109/INFCOM.2000.832562}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/infocom/GoudreauKR00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/LeightonR99, author = {Frank Thomson Leighton and Satish Rao}, title = {Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms}, journal = {J. {ACM}}, volume = {46}, number = {6}, pages = {787--832}, year = {1999}, url = {https://doi.org/10.1145/331524.331526}, doi = {10.1145/331524.331526}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/LeightonR99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/GoldbergMR99, author = {Leslie Ann Goldberg and Yossi Matias and Satish Rao}, title = {An Optical Simulation of Shared Memory}, journal = {{SIAM} J. Comput.}, volume = {28}, number = {5}, pages = {1829--1847}, year = {1999}, url = {https://doi.org/10.1137/S0097539795290507}, doi = {10.1137/S0097539795290507}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/GoldbergMR99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/EvenNRS99, author = {Guy Even and Joseph Naor and Satish Rao and Baruch Schieber}, title = {Fast Approximate Graph Partitioning Algorithms}, journal = {{SIAM} J. Comput.}, volume = {28}, number = {6}, pages = {2187--2214}, year = {1999}, url = {https://doi.org/10.1137/S0097539796308217}, doi = {10.1137/S0097539796308217}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/EvenNRS99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/GoldbergR99, author = {Andrew V. Goldberg and Satish Rao}, title = {Flows in Undirected Unit Capacity Networks}, journal = {{SIAM} J. Discret. Math.}, volume = {12}, number = {1}, pages = {1--5}, year = {1999}, url = {https://doi.org/10.1137/S089548019733103X}, doi = {10.1137/S089548019733103X}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/GoldbergR99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tc/GoudreauLRST99, author = {Mark W. Goudreau and Kevin J. Lang and Satish Rao and Torsten Suel and Thanasis Tsantilas}, title = {Portable and Efficient Parallel Computing Using the {BSP} Model}, journal = {{IEEE} Trans. Computers}, volume = {48}, number = {7}, pages = {670--689}, year = {1999}, url = {https://doi.org/10.1109/12.780876}, doi = {10.1109/12.780876}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tc/GoudreauLRST99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/compgeom/Rao99, author = {Satish Rao}, editor = {Victor Milenkovic}, title = {Small Distortion and Volume Preserving Embeddings for Planar and Euclidean Metrics}, booktitle = {Proceedings of the Fifteenth Annual Symposium on Computational Geometry, Miami Beach, Florida, USA, June 13-16, 1999}, pages = {300--306}, publisher = {{ACM}}, year = {1999}, url = {https://doi.org/10.1145/304893.304983}, doi = {10.1145/304893.304983}, timestamp = {Mon, 14 Jun 2021 16:25:07 +0200}, biburl = {https://dblp.org/rec/conf/compgeom/Rao99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/KolliopoulosR99, author = {Stavros G. Kolliopoulos and Satish Rao}, editor = {Jaroslav Nesetril}, title = {A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem}, booktitle = {Algorithms - {ESA} '99, 7th Annual European Symposium, Prague, Czech Republic, July 16-18, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1643}, pages = {378--389}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-48481-7\_33}, doi = {10.1007/3-540-48481-7\_33}, timestamp = {Tue, 14 May 2019 10:00:54 +0200}, biburl = {https://dblp.org/rec/conf/esa/KolliopoulosR99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/LeightonRS99, author = {Frank Thomson Leighton and Satish Rao and Aravind Srinivasan}, editor = {Robert Endre Tarjan and Tandy J. Warnow}, title = {New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning}, booktitle = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, 17-19 January 1999, Baltimore, Maryland, {USA}}, pages = {643--652}, publisher = {{ACM/SIAM}}, year = {1999}, url = {http://dl.acm.org/citation.cfm?id=314500.314886}, timestamp = {Thu, 05 Jul 2018 07:29:57 +0200}, biburl = {https://dblp.org/rec/conf/soda/LeightonRS99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/spaa/GoudreauLNR99, author = {Mark W. Goudreau and Kevin J. Lang and Girija J. Narlikar and Satish Rao}, editor = {Gary L. Miller and Vijaya Ramachandran}, title = {{BOS} is Boss: {A} Case for Bulk-Synchronous Object Systems}, booktitle = {Proceedings of the Eleventh Annual {ACM} Symposium on Parallel Algorithms and Architectures, {SPAA} '99, Saint-Malo, France, June 27-30, 1999}, pages = {115--125}, publisher = {{ACM}}, year = {1999}, url = {https://doi.org/10.1145/305619.305632}, doi = {10.1145/305619.305632}, timestamp = {Wed, 21 Nov 2018 12:27:44 +0100}, biburl = {https://dblp.org/rec/conf/spaa/GoudreauLNR99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/GoldbergR98, author = {Andrew V. Goldberg and Satish Rao}, title = {Beyond the Flow Decomposition Barrier}, journal = {J. {ACM}}, volume = {45}, number = {5}, pages = {783--797}, year = {1998}, url = {https://doi.org/10.1145/290179.290181}, doi = {10.1145/290179.290181}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/GoldbergR98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/pc/HillMSGLRSTB98, author = {Jonathan M. D. Hill and Bill McColl and Dan C. Stefanescu and Mark W. Goudreau and Kevin J. Lang and Satish Rao and Torsten Suel and Thanasis Tsantilas and Rob H. Bisseling}, title = {BSPlib: The {BSP} programming library}, journal = {Parallel Comput.}, volume = {24}, number = {14}, pages = {1947--1980}, year = {1998}, url = {https://doi.org/10.1016/S0167-8191(98)00093-3}, doi = {10.1016/S0167-8191(98)00093-3}, timestamp = {Sat, 22 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/pc/HillMSGLRSTB98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/hicss/LeightonRS98, author = {Tom Leighton and Satish Rao and Aravind Srinivasan}, title = {Multicommodity Flow and Circuit Switching}, booktitle = {Thirty-First Annual Hawaii International Conference on System Sciences, Kohala Coast, Hawaii, USA, January 6-9, 1998}, pages = {459--465}, publisher = {{IEEE} Computer Society}, year = {1998}, url = {https://doi.org/10.1109/HICSS.1998.649241}, doi = {10.1109/HICSS.1998.649241}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/hicss/LeightonRS98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/RaoR98, author = {Satish Rao and Andr{\'{e}}a W. Richa}, editor = {Howard J. Karloff}, title = {New Approximation Techniques for Some Ordering Problems}, booktitle = {Proceedings of the Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms, 25-27 January 1998, San Francisco, California, {USA}}, pages = {211--218}, publisher = {{ACM/SIAM}}, year = {1998}, url = {http://dl.acm.org/citation.cfm?id=314613.314703}, timestamp = {Thu, 05 Jul 2018 07:29:49 +0200}, biburl = {https://dblp.org/rec/conf/soda/RaoR98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AroraRR98, author = {Sanjeev Arora and Prabhakar Raghavan and Satish Rao}, editor = {Jeffrey Scott Vitter}, title = {Approximation Schemes for Euclidean \emph{k}-Medians and Related Problems}, booktitle = {Proceedings of the Thirtieth Annual {ACM} Symposium on the Theory of Computing, Dallas, Texas, USA, May 23-26, 1998}, pages = {106--113}, publisher = {{ACM}}, year = {1998}, url = {https://doi.org/10.1145/276698.276718}, doi = {10.1145/276698.276718}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AroraRR98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/RaoS98, author = {Satish Rao and Warren D. Smith}, editor = {Jeffrey Scott Vitter}, title = {Approximating Geometrical Graphs via "Spanners" and "Banyans"}, booktitle = {Proceedings of the Thirtieth Annual {ACM} Symposium on the Theory of Computing, Dallas, Texas, USA, May 23-26, 1998}, pages = {540--550}, publisher = {{ACM}}, year = {1998}, url = {https://doi.org/10.1145/276698.276868}, doi = {10.1145/276698.276868}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/RaoS98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/KochLMRRS97, author = {Richard R. Koch and Frank Thomson Leighton and Bruce M. Maggs and Satish Rao and Arnold L. Rosenberg and Eric J. Schwabe}, title = {Work-preserving emulations of fixed-connection networks}, journal = {J. {ACM}}, volume = {44}, number = {1}, pages = {104--147}, year = {1997}, url = {https://doi.org/10.1145/256292.256299}, doi = {10.1145/256292.256299}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/KochLMRRS97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/KleinPRT97, author = {Philip N. Klein and Serge A. Plotkin and Satish Rao and {\'{E}}va Tardos}, title = {Approximation Algorithms for Steiner and Directed Multicuts}, journal = {J. Algorithms}, volume = {22}, number = {2}, pages = {241--269}, year = {1997}, url = {https://doi.org/10.1006/jagm.1996.0833}, doi = {10.1006/JAGM.1996.0833}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/KleinPRT97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/LeisersonRT97, author = {Charles E. Leiserson and Satish Rao and Sivan Toledo}, title = {Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers}, journal = {J. Comput. Syst. Sci.}, volume = {54}, number = {2}, pages = {332--344}, year = {1997}, url = {https://doi.org/10.1006/jcss.1997.1473}, doi = {10.1006/JCSS.1997.1473}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/LeisersonRT97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/HenzingerKRS97, author = {Monika Rauch Henzinger and Philip N. Klein and Satish Rao and Sairam Subramanian}, title = {Faster Shortest-Path Algorithms for Planar Graphs}, journal = {J. Comput. Syst. Sci.}, volume = {55}, number = {1}, pages = {3--23}, year = {1997}, url = {https://doi.org/10.1006/jcss.1997.1493}, doi = {10.1006/JCSS.1997.1493}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/HenzingerKRS97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/KaklamanisKR97, author = {Christos Kaklamanis and Danny Krizanc and Satish Rao}, title = {New Graph Decompositions with Applications to Emulations}, journal = {Theory Comput. Syst.}, volume = {30}, number = {1}, pages = {39--49}, year = {1997}, url = {https://doi.org/10.1007/BF02679452}, doi = {10.1007/BF02679452}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/KaklamanisKR97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/GoldbergJLR97, author = {Leslie Ann Goldberg and Mark Jerrum and Frank Thomson Leighton and Satish Rao}, title = {Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers}, journal = {{SIAM} J. Comput.}, volume = {26}, number = {4}, pages = {1100--1119}, year = {1997}, url = {https://doi.org/10.1137/S0097539793259483}, doi = {10.1137/S0097539793259483}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/GoldbergJLR97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/spe/WongRR97, author = {Johnny Wong and Satish Rao and Naveen Ramaiah}, title = {A Multimedia Presentation Toolkit for the World Wide Web}, journal = {Softw. Pract. Exp.}, volume = {27}, number = {4}, pages = {425--446}, year = {1997}, url = {https://doi.org/10.1002/(SICI)1097-024X(199704)27:4\&\#60;425::AID-SPE92\&\#62;3.0.CO;2-2}, doi = {10.1002/(SICI)1097-024X(199704)27:4\&\#60;425::AID-SPE92\&\#62;3.0.CO;2-2}, timestamp = {Thu, 09 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/spe/WongRR97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/GoldbergR97, author = {Andrew V. Goldberg and Satish Rao}, title = {Beyond the Flow Decomposition Barrier}, booktitle = {38th Annual Symposium on Foundations of Computer Science, {FOCS} '97, Miami Beach, Florida, USA, October 19-22, 1997}, pages = {2--11}, publisher = {{IEEE} Computer Society}, year = {1997}, url = {https://doi.org/10.1109/SFCS.1997.646087}, doi = {10.1109/SFCS.1997.646087}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/GoldbergR97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/GoldbergR97a, author = {Andrew V. Goldberg and Satish Rao}, title = {Flows in Undirected Unit Capacity Networks}, booktitle = {38th Annual Symposium on Foundations of Computer Science, {FOCS} '97, Miami Beach, Florida, USA, October 19-22, 1997}, pages = {32--34}, publisher = {{IEEE} Computer Society}, year = {1997}, url = {https://doi.org/10.1109/SFCS.1997.646090}, doi = {10.1109/SFCS.1997.646090}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/GoldbergR97a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ppsc/EvenNRS97, author = {Guy Even and Joseph Naor and Satish Rao and Baruch Schieber}, title = {Spreading Metric Based Graph Partitioning Algorithms}, booktitle = {Proceedings of the Eighth {SIAM} Conference on Parallel Processing for Scientific Computing, {PP} 1997, Hyatt Regency Minneapolis on Nicollel Mall Hotel, Minneapolis, Minnesota, USA, March 14-17, 1997}, publisher = {{SIAM}}, year = {1997}, timestamp = {Wed, 03 Jul 2024 11:15:21 +0200}, biburl = {https://dblp.org/rec/conf/ppsc/EvenNRS97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/EvenNRS97, author = {Guy Even and Joseph Naor and Satish Rao and Baruch Schieber}, editor = {Michael E. Saks}, title = {Fast Approximate Graph Partitioning Algorithms}, booktitle = {Proceedings of the Eighth Annual {ACM-SIAM} Symposium on Discrete Algorithms, 5-7 January 1997, New Orleans, Louisiana, {USA}}, pages = {639--648}, publisher = {{ACM/SIAM}}, year = {1997}, url = {http://dl.acm.org/citation.cfm?id=314161.314405}, timestamp = {Thu, 05 Jul 2018 07:29:42 +0200}, biburl = {https://dblp.org/rec/conf/soda/EvenNRS97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cviu/CoxHRM96, author = {Ingemar J. Cox and Sunita L. Hingorani and Satish Rao and Bruce M. Maggs}, title = {A Maximum Likelihood Stereo Algorithm}, journal = {Comput. Vis. Image Underst.}, volume = {63}, number = {3}, pages = {542--567}, year = {1996}, url = {https://doi.org/10.1006/cviu.1996.0040}, doi = {10.1006/CVIU.1996.0040}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cviu/CoxHRM96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/HenzingerRG96, author = {Monika Rauch Henzinger and Satish Rao and Harold N. Gabow}, title = {Computing Vertex Connectivity: New Bounds from Old Techniques}, booktitle = {37th Annual Symposium on Foundations of Computer Science, {FOCS} '96, Burlington, Vermont, USA, 14-16 October, 1996}, pages = {462--471}, publisher = {{IEEE} Computer Society}, year = {1996}, url = {https://doi.org/10.1109/SFCS.1996.548505}, doi = {10.1109/SFCS.1996.548505}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/HenzingerRG96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icpr/CoxRZ96, author = {Ingemar J. Cox and Satish Rao and Yu Zhong}, title = {"Ratio regions": a technique for image segmentation}, booktitle = {13th International Conference on Pattern Recognition, {ICPR} 1996, Vienna, Austria, 25-19 August, 1996}, pages = {557--564}, publisher = {{IEEE} Computer Society}, year = {1996}, url = {https://doi.org/10.1109/ICPR.1996.546886}, doi = {10.1109/ICPR.1996.546886}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icpr/CoxRZ96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/spaa/GoudreauLRST96, author = {Mark W. Goudreau and Kevin J. Lang and Satish Rao and Torsten Suel and Thanasis Tsantilas}, editor = {Guy E. Blelloch}, title = {Towards Efficiency and Portability: Programming with the {BSP} Model}, booktitle = {Proceedings of the 8th Annual {ACM} Symposium on Parallel Algorithms and Architectures, {SPAA} '96, Padua, Italy, June 24-26, 1996}, pages = {1--12}, publisher = {{ACM}}, year = {1996}, url = {https://doi.org/10.1145/237502.237503}, doi = {10.1145/237502.237503}, timestamp = {Wed, 21 Nov 2018 12:27:44 +0100}, biburl = {https://dblp.org/rec/conf/spaa/GoudreauLRST96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorica/KleinRAR95, author = {Philip N. Klein and Satish Rao and Ajit Agrawal and R. Ravi}, title = {An Approximate Max-Flow Min-Cut Relation for Unidirected Multicommodity Flow, with Applications}, journal = {Comb.}, volume = {15}, number = {2}, pages = {187--202}, year = {1995}, url = {https://doi.org/10.1007/BF01200755}, doi = {10.1007/BF01200755}, timestamp = {Wed, 22 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorica/KleinRAR95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/EvenNRS95, author = {Guy Even and Joseph Naor and Satish Rao and Baruch Schieber}, title = {Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract)}, booktitle = {36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995}, pages = {62--71}, publisher = {{IEEE} Computer Society}, year = {1995}, url = {https://doi.org/10.1109/SFCS.1995.492463}, doi = {10.1109/SFCS.1995.492463}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/EvenNRS95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/MihailKR95, author = {Milena Mihail and Christos Kaklamanis and Satish Rao}, title = {Efficient Access to Optical Bandwidth - Wavelength Routing on Directed Fiber Trees, Rings, and Trees of Rings}, booktitle = {36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995}, pages = {548--557}, publisher = {{IEEE} Computer Society}, year = {1995}, url = {https://doi.org/10.1109/SFCS.1995.492585}, doi = {10.1109/SFCS.1995.492585}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/MihailKR95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipps/RaoSTG95, author = {Satish Rao and Torsten Suel and Thanasis Tsantilas and Mark W. Goudreau}, title = {Efficient communication using total-exchange}, booktitle = {Proceedings of {IPPS} '95, The 9th International Parallel Processing Symposium, April 25-28, 1995, Santa Barbara, California, {USA}}, pages = {544--550}, publisher = {{IEEE} Computer Society}, year = {1995}, url = {https://doi.org/10.1109/IPPS.1995.395984}, doi = {10.1109/IPPS.1995.395984}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/ipps/RaoSTG95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorica/LeightonMR94, author = {Frank Thomson Leighton and Bruce M. Maggs and Satish Rao}, title = {Packet Routing and Job-Shop Scheduling in \emph{O}(Congestion + Dilation) Steps}, journal = {Comb.}, volume = {14}, number = {2}, pages = {167--186}, year = {1994}, url = {https://doi.org/10.1007/BF01215349}, doi = {10.1007/BF01215349}, timestamp = {Wed, 22 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorica/LeightonMR94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/LeightonMRR94, author = {Frank Thomson Leighton and Bruce M. Maggs and Abhiram G. Ranade and Satish Rao}, title = {Randomized Routing and Sorting on Fixed-Connection Networks}, journal = {J. Algorithms}, volume = {17}, number = {1}, pages = {157--205}, year = {1994}, url = {https://doi.org/10.1006/jagm.1994.1030}, doi = {10.1006/JAGM.1994.1030}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/LeightonMRR94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/PlotkinRS94, author = {Serge A. Plotkin and Satish Rao and Warren D. Smith}, editor = {Daniel Dominic Sleator}, title = {Shallow Excluded Minors and Improved Graph Decompositions}, booktitle = {Proceedings of the Fifth Annual {ACM-SIAM} Symposium on Discrete Algorithms. 23-25 January 1994, Arlington, Virginia, {USA}}, pages = {462--470}, publisher = {{ACM/SIAM}}, year = {1994}, url = {http://dl.acm.org/citation.cfm?id=314464.314625}, timestamp = {Thu, 05 Jul 2018 07:29:19 +0200}, biburl = {https://dblp.org/rec/conf/soda/PlotkinRS94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/spaa/GoldbergMR94, author = {Leslie Ann Goldberg and Yossi Matias and Satish Rao}, editor = {Lawrence Snyder and Charles E. Leiserson}, title = {An Optical Simulation of Shared Memory}, booktitle = {Proceedings of the 6th Annual {ACM} Symposium on Parallel Algorithms and Architectures, {SPAA} '94, Cape May, New Jersey, USA, June 27-29, 1994}, pages = {257--267}, publisher = {{ACM}}, year = {1994}, url = {https://doi.org/10.1145/181014.181406}, doi = {10.1145/181014.181406}, timestamp = {Mon, 29 Jul 2024 11:07:21 +0200}, biburl = {https://dblp.org/rec/conf/spaa/GoldbergMR94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KleinRRS94, author = {Philip N. Klein and Satish Rao and Monika Rauch and Sairam Subramanian}, editor = {Frank Thomson Leighton and Michael T. Goodrich}, title = {Faster shortest-path algorithms for planar graphs}, booktitle = {Proceedings of the Twenty-Sixth Annual {ACM} Symposium on Theory of Computing, 23-25 May 1994, Montr{\'{e}}al, Qu{\'{e}}bec, Canada}, pages = {27--37}, publisher = {{ACM}}, year = {1994}, url = {https://doi.org/10.1145/195058.195092}, doi = {10.1145/195058.195092}, timestamp = {Thu, 04 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/KleinRRS94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/KaklamanisKR93, author = {Christos Kaklamanis and Danny Krizanc and Satish Rao}, title = {Universal Emulations with Sublogarithmic Slowdown}, booktitle = {34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993}, pages = {341--350}, publisher = {{IEEE} Computer Society}, year = {1993}, url = {https://doi.org/10.1109/SFCS.1993.366853}, doi = {10.1109/SFCS.1993.366853}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/KaklamanisKR93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/LeisersonRT93, author = {Charles E. Leiserson and Satish Rao and Sivan Toledo}, title = {Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers (Extended Abstract)}, booktitle = {34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993}, pages = {704--713}, publisher = {{IEEE} Computer Society}, year = {1993}, url = {https://doi.org/10.1109/SFCS.1993.366817}, doi = {10.1109/SFCS.1993.366817}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/LeisersonRT93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/LangR93, author = {Kevin J. Lang and Satish Rao}, editor = {Vijaya Ramachandran}, title = {Finding Near-Optimal Cuts: An Empirical Evaluation}, booktitle = {Proceedings of the Fourth Annual {ACM/SIGACT-SIAM} Symposium on Discrete Algorithms, 25-27 January 1993, Austin, Texas, {USA}}, pages = {212--221}, publisher = {{ACM/SIAM}}, year = {1993}, url = {http://dl.acm.org/citation.cfm?id=313559.313755}, timestamp = {Thu, 05 Jul 2018 07:29:11 +0200}, biburl = {https://dblp.org/rec/conf/soda/LangR93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/spaa/GoldbergJLR93, author = {Leslie Ann Goldberg and Mark Jerrum and Frank Thomson Leighton and Satish Rao}, editor = {Lawrence Snyder}, title = {A Doubly Logarithmic Communication Algorithm for the Completely Connected Optical Communication Parallel Computer}, booktitle = {Proceedings of the 5th Annual {ACM} Symposium on Parallel Algorithms and Architectures, {SPAA} '93, Velen, Germany, June 30 - July 2, 1993}, pages = {300--309}, publisher = {{ACM}}, year = {1993}, url = {https://doi.org/10.1145/165231.166108}, doi = {10.1145/165231.166108}, timestamp = {Mon, 29 Jul 2024 11:07:21 +0200}, biburl = {https://dblp.org/rec/conf/spaa/GoldbergJLR93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/spaa/KaklamanisKR93, author = {Christos Kaklamanis and Danny Krizanc and Satish Rao}, editor = {Lawrence Snyder}, title = {New Graph Decompositions and Fast Emulations in Hypercubes and Butterflies}, booktitle = {Proceedings of the 5th Annual {ACM} Symposium on Parallel Algorithms and Architectures, {SPAA} '93, Velen, Germany, June 30 - July 2, 1993}, pages = {325--334}, publisher = {{ACM}}, year = {1993}, url = {https://doi.org/10.1145/165231.166112}, doi = {10.1145/165231.166112}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/spaa/KaklamanisKR93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AielloAMR93, author = {William Aiello and Baruch Awerbuch and Bruce M. Maggs and Satish Rao}, editor = {S. Rao Kosaraju and David S. Johnson and Alok Aggarwal}, title = {Approximate load balancing on dynamic and asynchronous networks}, booktitle = {Proceedings of the Twenty-Fifth Annual {ACM} Symposium on Theory of Computing, May 16-18, 1993, San Diego, CA, {USA}}, pages = {632--641}, publisher = {{ACM}}, year = {1993}, url = {https://doi.org/10.1145/167088.167250}, doi = {10.1145/167088.167250}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AielloAMR93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KleinPR93, author = {Philip N. Klein and Serge A. Plotkin and Satish Rao}, editor = {S. Rao Kosaraju and David S. Johnson and Alok Aggarwal}, title = {Excluded minors, network decomposition, and multicommodity flow}, booktitle = {Proceedings of the Twenty-Fifth Annual {ACM} Symposium on Theory of Computing, May 16-18, 1993, San Diego, CA, {USA}}, pages = {682--690}, publisher = {{ACM}}, year = {1993}, url = {https://doi.org/10.1145/167088.167261}, doi = {10.1145/167088.167261}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/KleinPR93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/bmvc/CoxHMR92, author = {Ingemar J. Cox and Sunita L. Hingorani and Bruce M. Maggs and Satish Rao}, editor = {David C. Hogg and Roger Boyle}, title = {Stereo Without Disparity Gradient Smoothing: {A} Bayesian Sensor Fusion Solution}, booktitle = {Proceedings of the British Machine Vision Conference, {BMVC} 1992, Leeds, UK, September, 1992}, pages = {1--10}, publisher = {{BMVA} Press}, year = {1992}, url = {https://doi.org/10.5244/C.6.35}, doi = {10.5244/C.6.35}, timestamp = {Wed, 03 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/bmvc/CoxHMR92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/spaa/KaklamanisKR92, author = {Christos Kaklamanis and Danny Krizanc and Satish Rao}, editor = {Lawrence Snyder}, title = {Simple Path Selection for Optimal Routing on Processor Arrays}, booktitle = {Proceedings of the 4th Annual {ACM} Symposium on Parallel Algorithms and Architectures, {SPAA} '92, San Diego, CA, USA, June 29 - July 1, 1992}, pages = {23--30}, publisher = {{ACM}}, year = {1992}, url = {https://doi.org/10.1145/140901.140904}, doi = {10.1145/140901.140904}, timestamp = {Mon, 29 Jul 2024 11:07:21 +0200}, biburl = {https://dblp.org/rec/conf/spaa/KaklamanisKR92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Rao92, author = {Satish Rao}, editor = {S. Rao Kosaraju and Mike Fellows and Avi Wigderson and John A. Ellis}, title = {Faster Algorithms for Finding Small Edge Cuts in Planar Graphs (Extended Abstract)}, booktitle = {Proceedings of the 24th Annual {ACM} Symposium on Theory of Computing, May 4-6, 1992, Victoria, British Columbia, Canada}, pages = {229--240}, publisher = {{ACM}}, year = {1992}, url = {https://doi.org/10.1145/129712.129735}, doi = {10.1145/129712.129735}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Rao92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/KaklamanisKLMRRTT90, author = {Christos Kaklamanis and Anna R. Karlin and Frank Thomson Leighton and Victor Milenkovic and Prabhakar Raghavan and Satish Rao and Clark D. Thomborson and A. Tsantilas}, title = {Asymptotically Tight Bounds for Computing with Faulty Arrays of Processors (Extended Abstract)}, booktitle = {31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume {I}}, pages = {285--296}, publisher = {{IEEE} Computer Society}, year = {1990}, url = {https://doi.org/10.1109/FSCS.1990.89547}, doi = {10.1109/FSCS.1990.89547}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/KaklamanisKLMRRTT90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/KleinARR90, author = {Philip N. Klein and Ajit Agrawal and R. Ravi and Satish Rao}, title = {Approximation through Multicommodity Flow}, booktitle = {31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume {II}}, pages = {726--737}, publisher = {{IEEE} Computer Society}, year = {1990}, url = {https://doi.org/10.1109/FSCS.1990.89595}, doi = {10.1109/FSCS.1990.89595}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/KleinARR90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KochLMRR89, author = {Richard R. Koch and Frank Thomson Leighton and Bruce M. Maggs and Satish Rao and Arnold L. Rosenberg}, editor = {David S. Johnson}, title = {Work-Preserving Emulations of Fixed-Connection Networks (Extended Abstract)}, booktitle = {Proceedings of the 21st Annual {ACM} Symposium on Theory of Computing, May 14-17, 1989, Seattle, Washington, {USA}}, pages = {227--240}, publisher = {{ACM}}, year = {1989}, url = {https://doi.org/10.1145/73007.73029}, doi = {10.1145/73007.73029}, timestamp = {Wed, 24 Nov 2021 12:15:31 +0100}, biburl = {https://dblp.org/rec/conf/stoc/KochLMRR89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/LeightonMR88, author = {Frank Thomson Leighton and Bruce M. Maggs and Satish Rao}, title = {Universal Packet Routing Algorithms (Extended Abstract)}, booktitle = {29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988}, pages = {256--269}, publisher = {{IEEE} Computer Society}, year = {1988}, url = {https://doi.org/10.1109/SFCS.1988.21942}, doi = {10.1109/SFCS.1988.21942}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/LeightonMR88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/LeightonR88, author = {Frank Thomson Leighton and Satish Rao}, title = {An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms}, booktitle = {29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988}, pages = {422--431}, publisher = {{IEEE} Computer Society}, year = {1988}, url = {https://doi.org/10.1109/SFCS.1988.21958}, doi = {10.1109/SFCS.1988.21958}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/LeightonR88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/Rao87, author = {Satish Rao}, title = {Finding Near Optimal Separators in Planar Graphs}, booktitle = {28th Annual Symposium on Foundations of Computer Science, Los Angeles, California, USA, 27-29 October 1987}, pages = {225--237}, publisher = {{IEEE} Computer Society}, year = {1987}, url = {https://doi.org/10.1109/SFCS.1987.26}, doi = {10.1109/SFCS.1987.26}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/Rao87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.