A. B. Stephens

According to our database, A. B. Stephens authored at least 6 papers between 1991 and 1996.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

1996

Minimizing message complexity of partially replicated data on hypercubes.

Keith E. Humenik, Peter Matthews, A. B. Stephens, Yelena Yesha

Networks, 1996

1995

A Lower Bound on the Probability of Conflict Under Nonuniform Access in Database Systems.

Keith E. Humenik, Peter Matthews, A. B. Stephens, Yelena Yesha

Algorithmica, 1995

1993

Algorithms for a Core and k-Tree Core of a Tree.

Shietung Peng, A. B. Stephens, Yelena Yesha

J. Algorithms, 1993

1992

Optimal Allocation for Partially Replicated Database Systems on Ring Networks.

A. B. Stephens, Yelena Yesha, Keith E. Humenik

Proceedings of the Computing and Information, 1992

Algorithms for a K-Tree Core of a Tree.

Shietung Peng, A. B. Stephens, Yelena Yesha

Proceedings of the Computing and Information, 1992

1991

Bootstrap Percolation, the Schröder Numbers, and the <i>N</i>-Kings Problem.

Louis W. Shapiro, A. B. Stephens

SIAM J. Discret. Math., 1991