Paul Emerson Wright

Born:

place:

B.S. Cornell University; M.S. University of California at Berkeley 1986

Ph.D. University of California, Berkeley 1988

thesis:Darboux Transformations, Algebraic Subvarieties of Grassman Manifolds, Commuting Flows and Bispectratity; Advisor: Francisco Grunbaumarea: Graph Theory

: finance

URL:

Was at AT&T labs

Research

publications

- Fishburn, Peter;
Wright, PaulBandwidth edge counts for linear arrangements of rectangular grids. J. Graph Theory26(1997), no. 4, 195--202.- Hwang, Frank K.;
Wright, Paul E.; Hu, X. D.Exact reliabilities of most reliable double-loop networks. Networks30(1997), no. 2, 81--90.- Bernstein, M.; Sloane, N. J. A.;
Wright, Paul E.On sublattices of the hexagonal lattice. Discrete Math.170(1997), no. 1-3, 29--39.- Hwang, Frank K.;
Wright, Paul E.Generalized Kaplansky line and cycle theorems with multiple constraints. Combinatorics and graph theory '95, Vol.1(Hefei), 173--185, World Sci. Publishing, River Edge, NJ, 1995.- Hwang, Frank K.;
Wright, Paul E.An $O(n\log n)$ algorithm for the generalized birthday problem. Comput. Statist. Data Anal.23(1997), no. 4, 443--451.- Hwang, Frank K.;
Wright, Paul E.Efficient algorithms for the reliabilities of replicated $n$-parallel-task graphs. Oper. Res. Lett.19(1996), no. 4, 171--174.- Baccelli, François; Massey, William A.;
Wright, Paul E.Determining the exit time distribution for a closed cyclic network. Theoret. Comput. Sci.125(1994), no. 1, 149--165.- Coffman, E. G., Jr.; Flatto, Leopold;
Wright, Paul E.Stochastic machine minimization with constant service times. Math. Oper. Res.18(1993), no. 2, 300--316.- Coffman, E. G., Jr.; Flatto, Leopold; Poonen, Bjorn;
Wright, Paul E.The processor minimization problem with independent waiting-time constraints. Theoret. Comput. Sci.125(1994), no. 1, 3--16.- Coffman, E. G., Jr.; Flatto, Leopold;
Wright, Paul E.A stochastic checkpoint optimization problem. SIAM J. Comput.22(1993), no. 3, 650--659.- Coffman, E. G., Jr.; Flatto, Leopold;
Wright, Paul E.Optimal stochastic allocation of machines under waiting-time constraints. SIAM J. Comput.22(1993), no. 2, 332--348.Wright, Paul E.Two parallel processors with coupled inputs. Adv. in Appl. Probab.24(1992), no. 4, 986--1007.- Browne, Sid; Coffman, E. G., Jr.; Gilbert, E. N.;
Wright, Paul E.The gated infinite-server queue: uniform service times. SIAM J. Appl. Math.52(1992), no. 6, 1751--1762.Wright, Paul E.Finite symmetric convolution operators and singular symmetric differential operators. J. Math. Anal. Appl. 148 (1990), no. 2, 538--547.Wright, Paul E.Statistical complexity of the power method for Markov chains. J. Complexity 5 (1989), no. 2, 119--143.

The web pages

**MATHEMATICIANS OF THE AFRICAN DIASPORA**

are brought to you by

The Mathematics Department of

The State University of New York at Buffalo.

They are created and maintained
by

Scott W. Williams

Professor of Mathematics