| |
| 2004 | ||
|---|---|---|
| 18 | EE | William E. Wright: A Markov chain model for dynamic binary search tree behaviour. Int. J. Comput. Math. 81(7): 803-812 (2004) |
| 2001 | ||
| 17 | William E. Wright: Balancing the Workload in Video-On-Demand Systems. International Conference on Internet Computing (1) 2001: 306-310 | |
| 16 | EE | William E. Wright: An Efficient Video-on-Demand Model. IEEE Computer 34(5): 64-70 (2001) |
| 1999 | ||
| 15 | EE | William E. Wright: A Refinement of Replacement Selection. Inf. Process. Lett. 70(3): 107-111 (1999) |
| 1993 | ||
| 14 | William E. Wright, Sakthirel Jeyaratnam: Success Rate of Interpolation in Subsegment Prediction. Softw., Pract. Exper. 23(3): 243-253 (1993) | |
| 1991 | ||
| 13 | William E. Wright: Parallel Algorithms for Generating the Raster Representation of Straight Lines and Circles. J. Parallel Distrib. Comput. 11(2): 170-174 (1991) | |
| 1989 | ||
| 12 | Carl Langenhop, William E. Wright: A Model of the Dynamic Behavior of B-Trees. Acta Inf. 27(1): 41-59 (1989) | |
| 1988 | ||
| 11 | Carl Langenhop, William E. Wright: Certain Occupancy Numbers via an Algorithm for Computing Their Ratios. SIAM J. Discrete Math. 1(3): 360-371 (1988) | |
| 1987 | ||
| 10 | William E. Wright: A Note on External Sorting Using Almost Single Input Buffering. Inf. Process. Lett. 24(6): 403-405 (1987) | |
| 1986 | ||
| 9 | Carl Langenhop, William E. Wright: Probabilities Related to Father-Son Distances in Binary Search Trees. SIAM J. Comput. 15(2): 520-530 (1986) | |
| 1985 | ||
| 8 | Carl Langenhop, William E. Wright: An Efficient Model for Representing and Analyzing B-Trees. ACM Annual Conference - The range of computing: mid-80's perspective 1985: 35-40 | |
| 7 | William E. Wright: Some Average Performance Measures for the B-Tree. Acta Inf. 21: 541-557 (1985) | |
| 1983 | ||
| 6 | William E. Wright: Some File Structure Considerations Pertaining to Magnetic Bubble Memory. Comput. J. 26(1): 43-51 (1983) | |
| 1982 | ||
| 5 | William E. Wright: Single Versus Double Buffering in Constrained Merging. Comput. J. 25(2): 227-230 (1982) | |
| 1981 | ||
| 4 | William E. Wright: Binary Search Trees in Secondary Memory. Acta Inf. 15: 3-17 (1981) | |
| 1978 | ||
| 3 | EE | William E. Wright: Dynamic Binary Search Trees. ACM Annual Conference (1) 1978: 370-374 |
| 1977 | ||
| 2 | EE | William E. Wright: Gravitational clustering. Pattern Recognition 9(3): 151-166 (1977) |
| 1973 | ||
| 1 | EE | William E. Wright: A formalization of cluster analysis. Pattern Recognition 5(3): 273-282 (1973) |
| 1 | Sakthirel Jeyaratnam | [14] |
| 2 | Carl Langenhop | [8] [9] [11] [12] |