TEMPLATE

Leaders in Learning: Publications of Faculty & Staff

Computer Science: 1999-2000

ANDREWS, J.

Andrews, J., and H. Lutfiyya. 2000. Experience Report: A Software Maintenance Project Course. Thirteenth Conference on Software Engineering Education & Training. Austin, Texas: 6 March 2000-8 March 2000. S.A. Mengel, and P.J. Knoke. New Jersey: The Institute of Electrical and Electronics Engineers (IEEE). 132-139.

Andrews, J., and Y. Zhang. 2000. Broad-Spectrum Studies of Log File Analysis. ICSE 2000: 22nd International Conference on Software Engineering. Limerick, Ireland: 4 June 2000-11 June 2000. University of Limerick. 105-114.

CORLESS, R.

Corless, R., M.W. Giesbrecht, D. Jeffrey, and S. Watt. 1999. Approximate Polymonial Decomposition. Proceedings of ISSAC'99: ACM International Symposium on Symbolic and Algebraic Computation. 213-219.

Corless, R., M.W. Giesbrecht, I. Kotsireas, and S. Watt. 2000. Numerical implicitization of parametric hypersurfaces with linear algebra. A.I.S.C. 2000 Proceedings. Madrid, Spain: LNAI. 1-10.

EL-SAKKA, M.R.

El-Sakka, M.R., and M.S. Kamel. 1999. Adaptive Image Compression Based on Segmentation and Block Classification. International Journal of Imaging Systems and Technology 10: 33-49.

Wanas, N.M., M.R. El-Sakka, and M.S. Kamel. 2000. Enhancement of Vessel Contours in Retinal Angiograms. IEEE Canadian Conference on Electrical and Computer Engineering (CCECE'2000), Volume 2. Halifax, NS: May 2000. 908-912.

Wanas, N., M.R. El-Sakka, and M.S. Kamel. 1999. Multiple Classifier Hierarchical Architecture for Handwritten Arabic Character Recognition. IJCNN'99: International Joint Conference on Neural Networks, Volume 4. Washington, DC: July 1999. 2834-2838.

GARGANTINI, I.

Gargantini, I. 2000. Volume Visualization. Encyclopedia of Library and Information Science. A. Kent, and C. Hall. New York, NY: Marcel Dekker. 347-358.

GIESBRECHT, M.W.

Corless, R., M.W. Giesbrecht, I. Kotsireas, and S. Watt. 2000. Numerical implicitization of parametric hypersurfaces with linear algebra. A.I.S.C. 2000 Proceedings. Madrid, Spain: LNAI. 1-10.

Eberly, W., and M.W. Giesbrecht. 2000. Efficient Decomposition of Associative Algebras over Finite Fields. Journal of Symbolic Computation 29: 441-458.

KARI, L.

Daley, M., L. Kari, G. Gloor, and R. Siromoney. 1999. Circular Contextual Insertion/deletions with Applications to Biomolecular Computation. SPIRE '99: 6th International Symposium on String Processing and Information Retrieval. Cancun, Mexico: 22 September 1999-24 September 1999. F.M. Titsworth. Los Alamitos, CA: IEEE Computer Society. 47-54.

Gloor, G., L. Kari, M. Gaasenbeek, and S. Yu. 1999. Towards a DNA Solution to the Shortest Common Superstring Problem. International Journal of Artificial Intelligence Tools 8 (4): 385-400.

Kari, L., M. Daley, G. Gloor, R. Siromoney, and L.F. Landweber. 1999. How to Compute with DNA. Foundations of Software Technology and Theoretical Computer Science, 19th Conference. Chennai, India: 13 December 1999-15 December 1999. C. Pandu Rangan, V. Raman, and R. Ramanujam. Berlin, Germany: Springer-Verlag. 269-282.

Kari, L., G. Gloor, and S. Yu. 2000. Using DNA to solve the Bounded Post Correspondence Problem. Theoretical Computer Science 231: 193-203.

Kari, L., J. Kari, and L.F. Landweber. 1999. Reversible Molecular Computation in Ciliates. Jewels are Forever: Contributions on Theoretical Computer Science in Honor of Arto Salomaa. J. Karhumaki, H. Maurer, G. Paun, and G. Rozenberg. New York, NY: Springer. 353-363.

Kari, L., and L.F. Landweber. 2000. Computing with DNA (Chapter 23). Bioinformatics: Methods and Protocols. S. Misener, and S.A. Krawetz. Totowa, New Jersey: Humana Press. 413-431.

Kari, L., and L.F. Landweber. 1999. L'ordinateur biologique, pour demain? Les Cahiers de Science & Vie. A.D. Dalmedico. Paris: Excelsior Publications. 88-93.

Kari, L., H. Rubin, and D.H. Wood. (Guest Editors). 1999. Biosystems. 52 (1-3). 1-246 pp. Special Issue: Proceedings of the Fourth International Meeting on DNA Based Computers.

Landweber, L.F., and L. Kari. 1999. The evolution of cellular computing: Nature's solution to a computational problem. Biosystems 52 (1-3): 3-13.

KOTSIREAS, I.

Corless, R., M.W. Giesbrecht, I. Kotsireas, and S. Watt. 2000. Numerical implicitization of parametric hypersurfaces with linear algebra. A.I.S.C. 2000 Proceedings. Madrid, Spain: LNAI. 1-10.

LUTFIYYA, H.

OSBORN, S.L.

Gittens, C.L., and S.L. Osborn. 2000. Database Integration using Graph Transformation. GRATRA 2000: Joint Appligraph and Getgrats Workshop on Graph Transformation Systems. Berlin, Germany: 25 March 2000-27 March 2000. H. Ehirg, and G. Taentzer. Technische Universitat Berlin. 96-105.

Osborn, S.L. 1999. Integrating Security System Using Role-based Access Control. Computing Engineering 25 (October): 42-47. Special Issue: International Conference on Information Security, Shanghai, China.

PERRY, M.

Perry, M. 2000. Domain Names. Transnational Cyberspace Law. M. Ibusuki. Tokyo: Nihon Hyoron Sha. 79-85. Japanese text.

Perry, M. 2000. Literary Work or Mechanical Commonplace: The Headnote Takes on a New Look. European Intellectual Property Review 5 (May): 237-241.

SALOMAA, K.

Mateescu, A., K. Salomaa, and S. Yu. 2000. On Fairness of Many-Dimensional Trajectories. Journal of Automata, Languages and Combinatorics 5 (2): 145-157.

Salomaa, K., D. Wood, and S. Yu. 2000. Introduction. Theoretical Computer Science 231 (1): 1-3.

Salomaa, K., D. Wood, and S. Yu. (Guest Editors). 2000. Theoretical Computer Science. 231 (1).

Salomaa, K., X. Wu, and S. Yu. 2000. Efficient implementation of regular languages using reversed alternating finite automata. Theoretical Computer Science 231: 103-111.

Salomaa, K., and S. Yu. 2000. Alternating Finite Automata and Star-Free Languages. Theoretical Computer Science 234: 167-176.

Salomaa, K., and S. Yu. 1999. Synchronization expressions and languages. Journal of Universal Computer Science 5 (9): 610-621.

SOLIS-OBA, R.

Frederickson, G., and R. Solis-Oba. 1999. Increasing the Weight of Minimum Spanning Trees. Journal of Algorithms 33: 244-266.

Jansen, K., M. Mastrolilli, and R. Solis-Oba. 2000. Approximation Algorithms for Flexible Job Shop Problems. Latin 2000: Theoretical Informatics. 4th Latin American Symposium. Punta del Este, Uruguay: April 2000. G.H. Gonnet, D. Panario, and A. Viola. Lecture Notes in Computer Science, 1776. New York, NY: Springer. 68-77.

Jansen, K., R. Solis-Oba, and M. Sviridenko. 1999. A Linear Time Approximation Scheme for the Job Shop Scheduling Problem. Randomization, Approximation, and Combinatorial Optimization: Algorithms and Techniques. RANDOM-APPROX'99. Berkeley, CA: August 1999. D. Hochbaum, K. Jansen, J. Rolim, and A. Sinclair. Lecture Notes in Computer Science, 1671. New York, NY: Springer. 177-188.

Krysta, P., and R. Solis-Oba. 1999. Approximation Algoirthms for Bounded Facility Location. Computing and Combinatorics. 5th Annual Conference, COCOON'99. Tokyo, Japan: 26 July 1999-28 July 1999. T. Asano, H. Imai, D.T. Lee, S. Nakano, and T. Tokuyama. Lecture Notes in Computer Science, 1627. New York, NY: Springer. 241-250.

WATT, S.

Corless, R., M.W. Giesbrecht, I. Kotsireas, and S. Watt. 2000. Numerical implicitization of parametric hypersurfaces with linear algebra. A.I.S.C. 2000 Proceedings. Madrid, Spain: LNAI. 1-10.

WU, X.

Salomaa, K., X. Wu, and S. Yu. 2000. Efficient implementation of regular languages using reversed alternating finite automata. Theoretical Computer Science 231: 103-111.

YU, S.