Journal Articles and Book Chapters:

• A. L. Delcher and S. Kasif. Some results on the complexity of exploiting data dependency in parallel logic programs. Journal of Logic Programming, 6(3):229--241, May 1989.
  
• A. L. Delcher and S. Kasif. Efficient parallel term matching and anti-unification. Journal of Automated Reasoning, 9:391--406, 1992.
  
• S. Kasif, S. Banerjee, A. L. Delcher, and G. Sullivan. Some results on the complexity of symmetric connectionist networks. Annals of Mathematics and Artificial Intelligence, 9:327--344, 1993.
  
• S. Kasif and A. L. Delcher. Local consistency in parallel constraint satisfaction networks. Artificial Intelligence, 69:307--327, 1994.
  
• A. L. Delcher, editor. Waterfields Guide to Computer Terms. Waterfields Press, 1995.
  
• S. Kasif and A. L. Delcher. Local consistency in parallel constraint-satisfaction networks. In V. Saraswat and P. Van Hentenryck, editors, Principles and Practice of Constraint Programming, chapter 18, pages 337--360. MIT Press, 1995.
  
• A. L. Delcher and S. R. Kosaraju. An NC algorithm for evaluating monotone planar circuits. SIAM Journal on Computing, 24(2):369--375, April 1995.
  
• S. Salzberg, D. Heath, A. L. Delcher, and S. Kasif. Best-case results for nearest-neighbor learning. IEEE Transactions on Pattern Matching and Machine Intelligence, 17(6):599--608, June 1995.
  
• A. L. Delcher and S. Kasif. Term matching on a mesh-connected parallel computer. Annals of Mathematics and Artificial Intelligence, 15:177--186, 1995.
  
• S. L. Salzberg, A. L. Delcher, S. Kasif, and O. White. Microbial gene identification using interpolated Markov models. Nucleic Acids Research, ?:???--???, 1997. To appear.
  
• S. Kasif and A. L. Delcher. Modeling biological data and structure with probabilistic networks. In Computational Biology: Pattern Analysis and Machine Learning Methods. Elsevier, 1997. In press.

Conference Proceedings:

• A. L. Delcher and S. Kasif. On the complexity of incremental computations in artificial intelligence. In Proceedings of the Workshop on Computer Architectures for Pattern Analysis and Machine Intelligence, pages 59--64, 1987.
  
• S. R. Kosaraju and A. L. Delcher. Optimal parallel evaluation of tree-structured computations by raking. In J. Reif, editor, VLSI Algorithms and Architectures: Proceedings of 1988 Aegean Workshop on Computing, pages 101--110. Springer-Verlag, 1988. LNCS 319.
  
• A. L. Delcher and S. Kasif. Term matching on a mesh-connected parallel computer. In Proceedings of the 5th Israeli Symposium on Artificial Intelligence, Vision and Pattern Recognition, pages 441--452, 1989.
  
• A. L. Delcher and S. Kasif. Efficient parallel term matching and anti-unification. In D. H. D. Warren and P. Szeredi, editors, Logic Programming: Proceedings of the Seventh International Conference and Symposium, pages 355--369. MIT Press, June 1990.
  
• S. R. Kosaraju and A. L. Delcher. A tree-partitioning technique with applications to expression evaluation and term matching. In Proceedings of the 31st Annual Symposium on Foundations of Computer Science, pages 163--72, October 1990.
  
• S. Kasif and A. L. Delcher. Analysis of local consistency in constraint-satisfaction networks. In Proceedings of the AAAI Symposium on Constraint-Based Reasoning, pages 154--163, 1991.
  
• S. Salzberg, D. Heath, A. L. Delcher, and S. Kasif. Learning with a helpful teacher. In Proceedings of the 12th International Joint Conference on Artificial Intelligence, pages 705--11, Sydney, Australia, August 1991.
  
• A. L. Delcher and S. Kasif. Improved decision-making in game trees: Recovering from pathology. In Proceedings of the 10th National Conference on Artificial Intelligence, pages 513--518, San Jose, July 1992.
  
• A. L. Delcher and S. Kasif. Probabilistic prediction of protein secondary structure using causal networks. In Proceedings of the 11th National Conference on Artificial Intelligence, pages 316--321, Washington, DC, July 1993.
  
• A. L. Delcher, S. Kasif, H. R. Goldberg, and W. H. Hsu. Protein secondary structure modelling with probabilistic networks. In Proceedings of the First International Conference on Intelligent Systems for Molecular Biology, pages 109--117, Bethesda, MD, July 1993.
  
• S. R. Kosaraju and A. L. Delcher. Large-scale assembly of DNA strings and space-efficient construction of suffix trees. In Proceedings of the 27th ACM Symposium on the Theory of Computing, 1995.
  
• A. L. Delcher, A. Grove, S. Kasif, and J. Pearl. Logarithmic-time queries and updates in probabilistic networks. In Proceedings of the Workshop on Uncertainty in Artificial Intelligence, 1995.
  
• S. L. Salzberg, A. L. Delcher, S. Kasif, and O. White. Interpolated Markov models for microbial sequence analysis. In Proceedings of the 1st Annual Conference on Computational Genomics, Herndon, Virginia, November 1997.
  

Theses:

• A. L. Delcher. The complexity of exploiting data-dependency in parallel logic programs. Master's thesis, The Johns Hopkins University, 1987.
  
• A. L. Delcher. Complexity Issues in Parallel Logic Programming. PhD thesis, The Johns Hopkins University, 1989.
  

Technical Reports:

• A. L. Delcher. Evaluation of DOT/ANISN coupling methodology code (DACM). Technical report, Ballistics Research Laboratory, 1985.
  
• A. L. Delcher and S. Kasif. Some results on the complexity of exploiting data dependency in parallel logic programs. Technical Report JHU/CS-87/3, The Johns Hopkins University, November 1987.
  
• A. L. Delcher and S. Kasif. Efficient parallel term matching. Technical Report JHU/CS-88/7, The Johns Hopkins University, January 1988.
  
• A. L. Delcher and S. Kasif. On the complexity of incremental parallel computations. Technical Report JHU/CS-88/8, The Johns Hopkins University, January 1988.
  
• S. Banerjee, A. L. Delcher, S. Kasif, and G. Sullivan. Some results on the computational complexity of symmetric connectionist networks. Technical Report JHU/CS-89/10, The Johns Hopkins University, November 1989.
  
• S. Salzberg, D. Heath, A. L. Delcher, and S. Kasif. Learning with a helpful teacher. Technical Report JHU/CS-90/14, The Johns Hopkins University, 1990.
  
• S. Salzberg, A. L. Delcher, K. Fasman, and J. Henderson. A decision tree system for finding genes in DNA. Technical Report 1997-03, Department of Computer Science, The Johns Hopkins University, 1997.