David Pokrass Jacobs

48 papers A 4B 5Misc 2Journal 35Unranked 2

Year	Rank	Type	Title / Venue / Authors
2021	J	`jnl`	Most Laplacian eigenvalues of a tree are small. J. Comb. Theory B David Pokrass Jacobs, Elismar R. Oliveira, Vilmar Trevisan
2018	J	`jnl`	Eigenvalue location in cographs. Discret. Appl. Math. David Pokrass Jacobs, Vilmar Trevisan, Fernando Tura
2018	B	`conf`	Locating the Eigenvalues for Graphs of Small Clique-Width. LATIN Martin Fürer, Carlos Hoppen, David Pokrass Jacobs, Vilmar Trevisan
2017	J	`jnl`	Laplacian Distribution and Domination. Graphs Comb. Domingos M. Cardoso, David Pokrass Jacobs, Vilmar Trevisan
2016	J	`jnl`	Domination number and Laplacian eigenvalue distribution. Eur. J. Comb. Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan
2015	J	`jnl`	A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets. Theor. Comput. Sci. Stephen T. Hedetniemi, David Pokrass Jacobs, K. E. Kennedy
2015	J	`jnl`	Diagonalization of generalized lollipop graphs. Electron. Notes Discret. Math. Renata R. Del-Vecchio, David Pokrass Jacobs, Vilmar Trevisan, Cybele T. M. Vinagre
2014	J	`jnl`	Computing the Characteristic Polynomial of Threshold Graphs. J. Graph Algorithms Appl. David Pokrass Jacobs, Vilmar Trevisan, Fernando Tura
2013	J	`jnl`	Linear-Time Self-Stabilizing Algorithms for Disjoint Independent Sets. Comput. J. Stephen T. Hedetniemi, David Pokrass Jacobs, K. E. Kennedy
2012	B	`conf`	A systematic approach to teaching abstraction and mathematical modeling. ITiCSE Charles T. Cook, Svetlana Drachova-Strang, Jason O. Hallstrom, Joseph E. Hollingsworth, David Pokrass Jacobs, Joan Krone, Murali Sitaraman
2008	Misc	`conf`	Anonymous Daemon Conversion in Self-stabilizing Algorithms by Randomization in Constant Space. ICDCN Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
2008	J	`jnl`	Distance- k knowledge in self-stabilizing algorithms. Theor. Comput. Sci. Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan
2008	J	`jnl`	Self-Stabilizing Graph Protocols. Parallel Process. Lett. Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani, Zhenyu Xu
2006	B	`conf`	Distance- SIROCCO Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan
2006	J	`jnl`	Polynomial recognition of equal unions in hypergraphs with few vertices of large degree. J. Discrete Algorithms David Pokrass Jacobs, Robert E. Jamison
2005	J	`jnl`	Self-Stabilizing Algorithms For Orderings And Colorings. Int. J. Found. Comput. Sci. Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
2005	J	`jnl`	Self-Stabilizing Global Optimization Algorithms for Large Network Graphs. Int. J. Distributed Sens. Networks Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
2004	A	`conf`	Fault Tolerant Algorithms for Orderings and Colorings. IPDPS Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
2004	J	`jnl`	Self-Stabilizing Maximal K-Dependent Sets In Linear Time. Parallel Process. Lett. Martin Gairing, Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs
2003	—	`conf`	A Robust Distributed Generalized Matching Protocol that Stabilizes in Linear Time. ICDCS Workshops Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
2003	A	`conf`	A Self-Stabilizing Distributed Algorithm for Minimal Total Domination in an Arbitrary System Grap. IPDPS Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
2003	J	`jnl`	A search engine for 3D models. ACM Trans. Graph. Thomas A. Funkhouser, Patrick Min, Michael M. Kazhdan, Joyce Chen, J. Alex Halderman, David P. Dobkin, David Pokrass Jacobs
2003	J	`jnl`	Linear time self-stabilizing colorings. Inf. Process. Lett. Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
2003	Misc	`conf`	Self-Stabilizing Distributed Algorithm for Strong Matching in a System Graph. HiPC Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
2003	A	`conf`	Self-Stabilizing Protocols for Maximal Matching and Maximal Independent Sets for Ad Hoc Networks. IPDPS Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
2002	A	`conf`	Fault Tolerant Distributed Coloring Algorithms that Stabilize in Linear Time. IPDPS Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
2001	J	`jnl`	A note on equal unions in families of sets. Discret. Math. David Pokrass Jacobs, Robert E. Jamison
2001	J	`jnl`	An O(n Electron. Notes Discret. Math. David Pokrass Jacobs, Catia Maria dos Santos Machado, Vilmar Trevisan
2001	J	`jnl`	Domination Subdivision Numbers. Discuss. Math. Graph Theory Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, David Pokrass Jacobs, James A. Knisely, Lucas C. van der Merwe
2001	J	`jnl`	Maximal matching stabilizes in time O(m). Inf. Process. Lett. Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
2000	J	`jnl`	A simple heuristic for maximizing service of carousel storage. Comput. Oper. Res. David Pokrass Jacobs, John C. Peck, J. Steve Davis
2000	J	`jnl`	Complexity of Recognizing Equal Unions in Families of Sets. J. Algorithms David Pokrass Jacobs, Robert E. Jamison
2000	—	`conf`	On the complexity of sign-nonsingularity and equal unions of sets. ACM Southeast Regional Conference David Pokrass Jacobs, Robert E. Jamison, Alice A. McRae
1998	J	`jnl`	Independence and Irredundance in k-Regular Graphs. Ars Comb. Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs
1997	J	`jnl`	A Course in Computational Nonassociative Algebra. J. Symb. Comput. David Pokrass Jacobs
1996	J	`jnl`	Maximal Irredundant Functions. Discret. Appl. Math. Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs
1994	B	`conf`	The Albert Nonassociative Algebra System: A Progress Report. ISSAC David Pokrass Jacobs
1994	J	`jnl`	The Private Neighbor Cube. SIAM J. Discret. Math. Michael R. Fellows, Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs
1994	J	`jnl`	Undecidability of Winkler's J. Comb. Theory B David Pokrass Jacobs
1993	J	`jnl`	Efficient Sets in Graphs. Discret. Appl. Math. Philip J. Bernhard, Stephen T. Hedetniemi, David Pokrass Jacobs
1993	J	`jnl`	Experimenting with the Identity (xy)z = y(zx). J. Symb. Comput. Irvin Roy Hentzel, David Pokrass Jacobs, Sekhar V. Muddana
1993	J	`jnl`	The Word Problem for Free Partially Commutative, Partially Associative Groupoids. J. Symb. Comput. David Pokrass Jacobs, Sekhar V. Muddana
1992	J	`jnl`	A condition Guaranteeing Commutativity. Int. J. Algebra Comput. Irvin Roy Hentzel, David Pokrass Jacobs
1992	J	`jnl`	Fast Change of Basis in Algebras. Appl. Algebra Eng. Commun. Comput. Irvin Roy Hentzel, David Pokrass Jacobs
1991	J	`jnl`	Probabilistic Checking of Associativity in Algebras. Inf. Process. Lett. David Pokrass Jacobs
1990	J	`jnl`	Complexity and Unsolvability Properties of Nilpotency. SIAM J. Comput. Irvin Roy Hentzel, David Pokrass Jacobs
1990	J	`jnl`	On the computational complexity of upper fractional domination. Discret. Appl. Math. Grant A. Cheston, Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs
1988	B	`conf`	Verification of Non-Identities in Algebras. ISSAC Irvin Roy Hentzel, David Pokrass Jacobs