David Pokrass Jacobs - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 44 from 44

2021

Most Laplacian eigenvalues of a tree are smallDavid Pokrass Jacobs, Elismar R. Oliveira, Vilmar Trevisan. jctb, 146:1-33, 2021. [doi]

2016

Domination number and Laplacian eigenvalue distributionStephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan. ejc, 53:66-71, 2016. [doi]

2015

Diagonalization of generalized lollipop graphsRenata R. Del-Vecchio, David Pokrass Jacobs, Vilmar Trevisan, Cybele T. M. Vinagre. endm, 50:41-46, 2015. [doi]

A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating setsStephen T. Hedetniemi, David Pokrass Jacobs, K. E. Kennedy. TCS, 593:132-138, 2015. [doi]

2014

Computing the Characteristic Polynomial of Threshold GraphsDavid Pokrass Jacobs, Vilmar Trevisan, Fernando Tura. jgaa, 18(5):709-719, 2014. [doi]

2013

Linear-Time Self-Stabilizing Algorithms for Disjoint Independent SetsStephen T. Hedetniemi, David Pokrass Jacobs, K. E. Kennedy. cj, 56(11):1381-1387, 2013. [doi]

2008

2006

Distance-::::k:::: Information in Self-stabilizing AlgorithmsWayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan. sirocco 2006: 349-356 [doi]

Polynomial recognition of equal unions in hypergraphs with few vertices of large degreeDavid Pokrass Jacobs, Robert E. Jamison. jda, 4(2):201-208, 2006. [doi]

2005

Self-Stabilizing Algorithms For Orderings And ColoringsWayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani. ijfcs, 16(1):19-36, 2005. [doi]

Self-Stabilizing Global Optimization Algorithms for Large Network GraphsWayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani. ijdsn, 1(3&4):329-344, 2005. [doi]

2004

Self-Stabilizing Maximal K-Dependent Sets In Linear TimeMartin Gairing, Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs. ppl, 14(1):75-82, 2004. [doi]

Fault Tolerant Algorithms for Orderings and ColoringsWayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani. ipps 2004: [doi]

2003

A search engine for 3D modelsThomas A. Funkhouser, Patrick Min, Michael M. Kazhdan, Joyce Chen, J. Alex Halderman, David P. Dobkin, David Pokrass Jacobs. tog, 22(1):83-105, 2003. [doi]

Self-Stabilizing Protocols for Maximal Matching and Maximal Independent Sets for Ad Hoc NetworksWayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani. ipps 2003: 162 [doi]

A Self-Stabilizing Distributed Algorithm for Minimal Total Domination in an Arbitrary System GrapWayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani. ipps 2003: 240 [doi]

A Robust Distributed Generalized Matching Protocol that Stabilizes in Linear TimeWayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani. icdcsw 2003: 461-465 [doi]

Self-Stabilizing Distributed Algorithm for Strong Matching in a System GraphWayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani. hipc 2003: 66-73 [doi]

Linear time self-stabilizing coloringsStephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani. ipl, 87(5):251-255, 2003. [doi]

2002

Fault Tolerant Distributed Coloring Algorithms that Stabilize in Linear TimeStephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani. ipps 2002: [doi]

2001

2000

A simple heuristic for maximizing service of carousel storageDavid Pokrass Jacobs, John C. Peck, J. Steve Davis. cor, 27(13):1351-1356, 2000. [doi]

On the complexity of sign-nonsingularity and equal unions of setsDavid Pokrass Jacobs, Robert E. Jamison, Alice A. McRae. ACMse 2000: 232-234 [doi]

Complexity of Recognizing Equal Unions in Families of SetsDavid Pokrass Jacobs, Robert E. Jamison. jal, 37(2):495-504, 2000.

1998

Independence and Irredundance in k-Regular GraphsGerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs. arscom, 49, 1998.

1997

A Course in Computational Nonassociative AlgebraDavid Pokrass Jacobs. JSC, 23(5/6):497-502, 1997.

1996

Maximal Irredundant FunctionsGerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs. DAM, 68(3):267-277, 1996. [doi]

1994

The Private Neighbor CubeMichael R. Fellows, Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs. siamdm, 7(1):41-47, 1994. [doi]

The Albert Nonassociative Algebra System: A Progress ReportDavid Pokrass Jacobs. issac 1994: 41-44 [doi]

Undecidability of Winkler s ::::r::::-Neighborhood Problem for Covering DigraphsDavid Pokrass Jacobs. JCT, 60(2):254-267, 1994. [doi]

1993

Efficient Sets in GraphsPhilip J. Bernhard, Stephen T. Hedetniemi, David Pokrass Jacobs. DAM, 44(1-3):99-108, 1993. [doi]

Experimenting with the Identity (xy)z = y(zx)Irvin Roy Hentzel, David Pokrass Jacobs, Sekhar V. Muddana. JSC, 16(3):289-293, 1993.

The Word Problem for Free Partially Commutative, Partially Associative GroupoidsDavid Pokrass Jacobs, Sekhar V. Muddana. JSC, 16(6):557-562, 1993.

1992

Fast Change of Basis in AlgebrasIrvin Roy Hentzel, David Pokrass Jacobs. aaecc, 3:257-261, 1992.

A condition Guaranteeing CommutativityIrvin Roy Hentzel, David Pokrass Jacobs. ijac, 2(3):291-296, 1992. [doi]

1991

Probabilistic Checking of Associativity in AlgebrasDavid Pokrass Jacobs. ipl, 37(4):187-191, 1991.

1990

On the computational complexity of upper fractional dominationGrant A. Cheston, Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs. DAM, 27(3):195-207, 1990. [doi]

Complexity and Unsolvability Properties of NilpotencyIrvin Roy Hentzel, David Pokrass Jacobs. SICOMP, 19(1):32-43, 1990.

1988

Verification of Non-Identities in AlgebrasIrvin Roy Hentzel, David Pokrass Jacobs. issac 1989: 496-507

Sign in or sign up to see more results.

runs on WebDSL