Publications
2016. Modeling Sustainability: Population, Inequality, Consumption, and Bidirectional Coupling of the Earth and Human Systems. National Science Review. :nww081.
2001. Approximating large convolutions in digital images. Image Processing, IEEE Transactions on. 10(12):1826-1835.
1981. Sequence of U1 RNA from Drosophila melanogaster: implications for U1 secondary structure and possible involvement in splicing. Nucleic Acids ResearchNucl. Acids Res.. 9(23):6351-6368.
2002. Partitioning planar graphs with costs and weights. 4th International Workshop on Algorithm Engineering and Experiments. 2409:98-110.
1988. Globally-Equiangular triangulations of co-circular points in 0(n log n) time. Proceedings of the fourth annual symposium on Computational geometry. :143-152.
2007. A practical approximation algorithm for the LMS line estimator. Computational Statistics & Data Analysis. 51(5):2461-2486.
2000. Genomic Sequence, Splicing, and Gene Annotation. American Journal of Human GeneticsAm J Hum Genet. 67(4):788-792.
2001. Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses. Computational Geometry. 19(1):1-33.
1994. Computationally Efficient Algorithms for High-Dimensional Robust Estimators. CVGIP: Graphical Models and Image Processing. 56(4):289-303.
2002. Evidence for a Plastid Origin of Plant Ethylene Receptor Genes. Plant PhysiologyPlant Physiol.. 130(1):10-14.
1990. Packing and covering the plane with translates of a convex polygon. Journal of Algorithms. 11(4):564-580.
1983. The U1 small nuclear RNA-protein complex selectively binds a 5′ splice site in vitro. Cell. 33(2):509-518.
1987. Algorithms for covering and packing and applications to CAD/CAM (abstract only): preliminary results. Proceedings of the 15th annual conference on Computer Science. :439–-439–.
2006. Keep Your Friends Close and Your Enemies Closer: The Art of Proximity Searching. Proceedings of the eighth Workshop on Algorithm Engineering and Experiments and the third Workshop on Analytic Algorithmics and Combinatorics. 123:65-65.
1990. The number of shortest paths on the surface of a polyhedron. SIAM Journal on Computing. 19:593-593.