#### Filter Results:

- Full text PDF available (19)

#### Publication Year

1988

2016

- This year (0)
- Last 5 years (5)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Thomas A. Funkhouser, Patrick Min, +4 authors David Pokrass Jacobs
- ACM Trans. Graph.
- 2003

As the number of 3D models available on the Web grows, there is an increasing need for a search engine to help people find them. Unfortunately, traditional text-based search techniques are not alwaysâ€¦ (More)

- Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
- Inf. Process. Lett.
- 2003

We propose two new self-stabilizing distributed algorithms for proper âˆ†+1 (âˆ† is the maximum degree of a node in the graph) colorings of arbitrary system graphs. Both algorithms are capable of workingâ€¦ (More)

- Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani, Zhenyu Xu
- Parallel Processing Letters
- 2008

We provide self-stabilizing algorithms to obtain and maintain a maximal matching, maximal independent set or minimal dominating set in a given system graph. They converge in linear rounds under aâ€¦ (More)

- Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan
- Theor. Comput. Sci.
- 2008

Many graph problems seem to require knowledge that extends beyond the immediate neighbors of a node. The usual self-stabilizing model only allows for nodes to make decisions based on the states ofâ€¦ (More)

We propose a generalized scheme that can convert any algorithm that self-stabilizes under an unfair central daemon into a randomized one that self-stabilizes under a distributed daemon, using onlyâ€¦ (More)

- Grant A. Cheston, Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs
- Discrete Applied Mathematics
- 1990

This paper studies a nondiscrete generalization of T(G), the maximum cardinality of a minimal dominating set in a graph G = (K:E). In particular, a real-valued function f : V+ [0, l] is dominating ifâ€¦ (More)

In a graph , a set is said to be total dominating if every is adjacent to some member of . When the graph represents a communication network, a total dominating set corresponds to a collection ofâ€¦ (More)

- Martin Gairing, Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs
- Parallel Processing Letters
- 2004

In a graph or network G = (V;E), a set S V is k-dependent if no node in S has more than k neighbors in S. We show that for each k 0 there is a self-stabilizing algorithm that identi es a maximalâ€¦ (More)

- David Pokrass Jacobs, Robert E. Jamison
- Discrete Mathematics
- 2001

A family of sets has the equal union property if and only if there exist two nonempty disjoint subfamilies having the same union. We prove that any n nonempty subsets of an n-element set have theâ€¦ (More)