Publications
A Model-Based Approach for Analysis of Spatial Structure in Genetic Data.
Nature Genetics. 44, 725-731.
(2012). A Model and Proof Technique for Message-Based Systems.
9(4), 768-784.
(1980). Mobility-Aware Mesh Construction Algorithm for Low Data-Overhead Multicast Ad Hoc Routing.
6(4), 331-342.
(2004). On Mixing and Edge Expansion Properties in Randomized Broadcasting.
Algorithmica. 56(1), 51-88.
(2010). miRNAkey: A Software for microRNA Deep Sequencing Analysis.
Bioinformatics. 26(20), 2615-2616.
(2010). The Minimum-Entropy Set Cover Problem.
Theoretical Computer Science. 348(2), 240-250.
(2005). A Method for Obtaining Randomized Algorithms with Small Tail Probabilities.
Algorithmica. 16(4-5), 543-547.
(1996). Mesos: Flexible Resource Sharing for the Cloud.
USENIX ;login:. 36(4), 37-45.
(2011). Meibography Phenotyping and Classification From Unsupervised Discriminative Feature Learning.
Translational Vision Science and Technology. 10(4),
(2021). Mechanism Design for Policy Routing.
Distributed Computing. 18, 11-20.
(2006).
(2019). Measuring the Evolution of Transport Protocols in the Internet.
ACM Computer Communication Review. 35(2), 37-52.
(2005). A Measurement-Based Admission Control Algorithm for Integrated Services Packet Network.
IEEE/ACM Transactions on Networking. 5(1), 56-70.
(1997). Maximizing Power in Association Studies.
Nature Biotechnology. 27(3), 255-256.
(2009). Maximal Source Coverage Adaptive Gateway Discovery for Hybrid Ad Hoc Networks.
Lecture Notes in Computer Science. 3158, 28-41.
(2004). Massively Parallel Computational Models.
Quantitative Analyses of Behavior. 8,
(1989). Mapping the Similarities of Spectra: Global and Locally-biased Approaches to SDSS Galaxy Data.
The Astrophysical Journal.
(2016).
(2002). Making Greed Work in Networks: A Game-Theoretic Analysis of Switch Service Disciplines.
IEEE/ACM Transactions on Networking. 3(6), 819-831.
(1995). Machine Learning with Interdependent and Non-identically Distributed Data (Dagstuhl Seminar 15152).
Dagstuhl Reports. 5, 18–55.
(2015). LSAR: Efficient Leverage Score Sampling Algorithm for the Analysis of Big Time Series Data.
Journal of Machine Learning Research. 23, 1-36.
(2022). Long Story Short - Global Unsupervised Models for Keyphrase Based Meeting Summarization.
Speech Communication. 52(10), 801-815.
(2010). LogP: towards a realistic model of parallel computation.
SIGPLAN Notices. 28,
(1993). LogP: A Practical Model of Parallel Computation.
Communications of the ACM. 39(11), 78-85.
(1996). Liquid Cloud Storage.
ACM Transactions on Storage. 15(1),
(2019).