| 1999 |
|---|
| 23 | EE | William F. McColl:
BSP Algorithms - Write Once, Run Anywhere.
Algorithm Engineering 1999: 12-13 |
| 22 | EE | Luc Bougé,
William F. McColl,
Mamoun Filali,
Henk J. Sips:
Parallel Programming: Models, Methods, and Languages - Introduction.
Euro-Par 1999: 831-832 |
| 21 | EE | William F. McColl,
Alexandre Tiskin:
Memory-Efficient Matrix Multiplication in the BSP Model.
Algorithmica 24(3-4): 287-297 (1999) |
| 20 | | Yuguang Huang,
William F. McColl:
A BSP Bareiss Algorithm for Toeplitz Systems.
J. Parallel Distrib. Comput. 56(2): 99-121 (1999) |
| 1998 |
|---|
| 19 | EE | William F. McColl,
David Walker:
Theory and Algorithms for Parallel Computation.
Euro-Par 1998: 863-864 |
| 18 | | William F. McColl:
Foundations of Time-Critical Scalable Computing.
IFIP Congress: Fundamentals - Foundations of Computer Science 1998: 93-107 |
| 1997 |
|---|
| 17 | | Yuguang Huang,
William F. McColl:
A Two-Way BSP Algorithm for Tridiagonal Systems.
HPCN Europe 1997: 321-331 |
| 16 | EE | David B. Skillicorn,
Jonathan M. D. Hill,
William F. McColl:
Questions and Answers about BSP.
Scientific Programming 6(3): 249-274 (1997) |
| 1996 |
|---|
| 15 | | William F. McColl:
Universal Computing.
Euro-Par, Vol. I 1996: 25-36 |
| 1995 |
|---|
| 14 | | William F. McColl:
Scalable Computing.
Computer Science Today 1995: 46-61 |
| 1994 |
|---|
| 13 | | Rob H. Bisseling,
William F. McColl:
Scientific Computing on Bulk Synchronous Parallel Architectures.
IFIP Congress (1) 1994: 509-514 |
| 12 | | William F. McColl:
Scalable Parallel Computing: A Grand Unified Theory and its Practical Development.
IFIP Congress (1) 1994: 539-546 |
| 11 | | Andrew Chin,
William F. McColl:
Virtual Shared Memory: Algorithms and Complexity
Inf. Comput. 113(2): 199-219 (1994) |
| 1991 |
|---|
| 10 | | William F. McColl,
Mike Paterson,
B. H. Bowditch:
Planar Acyclic Computation
Inf. Comput. 90(2): 178-193 (1991) |
| 1988 |
|---|
| 9 | | William F. McColl:
Parallel Algorithms and Architectures.
Shell Conference 1988: 1-22 |
| 1987 |
|---|
| 8 | | William F. McColl,
Mike Paterson:
The Planar Realization of Boolean Functions.
Inf. Process. Lett. 24(3): 165-170 (1987) |
| 1985 |
|---|
| 7 | | William F. McColl:
On the Planar Monotone Computation of Threshold Functions.
STACS 1985: 219-230 |
| 6 | | William F. McColl:
Planar Circuits Have Short Specifications.
STACS 1985: 231-242 |
| 1981 |
|---|
| 5 | | William F. McColl:
Planar Crossovers.
IEEE Trans. Computers 30(3): 223-225 (1981) |
| 1978 |
|---|
| 4 | | William F. McColl:
The Maximum Depth of Monotone Formulae.
Inf. Process. Lett. 7(2): 65 (1978) |
| 3 | | William F. McColl:
The Circuit Depth of Symmetric Boolean Functions.
J. Comput. Syst. Sci. 17(1): 108-115 (1978) |
| 1977 |
|---|
| 2 | | William F. McColl,
Mike Paterson:
The Depth of All Boolean Functions.
SIAM J. Comput. 6(2): 373-380 (1977) |
| 1976 |
|---|
| 1 | | William F. McColl:
The Depth of Boolean Functions.
ICALP 1976: 307-321 |
