An operating systems project using structured methodology. - David J. Pokrass; B.-F. Wu (ACM SIGCSE Bull., 1982)

Verification of Non-Identities in Algebras. - Irvin Roy Hentzel; David Pokrass Jacobs (ISSAC, 1988)

A Practical Solution for a Large Sparse Matrix. - Irvin Roy Hentzel; David J. Pokrass (Softw. Pract. Exp., 1988)

On the computational complexity of upper fractional domination. - Grant A. Cheston; Gerd Fricke; Stephen T. Hedetniemi; David Pokrass Jacobs (Discret. Appl. Math., 1990)

Complexity and Unsolvability Properties of Nilpotency. - Irvin Roy Hentzel; David Pokrass Jacobs (SIAM J. Comput., 1990)

Probabilistic Checking of Associativity in Algebras. - David Pokrass Jacobs (Inf. Process. Lett., 1991)

Fast Change of Basis in Algebras. - Irvin Roy Hentzel; David Pokrass Jacobs (Appl. Algebra Eng. Commun. Comput., 1992)

A condition Guaranteeing Commutativity. - Irvin Roy Hentzel; David Pokrass Jacobs (Int. J. Algebra Comput., 1992)

Efficient Sets in Graphs. - Philip J. Bernhard; Stephen T. Hedetniemi; David Pokrass Jacobs (Discret. Appl. Math., 1993)

Experimenting with the Identity (xy)z = y(zx). - Irvin Roy Hentzel; David Pokrass Jacobs; Sekhar V. Muddana (J. Symb. Comput., 1993)

The Word Problem for Free Partially Commutative, Partially Associative Groupoids. - David Pokrass Jacobs; Sekhar V. Muddana (J. Symb. Comput., 1993)

The Albert Nonassociative Algebra System: A Progress Report. - David Pokrass Jacobs (ISSAC, 1994)

Undecidability of Winkler's r-Neighborhood Problem for Covering Digraphs. - David Pokrass Jacobs (J. Comb. Theory B, 1994)

The Private Neighbor Cube. - Michael R. Fellows; Gerd Fricke; Stephen T. Hedetniemi; David Pokrass Jacobs (SIAM J. Discret. Math., 1994)

Maximal Irredundant Functions. - Gerd Fricke; Stephen T. Hedetniemi; David Pokrass Jacobs (Discret. Appl. Math., 1996)

A Course in Computational Nonassociative Algebra. - David Pokrass Jacobs (J. Symb. Comput., 1997)

Independence and Irredundance in k-Regular Graphs. - Gerd Fricke; Stephen T. Hedetniemi; David Pokrass Jacobs (Ars Comb., 1998)

On the complexity of sign-nonsingularity and equal unions of sets. - David Pokrass Jacobs; Robert E. Jamison; Alice A. McRae (ACM Southeast Regional Conference, 2000)

A simple heuristic for maximizing service of carousel storage. - David Pokrass Jacobs; John C. Peck; J. Steve Davis (Comput. Oper. Res., 2000)

Complexity of Recognizing Equal Unions in Families of Sets. - David Pokrass Jacobs; Robert E. Jamison (J. Algorithms, 2000)

A note on equal unions in families of sets. - David Pokrass Jacobs; Robert E. Jamison (Discret. Math., 2001)

Domination Subdivision Numbers. - Teresa W. Haynes; Sandra Mitchell Hedetniemi; Stephen T. Hedetniemi; David Pokrass Jacobs; James A. Knisely; Lucas C. van der Merwe (Discuss. Math. Graph Theory, 2001)

An O(n2) Algorithm for the Characteristic Polynomial of a Tree. - David Pokrass Jacobs; Catia Maria dos Santos Machado; Vilmar Trevisan (Electron. Notes Discret. Math., 2001)

Maximal matching stabilizes in time O(m). - Stephen T. Hedetniemi; David Pokrass Jacobs; Pradip K. Srimani (Inf. Process. Lett., 2001)

Fault Tolerant Distributed Coloring Algorithms that Stabilize in Linear Time. - Stephen T. Hedetniemi; David Pokrass Jacobs; Pradip K. Srimani (IPDPS, 2002)

Self-Stabilizing Distributed Algorithm for Strong Matching in a System Graph. - Wayne Goddard; Stephen T. Hedetniemi; David Pokrass Jacobs; Pradip K. Srimani (HiPC, 2003)

A Robust Distributed Generalized Matching Protocol that Stabilizes in Linear Time. - Wayne Goddard; Stephen T. Hedetniemi; David Pokrass Jacobs; Pradip K. Srimani (ICDCS Workshops, 2003)

Self-Stabilizing Protocols for Maximal Matching and Maximal Independent Sets for Ad Hoc Networks. - Wayne Goddard; Stephen T. Hedetniemi; David Pokrass Jacobs; Pradip K. Srimani (IPDPS, 2003)

A Self-Stabilizing Distributed Algorithm for Minimal Total Domination in an Arbitrary System Grap. - Wayne Goddard; Stephen T. Hedetniemi; David Pokrass Jacobs; Pradip K. Srimani (IPDPS, 2003)

Linear time self-stabilizing colorings. - Stephen T. Hedetniemi; David Pokrass Jacobs; Pradip K. Srimani (Inf. Process. Lett., 2003)

A search engine for 3D models. - Thomas A. Funkhouser; Patrick Min; Michael M. Kazhdan; Joyce Chen; J. Alex Halderman; David P. Dobkin; David Pokrass Jacobs (ACM Trans. Graph., 2003)

Fault Tolerant Algorithms for Orderings and Colorings. - Wayne Goddard; Stephen T. Hedetniemi; David Pokrass Jacobs; Pradip K. Srimani (IPDPS, 2004)

Self-Stabilizing Maximal K-Dependent Sets In Linear Time. - Martin Gairing; Wayne Goddard; Stephen T. Hedetniemi; David Pokrass Jacobs (Parallel Process. Lett., 2004)

Self-Stabilizing Global Optimization Algorithms for Large Network Graphs. - Wayne Goddard; Stephen T. Hedetniemi; David Pokrass Jacobs; Pradip K. Srimani (Int. J. Distributed Sens. Networks, 2005)

Self-Stabilizing Algorithms For Orderings And Colorings. - Wayne Goddard; Stephen T. Hedetniemi; David Pokrass Jacobs; Pradip K. Srimani (Int. J. Found. Comput. Sci., 2005)

Distance-k Information in Self-stabilizing Algorithms. - Wayne Goddard; Stephen T. Hedetniemi; David Pokrass Jacobs; Vilmar Trevisan (SIROCCO, 2006)

Polynomial recognition of equal unions in hypergraphs with few vertices of large degree. - David Pokrass Jacobs; Robert E. Jamison (J. Discrete Algorithms, 2006)

Anonymous Daemon Conversion in Self-stabilizing Algorithms by Randomization in Constant Space. - Wayne Goddard; Stephen T. Hedetniemi; David Pokrass Jacobs; Pradip K. Srimani (ICDCN, 2008)

Self-Stabilizing Graph Protocols. - Wayne Goddard; Stephen T. Hedetniemi; David Pokrass Jacobs; Pradip K. Srimani; Zhenyu Xu (Parallel Process. Lett., 2008)

Distance- k knowledge in self-stabilizing algorithms. - Wayne Goddard; Stephen T. Hedetniemi; David Pokrass Jacobs; Vilmar Trevisan (Theor. Comput. Sci., 2008)

A systematic approach to teaching abstraction and mathematical modeling. - Charles T. Cook; Svetlana Drachova-Strang; Jason O. Hallstrom; Joseph E. Hollingsworth; David Pokrass Jacobs; Joan Krone; Murali Sitaraman (ITiCSE, 2012)

Linear-Time Self-Stabilizing Algorithms for Disjoint Independent Sets. - Stephen T. Hedetniemi; David Pokrass Jacobs; K. E. Kennedy (Comput. J., 2013)

Computing the Characteristic Polynomial of Threshold Graphs. - David Pokrass Jacobs; Vilmar Trevisan; Fernando Tura (J. Graph Algorithms Appl., 2014)

Diagonalization of generalized lollipop graphs. - Renata R. Del-Vecchio; David Pokrass Jacobs; Vilmar Trevisan; Cybele T. M. Vinagre (Electron. Notes Discret. Math., 2015)

A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets. - Stephen T. Hedetniemi; David Pokrass Jacobs; K. E. Kennedy (Theor. Comput. Sci., 2015)

Domination number and Laplacian eigenvalue distribution. - Stephen T. Hedetniemi; David Pokrass Jacobs; Vilmar Trevisan (Eur. J. Comb., 2016)

Laplacian Distribution and Domination. - Domingos M. Cardoso; David Pokrass Jacobs; Vilmar Trevisan (Graphs Comb., 2017)

Locating the Eigenvalues for Graphs of Small Clique-Width. - Martin Fürer; Carlos Hoppen; David Pokrass Jacobs; Vilmar Trevisan (LATIN, 2018)

Eigenvalue location in cographs. - David Pokrass Jacobs; Vilmar Trevisan; Fernando Tura (Discret. Appl. Math., 2018)

Most Laplacian eigenvalues of a tree are small. - David Pokrass Jacobs; Elismar R. Oliveira; Vilmar Trevisan (J. Comb. Theory B, 2021)