Résumé - David Pokrass Jacobs


 

PERSONAL DATA

Professor of Computer Science
School of Computing
Clemson University
Clemson, SC 29634-0974
(864) 656-5872
dpj@clemson.edu
Born 27 October 1949 in Chicago, IL, USA
Citizenship: USA

EDUCATION

PROFESSIONAL EXPERIENCE

 Clemson University:
1999-present, Professor of Computer Science
1990-1999, Associate Professor of Computer Science
1986-1990, Assistant Professor of Computer Science

Universidade Federal do Rio Grande do Sul, Brazil:
1995, Visiting Professor, Instituto de Matemática

Motorola, Inc.:
1984-1986, Senior Staff, Cellular Division, Arlington Heights
1981-1984, Senior Software Instructor, Corporate Offices, Schaumburg

Lanier Business Products:
1979-1981, Software Engineer, Atlanta

Emory University:1976-1978, Assistant Professor of Mathematics

University of Missouri-Columbia:1971-1976, Graduate Teaching Assistant, Department of Mathematics

RESEARCH INTERESTS

algorithms and complexity; self-stabilizing algorithms; computer algebra; decidability.



PROFESSIONAL ACTIVITIES

1990 ACM SE Regional, session chair.
1995 International Symposium on Symbolic and Algebraic Computation, poster committee.
2003, ECCAD2003 Organizing Committee .
2007, NSF Review Panel, Symbolic and Alebraic Computation
2010 - present, Fulbright Peer Review Committee for Computer Science
Refereeing for various journals including
J. of Graph Theory
Graphs and Combinatorics
Information Processing Letters
J. of Combinatorial Mathematics and Combinatorial Computing
Discrete Applied Mathematics
Computers & Mathematics with Applications
AMS Mathematical Reviews
ACM SE Regional
ISSAC
Escola da Algebra XV (Brazil)
Performance Evaluation
Computers and Operations Research
IEEE Transactions on Knowledge and Data Engineering
Domination in Graphs Advanced Topics, Marcel Dekker, 1998
Networks
Linear Algebra and its Applications

PUBLICATIONS

    Books and Monographs
  1. G. Bray and D. Pokrass, Understanding Ada - A Software Engineering Approach, (1985), John Wiley & Sons, New York. 352 p.
    2. Invited contributions
  2. D. P. Jacobs, "Building nonassociative algebras with Albert", Handbook of Computer Algebra: Foundations, Applications, Systems, Editors: J. Grabmeier, E. Kaltofen, V. Weispfenning, Springer-Verlag, Heidelberg, Germany, 2001.
    3. Refereed Journal Publications
  3. D. Pokrass and D. Rodabaugh, "Solvable Assosymmetric Rings are Nilpotent", Proceedings of the American Mathematical Society, 64 , 30-34 (1977).

    4.  
  4. D. Pokrass and D. Rodabaugh, "On the Nilpotency of Generalized Alternative Algebras", Journal of Algebra, 49 , 191-205 (1977).

    5.  
  5. D. Pokrass, "Some Radical Properties of Rings with (a,b,c)=(c,a,b)", Pacific Journal of Mathematics, 76 , 479-483 (1978).

    6.  
  6. D. Pokrass, "Levitzki Radical for Certain Varieties", Canadian Journal of Mathematics, 31 , 1005-1011 (1979).

    7.  
  7. D. Pokrass, "Solvability and Nilpotency in Generalized Alternative Rings", Communications in Algebra, 7 , 225-239 (1979).

    8.  
  8. K. Allen and D. Pokrass, "Logic and Functional Programming", IEEE Potentials, 6 3, 21-24 (1987).

    9.  
  9. I.R. Hentzel and D.J. Pokrass, "Practical Solution for a Large Sparse Matrix", Software-Practice and Experience, 18 , 279-283 (1988).

    10.  
  10. D. Pokrass, "A Note on Distance Increasing Reducibility", Indian Journal of Pure and Applied Mathematics, 19 , 250-254 (1988).

    11.  
  11. D. Pokrass, "Some Program Anomalies and the Parameter Theorem", Mathematics Magazine, 62 2, 125-131 (1989).

    12.  
  12. I.R. Hentzel and D. Pokrass Jacobs, "Jordan and Right Alternative Counterexamples", Comptes Rendus Math. Rep. Acad. Sci. Canada, 11 , 77-81 (1989).

    13.  
  13. S.T. Hedetniemi, D. Pokrass Jacobs, R. Laskar, "Inequalities Involving the Rank of a Graph", J. of Combinatorial Mathematics and Combinatorial Computing, 6 , 173-176 (1989).

    14.  
  14. G. Cheston, G. Fricke, S. Hedetniemi, D. P. Jacobs, "On the Computational Complexity of Upper Fractional Domination", Discr. Applied Mathematics, 27 , 195-207 (1990).

    15.  
  15. I.R. Hentzel and D. Pokrass Jacobs, "Complexity and Unsolvability Properties of Nilpotency", SIAM Journal on Computing, 19 , 32-43 (1990).

    16.  
  16. D.P. Jacobs, "Probabilistic Checking of Associativity in Algebras", Information Processing Letters, 37 , 187-191 (1991).

    17.  
  17. I.R. Hentzel and D. Pokrass Jacobs, "A Dynamic Programming Method for Building Free Algebras", Computers & Mathematics with Applications, 22 12, 61-66 (1991).

    18.  
  18. F. Harary, I.R. Hentzel and D. Pokrass Jacobs, "Digitizing Sum Graphs Over the Reals", Caribb. J. Math. Comput. Sci., 1 , 1-4 (1991).

    19.  
  19. I.R. Hentzel and D. Pokrass Jacobs, "A Condition Guaranteeing Commutativity", International Journal of Algebra and Computation, 2 3, 291-296 (1992).

    20.  
  20. I.R. Hentzel and D. Pokrass Jacobs, "Fast Change of Basis in Algebras", Applicable Algebra in Engineering, Communication, and Computing, 3 4, 257 - 261 (1992).

    21.  
  21. P. Bernhard, S.T. Hedetniemi and D.P. Jacobs, "Efficient Sets in Graphs", Discrete Applied Math., 44 , 99 - 108 (1993).

    22.  
  22. S.M. Hedetniemi, S.T. Hedetniemi, and D.P. Jacobs, "Total Irredundance in Graphs: Theory and Algorithms", Ars Combinatoria, 35A , 271-284 (1993).

    23.  
  23. I.R. Hentzel, D.P. Jacobs, S.V. Muddana, "Experimenting with the Identity (xy)z=y(zx)", Journal of Symbolic Computation, 16 , 289-293 (1993).

    24.  
  24. I. R. Hentzel, D.P. Jacobs, and E. Kleinfeld, "Rings with (a,b,c)=(a,c,b) and (a,[b,c],d)=0: A Case Study Using Albert" Int. J. of Computer Mathematics, 49 , 19-27 (1993).

    25.  
  25. D.P. Jacobs and S.V. Muddana, "The Word Problem for Free Partially Commutative, Partially Associative Groupoids", Journal of Symbolic Computation, 16 , 557-562 (1993).

    26.  
  26. M. Fellows, G. Fricke, S.T. Hedetniemi, D.P. Jacobs, "The Private Neighbor Cube", SIAM Journal of Discrete Mathematics, 7 , 41-47 (1994).

    27.  
  27. D. P. Jacobs, "Undecidability of Winkler's r-Neighborhood Problem for Covering Digraphs", J. of Combinatorial Theory, Ser. B, 60 , 254-267 (1994).

    28.  
  28. I. R. Hentzel, D. P. Jacobs, L. A. Peresi, and S. R. Sverchkov, "Solvability of the Ideal of all Weight Zero Elements in Bernstein Algebras", Communications in Algebra, 22 9, 3265-3275 (1994).

    29.  
  29. Irvin R. Hentzel, David P. Jacobs, and Luiz A. Peresi, "A Basis for Free Assosymmetric Algebras", Journal of Algebra, 183 , 306-318 (1996).

    30.  
  30. G. Fricke, S.T. Hedetniemi, D.P. Jacobs, and V. Trevisan, "Reducing the Adjacency Matrix of a Tree", Electronic Journal of Linear Algebra, http://www.math.technion.ac.il/iic/ela/ , 1 , 34-43 (1996).

    31.  
  31. G. Fricke, S.T. Hedetniemi, D.P. Jacobs, "Maximal Irredundant Functions", Discrete Applied Mathematics, 68 3, 267-277 (1996).

    32.  
  32. D.P. Jacobs and V. Trevisan, "The Determinant of a Tree's Neighborhood Matrix", Linear Algebra and Its Applications, 256 , 235-48 (1997).

    33.  
  33. D.P. Jacobs, "A Course in Computational Nonassociative Algebra", Journal of Symbolic Computation, 23 , 497-502 (1997).

    34.  
  34. G. Fricke, S.T. Hedetniemi, D.P. Jacobs, "Independence and Irredundance in k-Regular Graphs", Ars Combinatoria, 49, 271-279 (1998).

    35.  
  35. Sandee Hedetniemi, Stephen T. Hedetniemi, and David P. Jacobs, "Rank Independent Domination for Trees", Bulletin of Institute of Combinatorics and its Applications, 27, (1999) 62-68.

    36.  
  36. David P. Jacobs and Vilmar Trevisan, "Linear-time LUP Decomposition of Forest-like Matrices", Computers and Mathematics with Applications, 37, (1999) 37-50.

    37.  
  37. J.E. Dunbar, S.M. Hedetniemi, S.T. Hedetniemi, D.P. Jacobs, J. Knisely, R.C. Lakar, D. F. Rall, "Fall Colorings of Graphs", J. of Combinatorial Mathematics and Combinatorial Computing, 33, 257-273 (2000)

    38.  
  38. David P. Jacobs and Robert E. Jamison, "Complexity of Recognizing Equal Unions in Families of Sets", Journal of Algorithms, 37, 495-504 (2000)

    39.  
  39. David P. Jacobs, John S. Davis, Jack C. Peck, "A Simple Heuristic for Maximizing Service of Carousel Storage", Computers and Operations Research, 27 (2000), 1351-1356.

    40.  
  40. David P. Jacobs, John S. Davis, Jack C. Peck, "A Fast Algorithm for Shelf Optimization: a Note", Research Journal of Textile and Apparel, 4 2 (2000), 47-51

    41.  
  41. Stephen T. Hedetniemi, David P. Jacobs, and Pradip K. Srimani, "Maximal Matching Stabilizes in Time O(m)", Information Processing Letters, 80 (2001), 221-223.

    42.  
  42. David P. Jacobs and Robert E. Jamison, "A Note on Equal Unions in Families of Sets", Discrete Mathematics, Selected Papers in honor of Helge Tverberg, edited by B. Lindstrom, J. Zaks, D.G. Rogers, 241 (2001), 387-393.

    43.  
  43. Teresa W. Haynes, Sandra M. Hedetniemi, Stephen T. Hedetniemi, David P. Jacobs, James Knisely and Lucas C. van der Merwe, "Domination Subdivision Numbers", Discussiones Mathematicae Graph Theory, 21 2 (2001), 239-253.

    44.  
  44. Stephen T. Hedetniemi, David P. Jacobs, Pradip K. Srimani, "Linear time self-Stabilizing colorings", Information Processing Letters 87 (2003) 251-255.

    45.  
  45. S.M. Hedetniemi, S.T. Hedetniemi, D.P. Jacobs and P.K. Srimani, "Self-stabilizing Algorithms for Minimal Dominating Sets and Maximal Independent Sets", Computers & Mathematics with Applications, 46 (2003) 805-811.

    46.  
  46. Martin Gairing, Wayne Goddard, Stephen T. Hedetneimi, David P. Jacobs, "Self-stabilizing Maximal k-Dependent Sets in Linear Time", Parallel Processing Letters, 14 (2004) 75-82.

    47.  
  47. W. Goddard, S.T. Hedetniemi, D.P. Jacobs and P.K. Srimani, "Self-stabilizing Algorithms for Orderings and Colorings", International Journal on Foundations of Computer Science, 16 1 (2005) 19-36.

    48.  
  48. David P. Jacobs, Catia M. S. Machado, and Vilmar Trevisan, "An O(n2) Algorithm for the Characteristic Polynomial of a Tree", J Comb. Math. and Comb. Comp., 54 (2005) 213-221.

    49.  
  49. W. Goddard, S. T. Hedetniemi, D. P. Jacobs, P. Srimani "Self-Stabilizing global optimization algorithms for large network graphs", International Journal of Distributed Sensor Networks, 1 (2005) 329-344.

    50.  
  50. David P. Jacobs and Robert E. Jamison, "Polynomial Recognition of Equal Unions in Hypergraphs with Few Vertices of Large Degree", Journal of Discrete Algorithms, 4 2 (2006) 201-208

    51.  
  51. G. Fricke, S.T. Hedetniemi, and D.P. Jacobs, "On the Equivalence of the Upper Irredundance and Fractional Upper Irredundance Numbers of a Graph", Bulletin of Institute of Combinatorics and its Applications , 48 (2006), 99-106.

    52.  
  52. W. Goddard, S.T. Hedetniemi, D.P. Jacobs, Vilmar Trevisan, "Distance-k knowledge in self-stabilizing algorithms", Theoretical Computer Science , 399 (2008) 118-127

    53.  
  53. W. Goddard, S.T. Hedetniemi, D.P. Jacobs, P.K. Srimani, Z. Xu. "Self-stabilizing graph protocols", Parallel Processing Letters, 18 1 (2008) 189-199

    54.  
  54. D.P. Jacobs, V. Trevisan, M.O. Rayes, "Randomized Compositeness Testing with Chebyshev Polynomials", ( preprint ), International Journal of Pure and Applied Mathematics, 44 3 (2008) 347-362

    55.  
  55. D.P. Jacobs, V. Trevisan, M.O. Rayes, "Characterization of Chebyshev Numbers", Algebra and Discrete Mathematics, (2008), no. 2, 65-82.

    56.  
  56. D.P. Jacobs, V. Trevisan, M.O. Rayes, "The Resultant of Chebyshev Polynomials", Canadian Mathematical Bulletin, 54 (2011) 288-296.

    57.  
  57. A. E. Brouwer, Renata R. Del-Vecchio, David P. Jacobs, Vilmar Trevisan, and Cybele T. M. Vinagre, "Integral Trees Homeomorphic to a Double Star", Bull. Inst. Comb. Appl. 61 (2011) 77-80.

    58.  
  58. David P. Jacobs and Vilmar Trevisan, "Locating the Eigenvalues of Trees", Linear Algebra and Its Applications, 434 (2011) 81-88.
    59. Conference Proceedings (Reviewed)
  59. I.R. Hentzel and D.J. Pokrass, "A Computational and Graph Theoretic Approach to Nonassociative Algebras", Congressus Numerantium, 62, 241-258 (1988), (presented at 18th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, February, 1987.)

    60.  
  60. I.R. Hentzel and D.J. Pokrass, "Verification of Non-identities in Algebras", in Lecture Notes in Computer Science, 358 , P. Gianni (Ed.), Springer Verlag, 496-507, 1989, (presented at 1988 International Symposium on Symbolic and Algebraic Computation, July, Rome.)

    61.  
  61. G. Fricke, E.O. Hare, D.P. Jacobs, A. Majumdar, "On Integral and Fractional Total Domination", Congressus Numerantium, 77 , 87-95 (1990).

    62.  
  62. I.R. Hentzel and D.J. Pokrass, "Proofs for Non-Identities Using Characteristic Functions", Congressus Numerantium, 78 , 123-134 (1990), (presented at 21st Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, February, 1990.)

    63.  
  63. S.M. Hedetniemi, S.T. Hedetniemi, and D.P. Jacobs, "Private Domination: Theory and Algorithms", Congressus Numerantium, 79 , 147-157 (1990), (presented at 21st Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, February, 1990.)

    64.  
  64. D.P. Jacobs, S.V. Muddana, A.J. Offutt, "A Computer Algebra System for Nonassociative Identities", in Hadronic Mechanics and Nonpotential Interactions, Myung, H.C. (Ed.), Nova Science Publishers, Inc., New York, 1993. (presented at Fifth International Conference, August, 1990, Cedar Falls.)

    65.  
  65. D.P. Jacobs, "The Albert Nonassociative Algebra System: A Progress Report", Proceedings of International Symposium on Symbolic and Algebraic Computation (ISSAC-94), 41-44, Oxford, England (July, 1994).

    66.  
  66. D.P. Jacobs, "Deciding Identities in Finite Dimensional Algebras", Proceedings of Congresso Nacional de Matemática Aplicada e Computacional (CNMAC'95), Curitiba, Brazil, (August, 1995).

    67.  
  67. David P. Jacobs and Vilmar Trevisan, "Constructing the Characteristic Polynomial of a Tree's Adjacency Matrix", Congressus Numerantium, 134 , 139-145 (1998), (presented at 29th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, March, 1998.)

    68.  
  68. J. Ghoshal, D. Jacobs, R. Laskar, D. Pillone, "Partitions in Tournaments", Congressus Numerantium, 132 , 145-155 (1998), presented at 29th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, March, 1998.

    69.  
  69. David P. Jacobs, Robert E. Jamison, and Alice A. McRae, "On the Complexity of Sign-Nonsingularity and Equal Unions of Sets", Proceedings of the 38th ACM SE Conference, Clemson, April 2000, 232-234.

    70.  
  70. Edward Doyle and David P. Jacobs, "2-Split Graphs", Congressus Numerantium 142, 65-73 (2000), presented at 31st Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, 2000.

    71.  
  71. David P. Jacobs, Catia M. S. Machado, and Vilmar Trevisan, "An O(n2) Algorithm for the Characteristic Polynomial of a Tree" (abstract), proceedings of Brazilian Symposium on Graphs, Algorithms and Combinatorics, March 2001, Forteleza, Brazil, Electronic Notes in Discrete Mathematics Volume 7, Elsevier Science.

    72.  
  72. David P. Jacobs and Robert E. Jamison, "NP-completeness for Equal Unions in Families of Sets", Proceedings of the 39th ACM SE Conference, Athens, March 2001, 73-75.

    73.  
  73. D.P. Jacobs and B. A. Malloy, "An Application-Centered Course on Data-Driven Web Sites", Proceedings of Frontiers in Education, Reno, October 2001, F2D10-F2D14.

    74.  
  74. J.R.S. Blair, S.M. Hedetniemi, S.T. Hedetniemi and D.P Jacobs, "Self-stabilizing maximum matchings", Congressus Numerantium , 153, 151-159 (2001), presented at 32nd Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Baton Rouge, 2001.

    75.  
  75. Stephen T. Hedetniemi, David P. Jacobs and Pradip K. Srimani, "Fault Tolerant Distributed Coloring Algorithms That Stablize in Linear Time", Proc. Workshop on Advances in Parallel and Distributed Computational Models, Orlando, Florida, April 15, 2002, 1 - 5.

    76.  
  76. W. Goddard, S. Hedetniemi, D. Jacobs, and P. Srimani, Self stabilizing protocols for Maximal matching and maximal independent sets for ad hoc networks, Proceedings of fifth IPDPS workshop on Advances in Parallel and Distributed Computational Models, Nice France, April 22-26, 2003.

    77.  
  77. Wayne D. Goddard, Stephen T. Hedetniemi, David P. Jacobs, Pradip K. Srimani, A robust distributed generalized matching protocol that stabilizes in linear time, Proceedings of the ICDCS International Workshop on Mobile Distributed Computing (MDC03) Providence, May 19-22, 2003.

    78.  
  78. Wayne D. Goddard, Stephen T. Hedetniemi, David P. Jacobs, Pradip K. Srimani, A self-stabilizing distributed algorithm for minimal total domination in an arbitrary system graph, Proceedings of the IPDPS workshop on Formal methods on parallel programming: Theory and Applications (FMPPTA-2003), Nice, France, April 22-26, 2003.

    79.  
  79. Wayne D. Goddard, S. Hedetniemi, D. Jacobs, and P. Srimani, Self-stabilizing distributed algorithm for strong matching in a system graph, International Conference on High Performance Computing (HiPC2003), Hyderabad, India, Lecture Notes in Computer Science, Springer Verlag, v. 2913, 66-73, 2003.

    80.  
  80. W. Goddard, S.T. Hedetniemi, D.P. Jacobs and P.K. Srimani, Fault Tolerant Algorithms for Orderings and Colorings, Proceedings of the IPDPS Workshop on Advances in Parallel and Distributed Computational Models (APDCM04), Santa Fe, New Mexico, April, 2004.

    81.  
  81. W. Goddard, S.T. Hedetniemi, D.P. Jacobs, Vilmar Trevisan, Distance-k information in self-stabilizing algorithms, Proc. of 13th Colloquium on Structural Information and Communication Complexity (SIROCCO), July, 2006, Springer Verlag LNCS, Vol. 4056, 349-356.

    82.  
  82. W. Goddard, S.T. Hedetniemi, D. P. Jacobs, P. K. Srimani, Introduction to the Self-stabilizing Algorithmic Model, Proc. Workshop on Graph Theory and Applications, Porto Alegre, Nov. 2006.

    83.  
  83. W. Goddard, S.T. Hedetniemi, D. P. Jacobs, P. K. Srimani, Anonymous Daemon Conversion in Self-stabilizing Algorithms by Randomization in Constant Space, Proc. 9th Int. Conf. on Distributed Computing and Networking, ICDCN 2008, Springer Verlag LNCS, Vol. 4904, 182-190.

    84.  
  84. D.P. Jacobs, Catia M.S. Machado, Elaine C. Pereira, V. Trevisan, Computing the Inverse of a Tree's Incidence Matrix, Congressus Numerantium, 189 (2008) 169-176, presented at Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, March, 2008
Research Reports
D.P. Jacobs, S.V. Muddana, A.J. Offutt, K. Prabhu, "Version 1.0 Albert User's Guide", Technical Report 91-113, Department of Computer Science, Clemson University
Other Scholarly Publications
D. Pokrass, "Solvability in a Class of Generalized Alternative Rings", Notices of the American Math. Soc., August, 1977, abstract 77T-A151.
D. Pokrass, "Associativity in a Ring", advanced problem #6263 with solution, The American Mathematical Monthly, February, 1981, p. 154.
D. Pokrass and B. F. Wu, "An Operating Systems Project Using Structured Methodology", SIGSCE Bulletin, 14 3, 7-10 (1982).
I.R. Hentzel and D. Pokrass, "In a Right Alternative Algebra an Alternator Need not Cube to Zero", Abstracts of the American Math. Soc., January, 1988, abstract 839-17-01.
Papers Pending
S. T. Hedetniemi, David P. Jacobs and K. E. Kennedy, Self-stabilizing algorithms for disjoint independent sets, submitted.
S. T. Hedetniemi, David P. Jacobs and K. E. Kennedy, A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets. in preparation.
Unpublished Course Notes
"Topics in Computer Algebra", August, 1996, 86 pages.

PRESENTATIONS

Invited
"An Algebraic Problem, a Computational Solution", invited colloquium talk, Dept. of Mathematics and Computer Science, Wake Forest University, Winston-Salem, November 6, 1987.
"Algebras, Identities, and Dynamic Programming", invited colloquium talk, Dept. of Mathematics and Computer Science, Emory University, Atlanta, October 27, 1988.
"Some Variations on Winkler's r-Neighborhood Problem", Special Session, Combinatorial problems on partially ordered sets, Meeting of the American Mathematical Society, Tuscaloosa, Alabama, March 13, 1992, Abstracts of the Amer. Math. Soc., March, 1992, abstract 872-03-81.
"A Curious Identity", invited colloquium talk, Dept. of Mathematics, Wright State University, Dayton, October 29, 1993
"Interactive Computational Nonassociative Algebra", A Workshop on New Technology for Symbolic Computational Mathematics and Applications to Research & Education, Rutgers University, June 9, 1994.
"The Strangest Identity I Know" (July 25, 1995), "A Nonassociative Commutativity Theorem" (July 26, 1995), Department of Mathematics, University of São Paulo, Brazil.
"Determinants and Characteristic Polynomials for Trees", invited colloquium talk, Dept. of Mathematics and Computer Science, Georgia State University, Atlanta, February 21, 1997.
"Mathematical legerdemain or Do you believe in magic?", Converse College, Spartanburg, October 21, 1997.
"On the Complexity of Sign-Nonsingularity and Equal Unions of Sets", 38th ACM SE Conference, Clemson, April 8, 2000.
"Designing Self-Stabilizing Algorithms", Department of Mathematical Sciences, Clemson University, February 28, 2002.
"Algorithms, computation, and nonassociative identities", Topics in Linear Algebra, Iowa State University, September 14, 2002.
"Designing Self-Stabilizing Algorithms", Instituto de Matemática, Universidade Federal do Rio Grande do Sul, Brazil. December 15, 2005
"Introduction to Self-Stabilizing Algorithms", two lectures, Workshop on Graph Theory and Applications, Universidade Federal do Rio Grande do Sul, Brazil, November 20-21, 2006.
Contributed talks
D. Pokrass, "Right Nilpotent Generalized Alternative Rings", 84th Annual Meeting of the American Mathematical Society, Atlanta, (January, 1978), Notices of the Amer. Math. Soc., January, 1978, abstract 752-17-5.
G. Cheston, G. Fricke, S. Hedetniemi, D. Pokrass Jacobs, "The Computation of Fractional Dominating Functions of Graphs", Fourth SIAM Conference on Discrete Mathematics, San Francisco, (June, 1988).
D. Jacobs, "Deciding Identities: Nonassociative Algebraic Computation", SIAM Annual Meeting, Chicago, (July, 1990).

HONORS AND AWARDS

Fulbright Scholarship for Theory and New Frontiers for Self-stabilizing Algorithms Universidade Federal do Rio Grande do Sul, Brazil, 2006
Graduate Teaching Award, University of Missouri, (1975).

SPONSORED RESEARCH

University Research Grant, Clemson University, for "Algorithms for Verifying Identities in Right Alternative Algebras", $496, (1987).
PI, "Deciding Identities in Nonassociative Algebras with Dynamic Programming", National Science Foundation, $30,188, (1989).
Visiting Professor, Instituto de Matemática, Universidade Federal do Rio Grande do Sul, Brazil, funded by CNPq, (1995).
Visiting Researcher, University of São Paulo, Brazil, (July 19 - 29, 1995).
co-PI, "U.S.-Sweden Workshop: Worldwide Access of Emerging Mathematical Technology", National Science Foundation, co-principal investigator, with B. Malloy, $16,400, (1995).
"Balanced Inventory Flow Replenishment System", Defense Logistics Agency, Clemson Apparel Research, summer (1997).
co-PI, "Design and Evaluation Modules for a Collaborative Vehicle Design Framework", Army Tank-Automotive and Armaments Command (TACOM), with Georges Fadel, Wei Chen, J. McGregor, B. Malloy, D. Stevenson, R. Pargas, R. Geist. $463,157, (1998).
co-PI, "ITR: Self-Stabilizing Networking Protocols for Distributed Systems", National Science Foundation, with Pradip Srimani and Stephen T. Hedetniemi. $394,433, (2002).
co-PI, "East Coast Computer Algebra Day, 2003-2004", National Science Foundation, with Shuhong Gao, $11,150, 2003.

OTHER SPONSORED ACTIVITY

Instructor, Emory University summer program for high ability secondary school students, National Science Foundation, (1977, 1978).

GRADUATE STUDENT ADVISING

Doctoral Graduates
Veerasekhararao Muddana, "Efficient Algorithms for Certain Groupoid Word Problems", (1994)
Masters Graduates
Veerasekhararao Muddana, (MS), "Implementation of Albert: a Computer Algebra System for Nonassociative Identities", (1990)
Kirtikumar Lalitesh Prabhu, (MS), "Implementation of utilities for Albert", (1991).
David C. Lee, (MS), "An Implementation of Sparse Matrix Technology", (1992).
Trent Whiteley, (MS), (1993).
Michael Davis, (MS), "Explorations of Triangular Peg Solitaire", (1996).
Dina M. El Tantawy, (MS), "An Application in Computer Algebra, The Modular Sturm Method", (1997).

TEACHING

Courses Taught (Beginning Fall 1990)
Introduction to Computer Science (101, 102)
Programming Methodology (210)
Foundations of Computer Science (350)
Theory of Computation (859)
Design and Analysis of Algorithms (840)
Introduction to Computational Complexity (841)
Data Structures and algorithms (241)
Bioinformatics Algorithms
Special Topics Courses
Computer Algebra (481). Topics included Maple, resultants, Euclidean methods, modular methods, and Grobner bases.
Computer Algebra (881)
Database driven web design (481). Designed and taught this experimental, project-oriented course on database driven web design using a mixture of technologies including Active Server Pages.

SERVICE

Masters e-commerce Helped establish a Masters Degree in Electronic Commerce, a joint degree in College of Business and Public Affairs and College of Engineering and Science, and the first such program in South Carolina. Applied for seed funds to develop the program. Currently serve on the masters of e-commerce advisory board.

MISCELLANEOUS

Albert is an interactive computer algebra program that assists research in nonassociative algebra by constructing so-called free algebras. Its main algorithm was designed by D. Jacobs, and implemented by S. Muddana, in the course of about a year. A.J. Offutt helped design the user interface. It is used at universities in eight countries. So far, it has led to the solution of several open questions in nonassociative algebra.

Date of last revision: August, 2001