GIORA SLUTZKI GIORA SLUTZKI (slutzki@cs.iastate.edu)

Professor of Computer Science

Major Interests: Combinatorial algorithms, computational complexity, formal languages, automata theory, relational data base theory, logic programming.

Current Research: Dr. Slutzki is currently working on parametric problems on graphs, approximation algorithms, and graph products. He also works on some theoretical issues in logic programming.

Representative Publications:

"A Hierarchy of Deterministic Top-down Tree Transformations" (with S. Vagvolgyi). Proceedings of the 9th International Conference on Fundamentals of Computation Theory (FCT '93), August 1993, Szeged, Hungary, Springer Verlag, LNCS 710, pp. 440-451 to appear in Mathematical Systems Theory.

"Fast Algorithms for Inferring Evolutionary Trees" (with R. Agarwala and D. Fernandez-Baca). 30th Annual Allerton Conference on Communication, Control, and Computing, September, 1992, Monticello, IL, USA; Proceedings, pp. 594-603 to appear in Journal of Mathematical Biology.

"Optimal Parametric Search on Graphs of Bounded Tree-width" (with D. Fernandez-Baca). Proceedings of the 4th Scandinavian Workshop on Algorithm Theory (SWAT '94), July 1994, Aarhus, Denmark, Springer Verlag, LNCS 824, pp. 155-166.

"Negation as Partial Failure" (with B. Mobasher, D. Pigozzi, and J. Leszczylowski). Proceedings of the 2nd International Workshop on Logic Programming and Non- monotonic Reasoning (LPNMR '93), June 1993, Lisbon, Portugal, MIT Press, pp. 244-262.

$Header: slutzki.html,v 1.1 95/09/12 10:02:55 root Exp $