Peter A. Bloniarz Ph.D., MIT Associate Professor pb@cs.albany.edu    (Personal Page) Computer Science Department University at Albany Albany, NY 12222 (518) 591-8871 (518) 591-8878 (FAX)

Personal Statement of Research

My current research interests lie in two areas: information science, and software engineering. In the Center for Technology in Government, affiliated with the Ph.D. program in Information Science, we are exploring, developing, testing, and evaluating systems to demonstrate technology applications in the public sector. In particular, the Center's mission is to explore specific information management problems in government organizations, measure the impact of proposed changes to existing policies and practices, and assess the effect of technology on the organization and its people. In software engineering, I am interested in the expressive power of computer languages in modeling objects and relationships between objects. My particular interest in this area is to explore design and implementation methodologies centered around "roles" or "relationships" between entities, as well as developing varieties of collection classes. I am also interested in computational complexity, particularly of combinatorial problems. I have previously worked on the expected-case analysis of graph algorithms, the complexity of algebraic systems, and other combinatorial problems. These areas are still of interest to me, although I am not currently pursuing research in these areas.

Selected Publications

"An OMEGA ( n logn) Lower Bound for Decomposing a Set of Points into Chains," with S. S. Ravi, Information Processing Letters, vol. 31, no. 6 (June 1989), pp. 319 - 322.

"On the Computational Complexity of Algebra on Lattices," with H. B. Hunt, III and D. J. Rosenkrantz, SIAM Journal on Computing, vol. 16, no. 1 (February 1987), pp. 129 - 148.

"Algebraic Structures with Hard Equivalence and Minimization Problems," with H. B. Hunt, III and D. J. Rosenkrantz, J. Assoc. Comput. Mach., vol. 31, no. 4 (October 1984), pp. 879 - 904.

"A Shortest-Path Algorithm with Expected Time O(n^2 logn (log n)^*)," SIAM Journal on Computing, vol. 12, no. 3 (August 1983), pp. 588 - 600.