default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWilliam F. McColl
Person information
- affiliation: Oxford University, Computing Laboratory
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c14]Anastasios Zouzias
, William F. McColl:
A Parallel Scan Algorithm in the Tensor Core Unit Model. Euro-Par 2023: 489-502
1990 – 1999
- 1999
- [j14]William F. McColl, Alexandre Tiskin:
Memory-Efficient Matrix Multiplication in the BSP Model. Algorithmica 24(3-4): 287-297 (1999) - [j13]Yuguang Huang, William F. McColl:
A BSP Bareiss Algorithm for Toeplitz Systems. J. Parallel Distributed Comput. 56(2): 99-121 (1999) - [c13]Luc Bougé, Bill McColl, Mamoun Filali, Henk J. Sips:
Parallel Programming: Models, Methods, and Languages - Introduction. Euro-Par 1999: 831-832 - [c12]Bill McColl:
BSP Algorithms - Write Once, Run Anywhere. WAE 1999: 12-13 - 1998
- [j12]Yuguang Huang, William F. McColl:
A two-way BSP algorithm for tridiagonal systems. Future Gener. Comput. Syst. 13(4-5): 337-347 (1998) - [j11]Jonathan M. D. Hill, Bill McColl, Dan C. Stefanescu, Mark W. Goudreau, Kevin J. Lang, Satish Rao, Torsten Suel, Thanasis Tsantilas, Rob H. Bisseling:
BSPlib: The BSP programming library. Parallel Comput. 24(14): 1947-1980 (1998) - [c11]Bill McColl, David Walker:
Theory and Algorithms for Parallel Computation. Euro-Par 1998: 863-864 - [c10]William F. McColl:
Foundations of Time-Critical Scalable Computing. IFIP Congress: Fundamentals - Foundations of Computer Science 1998: 93-107 - 1997
- [j10]David B. Skillicorn, Jonathan M. D. Hill, William F. McColl:
Questions and Answers about BSP. Sci. Program. 6(3): 249-274 (1997) - [c9]Yuguang Huang, William F. McColl:
A Two-Way BSP Algorithm for Tridiagonal Systems. HPCN Europe 1997: 321-331 - 1996
- [j9]William F. McColl:
Scalability, portability and predictability: The BSP approach to parallel programming. Future Gener. Comput. Syst. 12(4): 265-272 (1996) - [c8]William F. McColl:
Universal Computing. Euro-Par, Vol. I 1996: 25-36 - 1995
- [p1]William F. McColl:
Scalable Computing. Computer Science Today 1995: 46-61 - 1994
- [j8]Andrew Chin, William F. McColl:
Virtual Shared Memory: Algorithms and Complexity. Inf. Comput. 113(2): 199-219 (1994) - [c7]William F. McColl:
BSP Programming. Specification of Parallel Algorithms 1994: 21-35 - [c6]Rob H. Bisseling, William F. McColl:
Scientific Computing on Bulk Synchronous Parallel Architectures. IFIP Congress (1) 1994: 509-514 - [c5]William F. McColl:
Scalable Parallel Computing: A Grand Unified Theory and its Practical Development. IFIP Congress (1) 1994: 539-546 - 1991
- [j7]William F. McColl, Mike Paterson, Brian H. Bowditch:
Planar Acyclic Computation. Inf. Comput. 90(2): 178-193 (1991)
1980 – 1989
- 1988
- [c4]William F. McColl:
Parallel Algorithms and Architectures. Shell Conference 1988: 1-22 - 1987
- [j6]William F. McColl, Mike Paterson:
The Planar Realization of Boolean Functions. Inf. Process. Lett. 24(3): 165-170 (1987) - 1986
- [j5]William F. McColl, K. Noshita:
On the number of edges in the transitive closure of a graph. Discret. Appl. Math. 15(1): 67-73 (1986) - 1985
- [c3]William F. McColl:
On the Planar Monotone Computation of Threshold Functions. STACS 1985: 219-230 - [c2]William F. McColl:
Planar Circuits Have Short Specifications. STACS 1985: 231-242 - 1981
- [j4]William F. McColl:
Planar Crossovers. IEEE Trans. Computers 30(3): 223-225 (1981)
1970 – 1979
- 1978
- [j3]William F. McColl:
The Maximum Depth of Monotone Formulae. Inf. Process. Lett. 7(2): 65 (1978) - [j2]William F. McColl:
The Circuit Depth of Symmetric Boolean Functions. J. Comput. Syst. Sci. 17(1): 108-115 (1978) - 1977
- [j1]William F. McColl, Mike Paterson:
The Depth of All Boolean Functions. SIAM J. Comput. 6(2): 373-380 (1977) - 1976
- [b1]William F. McColl:
Some results on circuit depth. University of Warwick, Coventry, UK, 1976 - [c1]William F. McColl:
The Depth of Boolean Functions. ICALP 1976: 307-321
Coauthor Index
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-09-09 01:15 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:
