David Pokrass Jacobs

  • Clemson University, SC, USA

According to our database1, David Pokrass Jacobs authored at least 50 papers between 1982 and 2021.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


Most Laplacian eigenvalues of a tree are small.
J. Comb. Theory, Ser. B, 2021

Eigenvalue location in cographs.
Discret. Appl. Math., 2018

Locating the Eigenvalues for Graphs of Small Clique-Width.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Laplacian Distribution and Domination.
Graphs Comb., 2017

Domination number and Laplacian eigenvalue distribution.
Eur. J. Comb., 2016

A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets.
Theor. Comput. Sci., 2015

Diagonalization of generalized lollipop graphs.
Electron. Notes Discret. Math., 2015

Computing the Characteristic Polynomial of Threshold Graphs.
J. Graph Algorithms Appl., 2014

Linear-Time Self-Stabilizing Algorithms for Disjoint Independent Sets.
Comput. J., 2013

A systematic approach to teaching abstraction and mathematical modeling.
Proceedings of the Annual Conference on Innovation and Technology in Computer Science Education, 2012

Distance- k knowledge in self-stabilizing algorithms.
Theor. Comput. Sci., 2008

Self-Stabilizing Graph Protocols.
Parallel Process. Lett., 2008

Anonymous Daemon Conversion in Self-stabilizing Algorithms by Randomization in Constant Space.
Proceedings of the Distributed Computing and Networking, 9th International Conference, 2008

Polynomial recognition of equal unions in hypergraphs with few vertices of large degree.
J. Discrete Algorithms, 2006

Distance-<i>k</i> Information in Self-stabilizing Algorithms.
Proceedings of the Structural Information and Communication Complexity, 2006

Self-Stabilizing Algorithms For Orderings And Colorings.
Int. J. Found. Comput. Sci., 2005

Self-Stabilizing Global Optimization Algorithms for Large Network Graphs.
Int. J. Distributed Sens. Networks, 2005

Self-Stabilizing Maximal K-Dependent Sets In Linear Time.
Parallel Process. Lett., 2004

Fault Tolerant Algorithms for Orderings and Colorings.
Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

A search engine for 3D models.
ACM Trans. Graph., 2003

Linear time self-stabilizing colorings.
Inf. Process. Lett., 2003

A Self-Stabilizing Distributed Algorithm for Minimal Total Domination in an Arbitrary System Grap.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

Self-Stabilizing Protocols for Maximal Matching and Maximal Independent Sets for Ad Hoc Networks.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

A Robust Distributed Generalized Matching Protocol that Stabilizes in Linear Time.
Proceedings of the 23rd International Conference on Distributed Computing Systems Workshops (ICDCS 2003 Workshops), 2003

Self-Stabilizing Distributed Algorithm for Strong Matching in a System Graph.
Proceedings of the High Performance Computing - HiPC 2003, 10th International Conference, 2003

Fault Tolerant Distributed Coloring Algorithms that Stabilize in Linear Time.
Proceedings of the 16th International Parallel and Distributed Processing Symposium (IPDPS 2002), 2002

Maximal matching stabilizes in time O(m).
Inf. Process. Lett., 2001

An O(n<sup>2</sup>) Algorithm for the Characteristic Polynomial of a Tree.
Electron. Notes Discret. Math., 2001

Domination Subdivision Numbers.
Discuss. Math. Graph Theory, 2001

A note on equal unions in families of sets.
Discret. Math., 2001

Complexity of Recognizing Equal Unions in Families of Sets.
J. Algorithms, 2000

A simple heuristic for maximizing service of carousel storage.
Comput. Oper. Res., 2000

On the complexity of sign-nonsingularity and equal unions of sets.
Proceedings of the 38th Annual Southeast Regional Conference, 2000

Independence and Irredundance in k-Regular Graphs.
Ars Comb., 1998

A Course in Computational Nonassociative Algebra.
J. Symb. Comput., 1997

Maximal Irredundant Functions.
Discret. Appl. Math., 1996

The Private Neighbor Cube.
SIAM J. Discret. Math., 1994

Undecidability of Winkler's <i>r</i>-Neighborhood Problem for Covering Digraphs.
J. Comb. Theory, Ser. B, 1994

The Albert Nonassociative Algebra System: A Progress Report.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1994

The Word Problem for Free Partially Commutative, Partially Associative Groupoids.
J. Symb. Comput., 1993

Experimenting with the Identity (xy)z = y(zx).
J. Symb. Comput., 1993

Efficient Sets in Graphs.
Discret. Appl. Math., 1993

A condition Guaranteeing Commutativity.
Int. J. Algebra Comput., 1992

Fast Change of Basis in Algebras.
Appl. Algebra Eng. Commun. Comput., 1992

Probabilistic Checking of Associativity in Algebras.
Inf. Process. Lett., 1991

Complexity and Unsolvability Properties of Nilpotency.
SIAM J. Comput., 1990

On the computational complexity of upper fractional domination.
Discret. Appl. Math., 1990

A Practical Solution for a Large Sparse Matrix.
Softw. Pract. Exp., 1988

Verification of Non-Identities in Algebras.
Proceedings of the Symbolic and Algebraic Computation, 1988

An operating systems project using structured methodology.
ACM SIGCSE Bull., 1982