my-recent.bib

@article{MST1,
  author = {Kamalika Chaudhuri and
               Satish Rao and
               Samantha 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},
  year = {2009},
  pages = {4489-4503},
  url = {http://dx.doi.org/10.1016/j.tcs.2009.07.029},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
@article{ML1,
  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 Performance Evaluation Review},
  volume = {37},
  number = {2},
  year = {2009},
  pages = {73-74},
  url = {http://doi.acm.org/10.1145/1639562.1639592},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
@article{MST2,
  author = {Kamalika Chaudhuri and
               Satish Rao and
               Samantha Riesenfeld and
               Kunal Talwar},
  title = {What Would Edmonds Do? Augmenting Paths and Witnesses for
               Degree-Bounded MSTs},
  journal = {Algorithmica},
  volume = {55},
  number = {1},
  year = {2009},
  pages = {157-189},
  url = {http://dx.doi.org/10.1007/s00453-007-9115-5},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
@article{BL,
  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},
  year = {2010},
  url = {http://doi.acm.org/10.1145/1706591.1706593},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
@article{Q,
  author = {Sagi Snir and
               Satish Rao},
  title = {Quartets MaxCut: A Divide and Conquer Quartets Algorithm},
  journal = {IEEE/ACM Trans. Comput. Biology Bioinform.},
  volume = {7},
  number = {4},
  year = {2010},
  pages = {704-718},
  url = {http://dx.doi.org/10.1109/TCBB.2008.133},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
@article{Zhou,
  author = {Satish Rao and
               Shuheng Zhou},
  title = {Edge Disjoint Paths in Moderately Connected Graphs},
  journal = {SIAM J. Comput.},
  volume = {39},
  number = {5},
  year = {2010},
  pages = {1856-1887},
  url = {http://dx.doi.org/10.1137/080715093},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
@article{ML2,
  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},
  title = {Near-Optimal Evasion of Convex-Inducing Classifiers},
  journal = {Journal of Machine Learning Research - Proceedings Track},
  volume = {9},
  year = {2010},
  pages = {549-556},
  url = {http://www.jmlr.org/proceedings/papers/v9/nelson10a.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
@inproceedings{ML3,
  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 = {ANTIDOTE: understanding and defending against poisoning
               of anomaly detectors},
  booktitle = {Internet Measurement Conference},
  year = {2009},
  pages = {1-14},
  url = {http://doi.acm.org/10.1145/1644893.1644895},
  crossref = {DBLP:conf/imc/2009},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
@article{vertex,
  author = {Moses Charikar and
               Mohammad Taghi Hajiaghayi and
               Howard J. Karloff and
               Satish Rao},
  title = {$\ell_2^2$ Spreading Metrics for
               Vertex Ordering Problems},
  journal = {Algorithmica},
  volume = {56},
  number = {4},
  year = {2010},
  pages = {577-604},
  url = {http://dx.doi.org/10.1007/s00453-008-9191-1},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/imc/2009,
  editor = {Anja Feldmann and
               Laurent Mathy},
  title = {Proceedings of the 9th ACM SIGCOMM Conference on Internet
               Measurement 2009, Chicago, Illinois, USA, November 4-6,
               2009},
  booktitle = {Internet Measurement Conference},
  publisher = {ACM},
  year = {2009},
  isbn = {978-1-60558-771-4},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/stoc/2012,
  editor = {Howard J. Karloff and
               Toniann Pitassi},
  title = {Proceedings of the 44th Symposium on Theory of Computing
               Conference, STOC 2012, New York, NY, USA, May 19 - 22, 2012},
  booktitle = {STOC},
  publisher = {ACM},
  year = {2012},
  isbn = {978-1-4503-1245-5},
  url = {http://dl.acm.org/citation.cfm?id=2213977},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

This file was generated by bibtex2html 1.95.