CS 2003-2004 Faculty Information - Department of Computer ...

44
CS 2003-2004 Faculty Information
ly working on compressed indexes for long sequences of symbols, such as text. A recent theoretical breakthrough he
worked on shows how to fully compress text and make it self-indexing at the same time. Experiments have proven the
technique to be quite practical.
Honors & Awards: Fellow, John Simon Guggenheim Foundation, 1986; Fellow, Institute of Electrical and Electronics
Engineers (IEEE), 1993; Fellow, Association for Computing Machinery (ACM), 1996; National Science Foundation
Presidential Young Investigator Award 1985; Fulbright Scholar, 1998; Recognition of Service Award, ACM, 1998
and 2001.
Selected Publications:
L. Lim, M. Wang, and J. S. Vitter, “SASH: A Self-Adaptive Histogram Set for Dynamically Changing Workloads,”
Proceedings of the 29th International Conference on Very Large Data Bases (VLDB 2003), Berlin, Germany,
September 2003.
D. T. Hoang and J. S. Vitter, “Efficient Algorithms for MPEG Video Compression,” John Wiley & Sons,
New York, NY, 2002.
R. Grossi, A. Gupta, and J. S. Vitter, “High-Order Entropy-Compressed Text Indexes,” Proceedings of the 14th Annual
SIAM/ACM Symposium on Discrete Algorithms (SODA 2003), Baltimore, MD, January 2003.
Samuel S. Wagstaff, Jr.
Education:
BS, Massachusetts Institute of Technology, 1966
PhD, Cornell University, 1970
Position:
Professor of Computer Science
Bio-sketch:
Before coming to Purdue, Professor Wagstaff taught at the Universities of Rochester, Illinois, and Georgia. He spent a
year at the Institute for Advanced Study in Princeton. His research interests are in the areas of cryptography, parallel
computation, and analysis of algorithms, especially number theoretic algorithms. He and J. W. Smith of the University
of Georgia have built a special processor with parallel capability for factoring large integers. He is the author of
Factorizations of bn ± 1, b = 2, 3, 5, 6, 7, 10, 11, 12 up to high powers, Contemporary Mathematics series, v. 22, Third
edition, American Mathematical Society, 2002 (with John Brillhart, D. H. Lehmer, J. L. Selfridge and Bryant Tuckerman)
(See http://www.ams.org/online_bks/conm22) and Cryptanalysis of Number Theoretic Ciphers, CRC Press, 2002.
Selected Publications:
Samuel S. Wagstaff, “Prime numbers with a fixed number of one bits or zero bits in their binary representation,”
Experimental Mathematics, Volume 10 (2001), pp. 267-273.
Samuel S. Wagstaff, “Prime divisors of the Bernoulli and Euler numbers,” Proceedings of the Millennial Conference on
Number Theory, Urbana, Illinois, May 21-26, 2000, M. A. Bennett, B. C. Berndt, N. Boston, H. G. Diamond, A. J.
Hildebrand, W. Philipp, eds.