Search the dblp DataBase
David Pokrass Jacobs :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
David Pokrass Jacobs , Robert E. Jamison , Alice A. McRae On the complexity of sign-nonsingularity and equal unions of sets. [Citation Graph (0, 0)][DBLP ] ACM Southeast Regional Conference, 2000, pp:232-234 [Conf ] Wayne Goddard , Stephen T. Hedetniemi , David Pokrass Jacobs , Pradip K. Srimani Self-Stabilizing Distributed Algorithm for Strong Matching in a System Graph. [Citation Graph (0, 0)][DBLP ] HiPC, 2003, pp:66-73 [Conf ] Wayne Goddard , Stephen T. Hedetniemi , David Pokrass Jacobs , Pradip K. Srimani A Robust Distributed Generalized Matching Protocol that Stabilizes in Linear Time. [Citation Graph (0, 0)][DBLP ] ICDCS Workshops, 2003, pp:461-465 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] IPDPS, 2003, pp:162- [Conf ] 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. [Citation Graph (0, 0)][DBLP ] IPDPS, 2003, pp:240- [Conf ] Wayne Goddard , Stephen T. Hedetniemi , David Pokrass Jacobs , Pradip K. Srimani Fault Tolerant Algorithms for Orderings and Colorings. [Citation Graph (0, 0)][DBLP ] IPDPS, 2004, pp:- [Conf ] Stephen T. Hedetniemi , David Pokrass Jacobs , Pradip K. Srimani Fault Tolerant Distributed Coloring Algorithms that Stabilize in Linear Time. [Citation Graph (0, 0)][DBLP ] IPDPS, 2002, pp:- [Conf ] Irvin Roy Hentzel , David Pokrass Jacobs Verification of Non-Identities in Algebras. [Citation Graph (0, 0)][DBLP ] ISSAC, 1988, pp:496-507 [Conf ] David Pokrass Jacobs The Albert Nonassociative Algebra System: A Progress Report. [Citation Graph (0, 0)][DBLP ] ISSAC, 1994, pp:41-44 [Conf ] Wayne Goddard , Stephen T. Hedetniemi , David Pokrass Jacobs , Vilmar Trevisan Distance-k Information in Self-stabilizing Algorithms. [Citation Graph (0, 0)][DBLP ] SIROCCO, 2006, pp:349-356 [Conf ] Irvin Roy Hentzel , David Pokrass Jacobs Fast Change of Basis in Algebras. [Citation Graph (0, 0)][DBLP ] Appl. Algebra Eng. Commun. Comput., 1992, v:3, n:, pp:257-261 [Journal ] Gerd Fricke , Stephen T. Hedetniemi , David Pokrass Jacobs Independence and Irredundance in k-Regular Graphs. [Citation Graph (0, 0)][DBLP ] Ars Comb., 1998, v:49, n:, pp:- [Journal ] David Pokrass Jacobs , John C. Peck , J. Steve Davis A simple heuristic for maximizing service of carousel storage. [Citation Graph (0, 0)][DBLP ] Computers & OR, 2000, v:27, n:13, pp:1351-1356 [Journal ] Philip J. Bernhard , Stephen T. Hedetniemi , David Pokrass Jacobs Efficient Sets in Graphs. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:99-108 [Journal ] Gerd Fricke , Stephen T. Hedetniemi , David Pokrass Jacobs Maximal Irredundant Functions. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1996, v:68, n:3, pp:267-277 [Journal ] David Pokrass Jacobs , Robert E. Jamison A note on equal unions in families of sets. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:241, n:1-3, pp:387-393 [Journal ] Wayne Goddard , Stephen T. Hedetniemi , David Pokrass Jacobs , Pradip K. Srimani Self-Stabilizing Algorithms For Orderings And Colorings. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2005, v:16, n:1, pp:19-36 [Journal ] Stephen T. Hedetniemi , David Pokrass Jacobs , Pradip K. Srimani Maximal matching stabilizes in time O(m). [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2001, v:80, n:5, pp:221-223 [Journal ] Stephen T. Hedetniemi , David Pokrass Jacobs , Pradip K. Srimani Linear time self-stabilizing colorings. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2003, v:87, n:5, pp:251-255 [Journal ] David Pokrass Jacobs Probabilistic Checking of Associativity in Algebras. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:37, n:4, pp:187-191 [Journal ] David Pokrass Jacobs , Robert E. Jamison Complexity of Recognizing Equal Unions in Families of Sets. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 2000, v:37, n:2, pp:495-504 [Journal ] David Pokrass Jacobs Undecidability of Winkler's r -Neighborhood Problem for Covering Digraphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1994, v:60, n:2, pp:254-267 [Journal ] David Pokrass Jacobs , Robert E. Jamison Polynomial recognition of equal unions in hypergraphs with few vertices of large degree. [Citation Graph (0, 0)][DBLP ] J. Discrete Algorithms, 2006, v:4, n:2, pp:201-208 [Journal ] David Pokrass Jacobs A Course in Computational Nonassociative Algebra. [Citation Graph (0, 0)][DBLP ] J. Symb. Comput., 1997, v:23, n:5/6, pp:497-502 [Journal ] David Pokrass Jacobs , Sekhar V. Muddana The Word Problem for Free Partially Commutative, Partially Associative Groupoids. [Citation Graph (0, 0)][DBLP ] J. Symb. Comput., 1993, v:16, n:6, pp:557-562 [Journal ] Irvin Roy Hentzel , David Pokrass Jacobs , Sekhar V. Muddana Experimenting with the Identity (xy)z = y(zx). [Citation Graph (0, 0)][DBLP ] J. Symb. Comput., 1993, v:16, n:3, pp:289-293 [Journal ] Martin Gairing , Wayne Goddard , Stephen T. Hedetniemi , David Pokrass Jacobs Self-Stabilizing Maximal K-Dependent Sets In Linear Time. [Citation Graph (0, 0)][DBLP ] Parallel Processing Letters, 2004, v:14, n:1, pp:75-82 [Journal ] Irvin Roy Hentzel , David Pokrass Jacobs Complexity and Unsolvability Properties of Nilpotency. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1990, v:19, n:1, pp:32-43 [Journal ] Michael R. Fellows , Gerd Fricke , Stephen T. Hedetniemi , David Pokrass Jacobs The Private Neighbor Cube. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1994, v:7, n:1, pp:41-47 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] ACM Trans. Graph., 2003, v:22, n:1, pp:83-105 [Journal ] Anonymous Daemon Conversion in Self-stabilizing Algorithms by Randomization in Constant Space. [Citation Graph (, )][DBLP ] On the computational complexity of upper fractional domination. [Citation Graph (, )][DBLP ] Search in 0.002secs, Finished in 0.303secs