Publications

Atallah M, Vishkin U. 1984. Finding Euler tours in parallel* 1. Journal of Computer and System Sciences. 29(3):330-337.

Marchionini G, Shneiderman B. 1988. Finding facts vs. browsing knowledge in hypertext systems. Computer. 21(1):70-80.

Marchionini G, Shneiderman B. 1993. Finding facts vs. browsing knowledge in hypertext systems. Sparks of innovation in human-computer interaction. :103-103.

Ceaparu I, Shneiderman B. 2004. Finding governmental statistical data on the Web: A study of categorically organized links for the FedStats topics page. Journal of the American Society for Information Science and Technology. 55(11):1008-1015.

Ceaparu I, Shneiderman B. 2004. Finding Governmental Statistical Data on the Web: Three Empirical Studies of the FedStats Topics Page. Journal of the American Society for Information Science and Technology. 55:1008-1015.

Berkman O, Vishkin U. 1994. Finding level-ancestors in trees. Journal of Computer and System Sciences. 48(2):214-230.

Khuller S, Martinez V, Nau DS, Simari G, Sliva A, Subrahmanian V. 2007. Finding most probable worlds of probabilistic logic programs. Scalable Uncertainty Management. :45-59.

Shiloach Y, Vishkin U. 1981. Finding the maximum, merging, and sorting in a parallel computation model. Journal of Algorithms. 2(1):88-102.

Mahesh R, Rangan C.P, Srinivasan A. 1991. On finding the minimum bandwidth of interval graphs. Information and Computation. 95(2):218-224.

Varna AL, He S, Swaminathan A, M. Wu. 2009. Fingerprinting Compressed Multimedia Signals. Information Forensics and Security, IEEE Transactions on. 4(3):330-345.

Gou H, Wu M. 2005. Fingerprinting curves. Digital Watermarking. :13-28.

Gou H, Wu M. 2006. Fingerprinting digital elevation maps. Proceedings of SPIE. 6072:373-384.

Nagarajan N, Cook C, Di Bonaventura M P, Ge H, Richards A, Bishop-Lilly KA, DeSalle R, Read TD, Pop M. 2010. Finishing genomes with limited resources: lessons from an ensemble of microbial genomes. BMC Genomics. 11(1):242-242.

Brauer JR, Mayergoyz ID. 2004. Finite-element computation of nonlinear magnetic diffusion and its effects when coupled to electrical, mechanical, and hydraulic systems. Magnetics, IEEE Transactions on. 40(2):537-540.

Hale K, Keyser SJ, Hutchins WJ, Habash N, Dorr BJ, Traum D. 2005. Finite-State Language resources and Language Processing. Machine Translation. 18:381-382.

Balog K, de Vries AP, Serdyukov P, Wen J-R. 2012. The first international workshop on entity-oriented search (EOS). SIGIR Forum. 45(2):43-50.

Haibin G A, Agarwal G, Ling H, Jacobs DW, Shirdhonkar S, Kress JW, Russell R, Belhumeur P, Dixit A, Feiner S et al.. 2006. First Steps Toward an Electronic Field Guide for Plants. Taxon. 55:597-610.

Shneiderman B. 1993. First steps toward positive contributions. Communications of the ACM. 36(1):15-16.

Jordan PW, Dorr BJ, Benoit JW. 1993. A first-pass approach for evaluating machine translation systems. Machine Translation. 8(1):49-58.

Li Z, Duraiswami R. 2007. Flexible and Optimal Design of Spherical Microphone Arrays for Beamforming. Audio, Speech, and Language Processing, IEEE Transactions on. 15(2):702-714.

Jajodia S, Samarati P, Sapino M L, V.S. Subrahmanian. 2001. Flexible support for multiple access control policies. ACM Trans. Database Syst.. 26(2):214-260.

Khuller S, Naor J. 1994. Flow in planar graphs with vertex capacities. Algorithmica. 11(3):200-225.

Nassi I, Shneiderman B. 1973. Flowchart techniques for structured programming. ACM SIGPLAN Notices. 8(8):12-26.

Foster JS, Johnson R, Kodumal J, Aiken A. 2006. Flow-insensitive type qualifiers. ACM Transactions on Programming Languages and Systems (TOPLAS). 28(6):1035-1087.

Foster JS, Terauchi T, Aiken A. 2002. Flow-sensitive type qualifiers. ACM SIGPLAN Notices. 37(5):1-12.

Pages

Publications