Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
David Pokrass Jacobs
2000 – 2009
- 2008
[j26]Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani, Zhenyu Xu: Self-Stabilizing Graph Protocols. Parallel Processing Letters 18(1): 189-199 (2008)- [j25]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
- [j24]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
- [j23]Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani: Self-Stabilizing Global Optimization Algorithms for Large Network Graphs. IJDSN 1(3&4): 329-344 (2005)
- [j22]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
- [j21]Martin Gairing, Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs: Self-Stabilizing Maximal K-Dependent Sets In Linear Time. Parallel Processing Letters 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
- [j20]Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani: Linear time self-stabilizing colorings. Inf. Process. Lett. 87(5): 251-255 (2003)
- [j19]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
- [j18]David Pokrass Jacobs, Robert E. Jamison: A note on equal unions in families of sets. Discrete Mathematics 241(1-3): 387-393 (2001)
- [j17]Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, David Pokrass Jacobs, James A. Knisely, Lucas C. van der Merwe: Domination Subdivision Numbers. Discussiones Mathematicae Graph Theory 21(2): 239-253 (2001)
- [j16]David Pokrass Jacobs, Catia M. S. Machado, Vilmar Trevisan: An O(n2) Algorithm for the Characteristic Polynomial of a Tree. Electronic Notes in Discrete Mathematics 7: 86-89 (2001)
- [j15]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
- [j14]David Pokrass Jacobs, John C. Peck, J. Steve Davis: A simple heuristic for maximizing service of carousel storage. Computers & OR 27(13): 1351-1356 (2000)
- [j13]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
- [j12]Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs: Independence and Irredundance in k-Regular Graphs. Ars Comb. 49 (1998)
- 1997
- [j11]David Pokrass Jacobs: A Course in Computational Nonassociative Algebra. J. Symb. Comput. 23(5/6): 497-502 (1997)
- 1996
- [j10]Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs: Maximal Irredundant Functions. Discrete Applied Mathematics 68(3): 267-277 (1996)
- 1994
- [j9]David Pokrass Jacobs: Undecidability of Winkler's r-Neighborhood Problem for Covering Digraphs. J. Comb. Theory, Ser. B 60(2): 254-267 (1994)
- [j8]Michael R. Fellows, Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs: The Private Neighbor Cube. SIAM J. Discrete Math. 7(1): 41-47 (1994)
- [c2]David Pokrass Jacobs: The Albert Nonassociative Algebra System: A Progress Report. ISSAC 1994: 41-44
- 1993
- [j7]Philip J. Bernhard, Stephen T. Hedetniemi, David Pokrass Jacobs: Efficient Sets in Graphs. Discrete Applied Mathematics 44(1-3): 99-108 (1993)
- [j6]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)
- [j5]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
- [j4]Irvin Roy Hentzel, David Pokrass Jacobs: Fast Change of Basis in Algebras. Appl. Algebra Eng. Commun. Comput. 3: 257-261 (1992)
- 1991
- [j3]David Pokrass Jacobs: Probabilistic Checking of Associativity in Algebras. Inf. Process. Lett. 37(4): 187-191 (1991)
- 1990
- [j2]Grant A. Cheston, Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs: On the computational complexity of upper fractional domination. Discrete Applied Mathematics 27(3): 195-207 (1990)
- [j1]Irvin Roy Hentzel, David Pokrass Jacobs: Complexity and Unsolvability Properties of Nilpotency. SIAM J. Comput. 19(1): 32-43 (1990)
1980 – 1989
- 1988
- [c1]Irvin Roy Hentzel, David Pokrass Jacobs: Verification of Non-Identities in Algebras. ISSAC 1988: 496-507
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-11-16 23:53 CET by the dblp team