William E. Wright

23 papers B 1Journal 17Unranked 5
YearRankTypeTitle / Venue / Authors
2004 J jnl
A Markov chain model for dynamic binary search tree behaviour.
Int. J. Comput. Math.
William E. Wright
2001 J jnl
An Efficient Video-on-Demand Model.
Computer
William E. Wright
2001 — conf
Balancing the Workload in Video-On-Demand Systems.
International Conference on Internet Computing (1)
William E. Wright
1999 J jnl
A Refinement of Replacement Selection.
Inf. Process. Lett.
William E. Wright
1993 J jnl
Success Rate of Interpolation in Subsegment Prediction.
Softw. Pract. Exp.
William E. Wright, Sakthirel Jeyaratnam
1991 J jnl
Parallel Algorithms for Generating the Raster Representation of Straight Lines and Circles.
J. Parallel Distributed Comput.
William E. Wright
1990 J jnl
Parallelization of Bresenham's line and circle algorithms.
IEEE Computer Graphics and Applications
William E. Wright
1989 J jnl
A Model of the Dynamic Behavior of B-Trees.
Acta Informatica
Carl Langenhop, William E. Wright
1988 J jnl
Certain Occupancy Numbers via an Algorithm for Computing Their Ratios.
SIAM J. Discret. Math.
Carl Langenhop, William E. Wright
1987 J jnl
A Note on External Sorting Using Almost Single Input Buffering.
Inf. Process. Lett.
William E. Wright
1986 J jnl
Probabilities Related to Father-Son Distances in Binary Search Trees.
SIAM J. Comput.
Carl Langenhop, William E. Wright
1985 — conf
An Efficient Model for Representing and Analyzing B-Trees.
ACM Annual Conference
Carl Langenhop, William E. Wright
1985 J jnl
Some Average Performance Measures for the B-Tree.
Acta Informatica
William E. Wright
1983 J jnl
Some File Structure Considerations Pertaining to Magnetic Bubble Memory.
Comput. J.
William E. Wright
1982 J jnl
Single Versus Double Buffering in Constrained Merging.
Comput. J.
William E. Wright
1981 J jnl
A survey of interactive computing support in American colleges and universities.
ACM SIGCSE Bull.
William E. Wright, Robert J. McGlinn, J. Archer Harris
1981 J jnl
Binary Search Trees in Secondary Memory.
Acta Informatica
William E. Wright
1980 — conf
An empirical evaluation of algorithms for dynamically maintaining binary search trees.
ACM Annual Conference
William E. Wright
1979 B conf
An AVL algorithm for secondary memory.
COMPSAC
William E. Wright
1979 — conf
Organizing and accessing files for magnetic bubble memory and charge coupled devices.
ACM Annual Conference
William E. Wright
1978 — conf
Dynamic Binary Search Trees.
ACM Annual Conference (1)
William E. Wright
1977 J jnl
Gravitational clustering.
Pattern Recognit.
William E. Wright
1973 J jnl
A formalization of cluster analysis.
Pattern Recognit.
William E. Wright