default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Pokrass Jacobs
Person information
- affiliation: Clemson University, SC, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j37]David Pokrass Jacobs, Elismar R. Oliveira
, Vilmar Trevisan:
Most Laplacian eigenvalues of a tree are small. J. Comb. Theory B 146: 1-33 (2021)
2010 – 2019
- 2018
- [j36]David Pokrass Jacobs, Vilmar Trevisan, Fernando Tura:
Eigenvalue location in cographs. Discret. Appl. Math. 245: 220-235 (2018) - [c13]Martin Fürer, Carlos Hoppen, David Pokrass Jacobs, Vilmar Trevisan:
Locating the Eigenvalues for Graphs of Small Clique-Width. LATIN 2018: 475-489 - 2017
- [j35]Domingos M. Cardoso, David Pokrass Jacobs, Vilmar Trevisan:
Laplacian Distribution and Domination. Graphs Comb. 33(5): 1283-1295 (2017) - 2016
- [j34]Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan:
Domination number and Laplacian eigenvalue distribution. Eur. J. Comb. 53: 66-71 (2016) - 2015
- [j33]Renata R. Del-Vecchio, David Pokrass Jacobs, Vilmar Trevisan, Cybele T. M. Vinagre:
Diagonalization of generalized lollipop graphs. Electron. Notes Discret. Math. 50: 41-46 (2015) - [j32]Stephen T. Hedetniemi, David Pokrass Jacobs, K. E. Kennedy:
A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets. Theor. Comput. Sci. 593: 132-138 (2015) - 2014
- [j31]David Pokrass Jacobs, Vilmar Trevisan, Fernando Tura:
Computing the Characteristic Polynomial of Threshold Graphs. J. Graph Algorithms Appl. 18(5): 709-719 (2014) - 2013
- [j30]Stephen T. Hedetniemi, David Pokrass Jacobs, K. E. Kennedy:
Linear-Time Self-Stabilizing Algorithms for Disjoint Independent Sets. Comput. J. 56(11): 1381-1387 (2013) - 2012
- [c12]Charles T. Cook, Svetlana Drachova-Strang, Jason O. Hallstrom, Joseph E. Hollingsworth, David Pokrass Jacobs, Joan Krone, Murali Sitaraman:
A systematic approach to teaching abstraction and mathematical modeling. ITiCSE 2012: 357-362
2000 – 2009
- 2008
- [j29]Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani, Zhenyu Xu:
Self-Stabilizing Graph Protocols. Parallel Process. Lett. 18(1): 189-199 (2008) - [j28]Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan:
Distance- k knowledge in self-stabilizing algorithms. Theor. Comput. Sci. 399(1-2): 118-127 (2008) - [c11]Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani:
Anonymous Daemon Conversion in Self-stabilizing Algorithms by Randomization in Constant Space. ICDCN 2008: 182-190 - 2006
- [j27]David Pokrass Jacobs, Robert E. Jamison:
Polynomial recognition of equal unions in hypergraphs with few vertices of large degree. J. Discrete Algorithms 4(2): 201-208 (2006) - [c10]Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan:
Distance-k Information in Self-stabilizing Algorithms. SIROCCO 2006: 349-356 - 2005
- [j26]Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani:
Self-Stabilizing Global Optimization Algorithms for Large Network Graphs. Int. J. Distributed Sens. Networks 1(3&4): 329-344 (2005) - [j25]Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani:
Self-Stabilizing Algorithms For Orderings And Colorings. Int. J. Found. Comput. Sci. 16(1): 19-36 (2005) - 2004
- [j24]Martin Gairing, Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs:
Self-Stabilizing Maximal K-Dependent Sets In Linear Time. Parallel Process. Lett. 14(1): 75-82 (2004) - [c9]Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani:
Fault Tolerant Algorithms for Orderings and Colorings. IPDPS 2004 - 2003
- [j23]Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani:
Linear time self-stabilizing colorings. Inf. Process. Lett. 87(5): 251-255 (2003) - [j22]Thomas A. Funkhouser, Patrick Min, Michael M. Kazhdan, Joyce Chen, J. Alex Halderman, David P. Dobkin, David Pokrass Jacobs:
A search engine for 3D models. ACM Trans. Graph. 22(1): 83-105 (2003) - [c8]Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani:
Self-Stabilizing Distributed Algorithm for Strong Matching in a System Graph. HiPC 2003: 66-73 - [c7]Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani:
A Robust Distributed Generalized Matching Protocol that Stabilizes in Linear Time. ICDCS Workshops 2003: 461-465 - [c6]Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani:
Self-Stabilizing Protocols for Maximal Matching and Maximal Independent Sets for Ad Hoc Networks. IPDPS 2003: 162 - [c5]Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani:
A Self-Stabilizing Distributed Algorithm for Minimal Total Domination in an Arbitrary System Grap. IPDPS 2003: 240 - 2002
- [c4]Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani:
Fault Tolerant Distributed Coloring Algorithms that Stabilize in Linear Time. IPDPS 2002 - 2001
- [j21]David Pokrass Jacobs, Robert E. Jamison:
A note on equal unions in families of sets. Discret. Math. 241(1-3): 387-393 (2001) - [j20]Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, David Pokrass Jacobs, James A. Knisely, Lucas C. van der Merwe:
Domination Subdivision Numbers. Discuss. Math. Graph Theory 21(2): 239-253 (2001) - [j19]David Pokrass Jacobs, Catia Maria dos Santos Machado, Vilmar Trevisan:
An O(n2) Algorithm for the Characteristic Polynomial of a Tree. Electron. Notes Discret. Math. 7: 86-89 (2001) - [j18]Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani:
Maximal matching stabilizes in time O(m). Inf. Process. Lett. 80(5): 221-223 (2001) - 2000
- [j17]David Pokrass Jacobs, John C. Peck, J. Steve Davis:
A simple heuristic for maximizing service of carousel storage. Comput. Oper. Res. 27(13): 1351-1356 (2000) - [j16]David Pokrass Jacobs, Robert E. Jamison:
Complexity of Recognizing Equal Unions in Families of Sets. J. Algorithms 37(2): 495-504 (2000) - [c3]David Pokrass Jacobs, Robert E. Jamison, Alice A. McRae:
On the complexity of sign-nonsingularity and equal unions of sets. ACM Southeast Regional Conference 2000: 232-234
1990 – 1999
- 1998
- [j15]Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs:
Independence and Irredundance in k-Regular Graphs. Ars Comb. 49 (1998) - 1997
- [j14]David Pokrass Jacobs:
A Course in Computational Nonassociative Algebra. J. Symb. Comput. 23(5/6): 497-502 (1997) - 1996
- [j13]Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs:
Maximal Irredundant Functions. Discret. Appl. Math. 68(3): 267-277 (1996) - 1994
- [j12]David Pokrass Jacobs:
Undecidability of Winkler's r-Neighborhood Problem for Covering Digraphs. J. Comb. Theory B 60(2): 254-267 (1994) - [j11]Michael R. Fellows, Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs:
The Private Neighbor Cube. SIAM J. Discret. Math. 7(1): 41-47 (1994) - [c2]David Pokrass Jacobs:
The Albert Nonassociative Algebra System: A Progress Report. ISSAC 1994: 41-44 - 1993
- [j10]Philip J. Bernhard, Stephen T. Hedetniemi, David Pokrass Jacobs:
Efficient Sets in Graphs. Discret. Appl. Math. 44(1-3): 99-108 (1993) - [j9]Irvin Roy Hentzel, David Pokrass Jacobs, Sekhar V. Muddana:
Experimenting with the Identity (xy)z = y(zx). J. Symb. Comput. 16(3): 289-293 (1993) - [j8]David Pokrass Jacobs, Sekhar V. Muddana:
The Word Problem for Free Partially Commutative, Partially Associative Groupoids. J. Symb. Comput. 16(6): 557-562 (1993) - 1992
- [j7]Irvin Roy Hentzel, David Pokrass Jacobs:
Fast Change of Basis in Algebras. Appl. Algebra Eng. Commun. Comput. 3: 257-261 (1992) - [j6]Irvin Roy Hentzel, David Pokrass Jacobs:
A condition Guaranteeing Commutativity. Int. J. Algebra Comput. 2(3): 291-296 (1992) - 1991
- [j5]David Pokrass Jacobs:
Probabilistic Checking of Associativity in Algebras. Inf. Process. Lett. 37(4): 187-191 (1991) - 1990
- [j4]Grant A. Cheston, Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs:
On the computational complexity of upper fractional domination. Discret. Appl. Math. 27(3): 195-207 (1990) - [j3]Irvin Roy Hentzel, David Pokrass Jacobs:
Complexity and Unsolvability Properties of Nilpotency. SIAM J. Comput. 19(1): 32-43 (1990)
1980 – 1989
- 1988
- [j2]Irvin Roy Hentzel, David J. Pokrass:
A Practical Solution for a Large Sparse Matrix. Softw. Pract. Exp. 18(3): 279-283 (1988) - [c1]Irvin Roy Hentzel, David Pokrass Jacobs:
Verification of Non-Identities in Algebras. ISSAC 1988: 496-507 - 1982
- [j1]David J. Pokrass, B.-F. Wu:
An operating systems project using structured methodology. ACM SIGCSE Bull. 14(3): 7-10 (1982)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
