Publications
2012. BEAGLE: An Application Programming Interface and High-Performance Computing Library for Statistical Phylogenetics. Systematic BiologySyst Biol. 61(1):170-173.
2011. Maximum bipartite flow in networks with adaptive channel width. Theoretical Computer Science. 412(24):2577-2587.
1987. Tight comparison bounds on the complexity of parallel sorting. SIAM J. Comput.. 16(3):458-464.
1982. Isomorphism of graphs with bounded eigenvalue multiplicity. Proceedings of the fourteenth annual ACM symposium on Theory of computing. :310-324.
1989. Some aspects of parallel implementation of the finite-element method on message passing architectures. Journal of Computational and Applied Mathematics. 27(1-2):157-187.
2005. Unsupervised learning applied to progressive compression of time-dependent geometry. Computers & Graphics. 29(3):451-461.
2009. Identifying close friends on the internet. Proc. of workshop on Hot Topics in Networks (HotNets-VIII).
2009. Persona: an online social network with user-defined privacy. Proceedings of the ACM SIGCOMM 2009 conference on Data communication. :135-146.
2007. A Secure DHT via the Pigeonhole Principle. Technical Reports of the Computer Science Department, CS-TR-4884.
1996. Parallel algorithms for image enhancement and segmentation by region growing, with an experimental study. The Journal of Supercomputing. 10(2):141-168.
1996. Practical parallel algorithms for dynamic data redistribution, median finding, and selection. Parallel Processing Symposium, 1996., Proceedings of IPPS '96, The 10th International. :292-301.
1999. Simple: A Methodology for Programming High Performance Algorithms on Clusters of Symmetric Multiprocessors (SMPs). Journal of Parallel and Distributed Computing. 58(1):92-108.
1995. Parallel algorithms for image histogramming and connected components with an experimental study (extended abstract). ACM SIGPLAN Notices. 30(8):123-133.
1995. Scalable data parallel algorithms for texture synthesis using Gibbs random fields. Image Processing, IEEE Transactions on. 4(10):1456-1460.
1998. Parallel Algorithms for Image Histogramming and Connected Components with an Experimental Study. UMIACS-TR-94-133
1996. Practical parallel algorithms for personalized communication and integer sorting. Journal of Experimental Algorithmics (JEA). 1
1998. Scalable Data Parallel Algorithms for Texture Synthesis and Compression using Gibbs Random Fields. UMIACS-TR-93-80
2004. Low-dimensional embedding with extra information. Proceedings of the twentieth annual symposium on Computational geometry. :320-329.
2004. Visualization and analysis of microarray and gene ontology data with treemaps. BMC Bioinformatics. 5(1):84-84.
2004. A Note on Efficient Computation of Haplotypes via Perfect Phylogeny. Journal of Computational Biology. 11(5):858-866.
2000. Retrieval scheduling for collaborative multimedia presentations. Multimedia Systems. 8(2):146-155.
1997. Algorithm 776: SRRIT: a Fortran subroutine to calculate the dominant invariant subspace of a nonsymmetric matrix. ACM Trans. Math. Softw.. 23(4):494-513.