We stand with Ukraine  

William E. Wright

According to our database1, William E. Wright authored at least 23 papers between 1973 and 2004.

Collaborative distances:
  • Dijkstra number2 of six.
  • Erdős number3 of six.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2004
A Markov chain model for dynamic binary search tree behaviour.
[BibTeX]
[DOI]
William E. Wright
Int. J. Comput. Math., 2004

2001
An Efficient Video-on-Demand Model.
[BibTeX]
[DOI]
William E. Wright
Computer, 2001

Balancing the Workload in Video-On-Demand Systems.
[BibTeX]
William E. Wright
Proceedings of the International Conference on Internet Computing, 2001

1999
A Refinement of Replacement Selection.
[BibTeX]
[DOI]
William E. Wright
Inf. Process. Lett., 1999

1993
Success Rate of Interpolation in Subsegment Prediction.
[BibTeX]
[DOI]
William E. Wright
,
Sakthirel Jeyaratnam
Softw. Pract. Exp., 1993

1991
Parallel Algorithms for Generating the Raster Representation of Straight Lines and Circles.
[BibTeX]
[DOI]
William E. Wright
J. Parallel Distributed Comput., 1991

1990
Parallelization of Bresenham's line and circle algorithms.
[BibTeX]
[DOI]
William E. Wright
IEEE Computer Graphics and Applications, 1990

1989
A Model of the Dynamic Behavior of B-Trees.
[BibTeX]
[DOI]
Carl Langenhop
,
William E. Wright
Acta Informatica, 1989

1988
Certain Occupancy Numbers via an Algorithm for Computing Their Ratios.
[BibTeX]
[DOI]
Carl Langenhop
,
William E. Wright
SIAM J. Discret. Math., 1988

1987
A Note on External Sorting Using Almost Single Input Buffering.
[BibTeX]
[DOI]
William E. Wright
Inf. Process. Lett., 1987

1986
Probabilities Related to Father-Son Distances in Binary Search Trees.
[BibTeX]
[DOI]
Carl Langenhop
,
William E. Wright
SIAM J. Comput., 1986

1985
Some Average Performance Measures for the B-Tree.
[BibTeX]
[DOI]
William E. Wright
Acta Informatica, 1985

An Efficient Model for Representing and Analyzing B-Trees.
[BibTeX]
[DOI]
Carl Langenhop
,
William E. Wright
Proceedings of the 1985 ACM annual conference on The range of computing: mid-80's perspective: mid-80's perspective, 1985

1983
Some File Structure Considerations Pertaining to Magnetic Bubble Memory.
[BibTeX]
[DOI]
William E. Wright
Comput. J., 1983

1982
Single Versus Double Buffering in Constrained Merging.
[BibTeX]
[DOI]
William E. Wright
Comput. J., 1982

1981
A survey of interactive computing support in American colleges and universities.
[BibTeX]
[DOI]
William E. Wright
,
Robert J. McGlinn
,
J. Archer Harris
ACM SIGCSE Bull., 1981

Binary Search Trees in Secondary Memory.
[BibTeX]
[DOI]
William E. Wright
Acta Informatica, 1981

1980
An empirical evaluation of algorithms for dynamically maintaining binary search trees.
[BibTeX]
[DOI]
William E. Wright
Proceedings of the ACM 1980 Annual Conference, 1980

1979
An AVL algorithm for secondary memory.
[BibTeX]
[DOI]
William E. Wright
Proceedings of the IEEE Computer Society's Third International Computer Software and Applications Conference, 1979

Organizing and accessing files for magnetic bubble memory and charge coupled devices.
[BibTeX]
[DOI]
William E. Wright
Proceedings of the 1979 Annual Conference, Detroit, Michigan, USA, October 29-31, 1979., 1979

1978
Dynamic Binary Search Trees.
[BibTeX]
[DOI]
William E. Wright
Proceedings of the Proceedings 1978 ACM Annual Conference, 1978

1977
Gravitational clustering.
[BibTeX]
[DOI]
William E. Wright
Pattern Recognit., 1977

1973
A formalization of cluster analysis.
[BibTeX]
[DOI]
William E. Wright
Pattern Recognit., 1973


  Loading...