| 1996 |
|---|
| 7 | EE | Keith E. Humenik,
Peter Matthews,
A. B. Stephens,
Yelena Yesha:
Minimizing message complexity of partially replicated data on hypercubes.
Networks 28(2): 87-95 (1996) |
| 1995 |
|---|
| 6 | | Keith E. Humenik,
Peter Matthews,
A. B. Stephens,
Yelena Yesha:
A Lower Bound on the Probability of Conflict Under Nonuniform Access in Database Systems.
Algorithmica 13(3): 283-312 (1995) |
| 1994 |
|---|
| 5 | EE | A. B. Stephens,
Yelena Yesha,
Keith E. Humenik:
Optimal Allocation for Partially Replicated Database Systems on Ring Networks.
IEEE Trans. Knowl. Data Eng. 6(6): 975-982 (1994) |
| 1993 |
|---|
| 4 | | Shietung Peng,
A. B. Stephens,
Yelena Yesha:
Algorithms for a Core and k-Tree Core of a Tree.
J. Algorithms 15(1): 143-159 (1993) |
| 1992 |
|---|
| 3 | | Shietung Peng,
A. B. Stephens,
Yelena Yesha:
Algorithms for a K-Tree Core of a Tree.
ICCI 1992: 38-41 |
| 2 | | A. B. Stephens,
Yelena Yesha,
Keith E. Humenik:
Optimal Allocation for Partially Replicated Database Systems on Ring Networks.
ICCI 1992: 470-473 |
| 1991 |
|---|
| 1 | | Louis W. Shapiro,
A. B. Stephens:
Bootstrap Percolation, the Schröder Numbers, and the N-Kings Problem.
SIAM J. Discrete Math. 4(2): 275-280 (1991) |
