The following pages link to Paul E. Wright (Q1003313):
Displaying 25 items.
- The ratio of the extreme to the sum in a random sequence (Q1003314) (← links)
- Statistical complexity of the power method for Markov chains (Q1122306) (← links)
- The processor minimization problem with independent waiting-time constraints (Q1318710) (← links)
- Determining the exit time distribution for a closed cyclic network (Q1318720) (← links)
- Efficient algorithms for the reliabilities of replicated \(n\)-parallel-task graphs (Q1360110) (← links)
- An O(n log n) algorithm for the generalized birthday problem (Q1391985) (← links)
- Interference patterns in bijective colorings of 2-regular graphs (Q1566572) (← links)
- Finite symmetric convolution operators and singular symmetric differential operators (Q1813903) (← links)
- Gated, Exhaustive, Parallel Service (Q3416045) (← links)
- A Traffic Overflow System With a Large Primary Queue (Q3956720) (← links)
- Two parallel processors with coupled inputs (Q4024527) (← links)
- Optimal Stochastic Allocation of Machines under Waiting-Time Constraints (Q4032942) (← links)
- The Gated Infinite-Server Queue: Uniform Service Times (Q4037676) (← links)
- A Stochastic Checkpoint Optimization Problem (Q4202217) (← links)
- Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions (Q4229475) (← links)
- Processor-shared buffers with reneging (Q4279041) (← links)
- (Q4325371) (← links)
- Exact reliabilities of most reliable double-loop networks (Q4361178) (← links)
- A unique arithmetic labeling of hexagonal lattices (Q4373376) (← links)
- Bandwidth edge counts for linear arrangements of rectangular grids (Q4376494) (← links)
- Interference-Minimizing Colorings of Regular Graphs (Q4388976) (← links)
- Survival reliability of some double-loop networks and chordal rings (Q4421141) (← links)
- Interference Patterns in Regular Graphs with Bijective Colorings (Q4785691) (← links)
- (Q4895137) (← links)
- Stochastic Machine Minimization with Constant Service Times (Q5287984) (← links)
