Publications
2011. Fast solvers for models of ICEO microfluidic flows. International Journal for Numerical Methods in Fluids. 65(4):383-404.
1988. Fast string matching with k differences* 1,* 2. Journal of Computer and System Sciences. 37(1):63-78.
2012. Fast track article: Disaggregated water sensing from a single, pressure-based sensor: An extended analysis of HydroSense using staged experiments. Pervasive Mob. Comput.. 8(1):82-102.
2003. Fast two-frame multiscale dense optical flow estimation using discrete wavelet filters. Journal of the Optical Society of America AJ. Opt. Soc. Am. A. 20(8):1505-1515.
2009. A Fast, Virtualized Data Plane for the NetFPGA. NetFPGA Developers Workshop, Stanford, California. :90-94.
1989. Faster optimal parallel prefix sums and list ranking. Information and Computation. 81(3):334-352.
1996. Feature discovery and classification of Doppler umbilical artery blood flow velocity waveforms. Computers in Biology and Medicine. 26(6):451-462.
2006. A feature generation algorithm for sequences with application to splice-site prediction. Knowledge Discovery in Databases: PKDD 2006. :553-560.
2008. A Feature Generation Algorithm with Applications to Biological Sequence Classification. Computational Methods. :355-355.
2001. A feature-based approach to automated design of multi-piece sacrificial molds. Journal of Computing and Information Science in Engineering. 1:225-225.
2007. Features generated for computational splice-site prediction correspond to functional elements. BMC Bioinformatics. 8(1):410-410.
2004. Few amino acid positions in ıt rpoB are associated with most of the rifampin resistance in ıt Mycobacterium tuberculosis. BMC Bioinformatics. 5:137-137.
2008. Figaro: A Novel Statistical Method for Vector Sequence Removal. Bioinformatics. 24(4):462-467.
1982. Fighting for the User.. Bulletin of the American Society for Information ScienceBulletin of the American Society for Information Science. 9(2):27-29.
2006. Find that photo!: interface strategies to annotate, browse, and share. Communications of the ACM - Supporting exploratory search. 49(4):69-71.
1988. On finding a minimum dominating set in a tournament. Theoretical Computer Science. 61(2-3):307-316.
1990. Finding all nearest neighbors for convex polygons in parallel: a new lower bound technique and a matching algorithm. Discrete Applied Mathematics. 29(1):97-111.
2009. Finding Biologically Accurate Clusterings in Hierarchical Decompositions Using the Variation of Information. Lecture Notes in Computer Science: Research in Computational Molecular Biology. 5541:400-417.
2010. Finding Biologically Accurate Clusterings in Hierarchical Tree Decompositions Using the Variation of Information. Journal of Computational Biology. 17(3):503-516.