Publications
Network Text Editor (NTE): A scalable shared text editor for the MBone.
Proceedings of the Annual Conference of the Association for Computing Machinery's Special Interest Group on Data Communication (ACM SIGCOMM '97).
(1997).
(1998).
(2000).
(1997). Session Directories and Scalable Internet Multicast Address Allocation.
Proceedings of the Annual Conference of the Association for Computing Machinery's Special Interest Group on Data Communication (ACM SIGCOMM 98).
(1998).
(2002).
(1997). Do You Get What You Pay For? Comparing The Privacy Behaviors of Free vs. Paid Apps.
Proceedings of the Workshop on Technology and Consumer Protection (ConPro 2019).
(2019). The Price is (Not) Right: Comparing Privacy in Free and Paid Apps.
2020(3), 222-242.
(2020).
(2008).
(1989).
(1989).
(1997).
(2012). The Minimum-Entropy Set Cover Problem.
Proceedings of ICALP.
(2004). Tag SNP Selection in Genotype Data for Maximizing SNP Prediction Accuracy.
Proceedings of the 13th Annual International Conference on Intelligent Systems for Molecular Biology (ISMB 2005). 195-203.
(2005). Haplofreq - Estimating Haplotype Frequencies Efficiently.
Proceedings of the 9th Annual International Conference on Research in Computational Molecular Biology (RECOMB'05). 553-568.
(2005). The Minimum-Entropy Set Cover Problem.
Theoretical Computer Science. 348(2), 240-250.
(2005). Maximizing Power in Association Studies.
Nature Biotechnology. 27(3), 255-256.
(2009).
(2002). Perfect Phylogeny and Haplotype Assignment.
Proceedings of RECOMB.
(2004).
(2004). Estimating Haplotype Frequencies Efficiently.
Proceedings of the 9th Annual International Conference on Research in Computational Molecular Biology (RECOMB'05). 553-568.
(2005). Polylogarithmic Inapproximability.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC).
(2003). Integrality Ratio for Group Steiner Trees and Directed Steiner Trees.
Proceedings of the Twelfth Symposium on Discrete Algorithms (SODA).
(2003).