Publications

^*These authors contributed equally to this work. For publications in theoretical computer science, author order is alphabetical and has no significance.
^† In computer science, full papers are typically submitted to conferences for peer review; authors may submit refined or extended versions to journals.

• Smith RP^*, Riesenfeld SJ^*, Holloway AK, Murphy KK, Feliciano NM, Orecchia L, Li Q, Pollard KS, Ahituv A. An in Vivo Screen of All 6-mers Reveals Drivers of Tissue-Specific Expression and Guides Synthetic Enhancer Design. In prep.
• Riesenfeld SJ, Pollard KS. Quantification of Error in Gene-Family Phylogenies of Shotgun Metagenomic Reads Supports Their Use in Community Analysis. In prep.
• Sharpton TJ, Riesenfeld SJ, Kembel SW, Ladau J, O'Dwyer JP, Green JL, Eisen JA, Pollard KS. PHYLOTU: A High-Throughput Procedure Quanitifies Microbial Community Diversity and Resolves Novel Taxa from Metagenomic Data. PLoS Computational Biology, 7(1): e1001061. doi:10.1371/journal.pcbi.1001061
• Capra JA, Carbone L, Riesenfeld SJ, Wall JD (2010). Genomics Through the Lens of Next-Generation Sequencing. Genome Biology, 11:306.
• Daskalakis C^*, Karp RM^*, Mossel E^*, Riesenfeld S^*, Verbin E^* (2009). Sorting and Selection in Posets. SIAM Journal on Computing, 40(3): 597–622.
  Earlier version (2009)^†: Proc. 20th Annual ACM-SIAM Symp. Discrete Algorithms, 392–401.
  Highlighted on the well-regarded blog Computational Complexity.
• Chaudhuri K^*, Rao S^*, Riesenfeld S^*, Talwar K^* (2009). A Push-Relabel Algorithm for Approximating the Minimum-Degree MST Problem and Its Generalization to Matroids. Theoretical Computer Science, 410(44): 4489–4503. Invited submission.
• Chaudhuri K^*, Rao S^*, Riesenfeld S^*, Talwar K^* (2009). What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs. Algorithmica, 55(1): 157–189. Invited submission.
  Earlier version (2005)^†: Proc. 8th Intl. Workshop on Approximation Algorithms for Combinatorial Optimization Problems, 26–39.
• Riesenfeld, S (2008). Optimization and Reconstruction over Graphs. Ph.D. Thesis, Electrical Engineering and Computer Sciences Dept, U.C. Berkeley, CA. 150p. Technical Report No. UCB/EECS-2008-6.
• Chaudhuri K^*, Rao S^*, Riesenfeld S^*, Talwar K^* (2006)^†. A Push-Relabel Algorithm for Approximating Degree Bounded MSTs. Proc. 33rd Intl. Colloq. on Automata, Languages, and Programming, 191–201.
• Bogdanov A^*, Maneva E^*, Riesenfeld S^* (2004)^†. Power-Aware Base Station Positioning for Sensor Networks. Proc. INFOCOM 23rd Annual Joint Conf. of IEEE Computer and Communications Societies, 1:575–585.