default search action
William E. Wright
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2004
- [j17]William E. Wright:
A Markov chain model for dynamic binary search tree behaviour. Int. J. Comput. Math. 81(7): 803-812 (2004) - 2001
- [j16]William E. Wright:
An Efficient Video-on-Demand Model. Computer 34(5): 64-70 (2001) - [c6]William E. Wright:
Balancing the Workload in Video-On-Demand Systems. International Conference on Internet Computing (1) 2001: 306-310
1990 – 1999
- 1999
- [j15]William E. Wright:
A Refinement of Replacement Selection. Inf. Process. Lett. 70(3): 107-111 (1999) - 1993
- [j14]William E. Wright, Sakthirel Jeyaratnam:
Success Rate of Interpolation in Subsegment Prediction. Softw. Pract. Exp. 23(3): 243-253 (1993) - 1991
- [j13]William E. Wright:
Parallel Algorithms for Generating the Raster Representation of Straight Lines and Circles. J. Parallel Distributed Comput. 11(2): 170-174 (1991) - 1990
- [j12]William E. Wright:
Parallelization of Bresenham's line and circle algorithms. IEEE Computer Graphics and Applications 10(5): 60-67 (1990)
1980 – 1989
- 1989
- [j11]Carl Langenhop, William E. Wright:
A Model of the Dynamic Behavior of B-Trees. Acta Informatica 27(1): 41-59 (1989) - 1988
- [j10]Carl Langenhop, William E. Wright:
Certain Occupancy Numbers via an Algorithm for Computing Their Ratios. SIAM J. Discret. Math. 1(3): 360-371 (1988) - 1987
- [j9]William E. Wright:
A Note on External Sorting Using Almost Single Input Buffering. Inf. Process. Lett. 24(6): 403-405 (1987) - 1986
- [j8]Carl Langenhop, William E. Wright:
Probabilities Related to Father-Son Distances in Binary Search Trees. SIAM J. Comput. 15(2): 520-530 (1986) - 1985
- [j7]William E. Wright:
Some Average Performance Measures for the B-Tree. Acta Informatica 21: 541-557 (1985) - [c5]Carl Langenhop, William E. Wright:
An Efficient Model for Representing and Analyzing B-Trees. ACM Annual Conference 1985: 35-40 - 1983
- [j6]William E. Wright:
Some File Structure Considerations Pertaining to Magnetic Bubble Memory. Comput. J. 26(1): 43-51 (1983) - 1982
- [j5]William E. Wright:
Single Versus Double Buffering in Constrained Merging. Comput. J. 25(2): 227-230 (1982) - 1981
- [j4]William E. Wright:
Binary Search Trees in Secondary Memory. Acta Informatica 15: 3-17 (1981) - [j3]William E. Wright, Robert J. McGlinn, J. Archer Harris:
A survey of interactive computing support in American colleges and universities. ACM SIGCSE Bull. 13(3): 22-25 (1981) - 1980
- [c4]William E. Wright:
An empirical evaluation of algorithms for dynamically maintaining binary search trees. ACM Annual Conference 1980: 505-515
1970 – 1979
- 1979
- [c3]William E. Wright:
Organizing and accessing files for magnetic bubble memory and charge coupled devices. ACM Annual Conference 1979: 221-227 - [c2]William E. Wright:
An AVL algorithm for secondary memory. COMPSAC 1979: 24-30 - 1978
- [c1]William E. Wright:
Dynamic Binary Search Trees. ACM Annual Conference (1) 1978: 370-374 - 1977
- [j2]William E. Wright:
Gravitational clustering. Pattern Recognit. 9(3): 151-166 (1977) - 1973
- [j1]William E. Wright:
A formalization of cluster analysis. Pattern Recognit. 5(3): 273-282 (1973)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: