- CSB - MetaPress - Google - Bing - Yahoo
 | 1996 | |
|---|---|---|
| j5 |      | 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 | ||
| j4 | | 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 | ||
| j3 | | 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 | ||
| j2 | | 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 | ||
| c2 |  | Shietung Peng, A. B. Stephens, Yelena Yesha: Algorithms for a K-Tree Core of a Tree. ICCI 1992: 38-41 |
| c1 | | A. B. Stephens, Yelena Yesha, Keith E. Humenik: Optimal Allocation for Partially Replicated Database Systems on Ring Networks. ICCI 1992: 470-473 |
| 1991 | ||
| j1 | | 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) |
| 1 | Keith E. Humenik | |
| 2 | Peter Matthews | |
| 3 | Shietung Peng | |
| 4 | Louis W. Shapiro | |
| 5 | Yelena Yesha |
Data released under the ODC-BY 1.0 license — See also our legal information page