William F. McColl - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 29 from 29

2023

A Parallel Scan Algorithm in the Tensor Core Unit ModelAnastasios Zouzias, William F. McColl. europar 2023: 489-502 [doi]

1999

1998

A two-way BSP algorithm for tridiagonal systemsYuguang Huang, William F. McColl. fgcs, 13(4-5):337-347, 1998. [doi]

Foundations of Time-Critical Scalable ComputingWilliam F. McColl. ifip 1998: 93-107

Theory and Algorithms for Parallel ComputationWilliam F. McColl, David Walker. europar 1998: 863-864 [doi]

1997

A Two-Way BSP Algorithm for Tridiagonal SystemsYuguang Huang, William F. McColl. hpcn 1997: 321-331

Questions and Answers about BSPDavid B. Skillicorn, Jonathan M. D. Hill, William F. McColl. sp, 6(3):249-274, 1997. [doi]

1996

Universal ComputingWilliam F. McColl. europar 1996: 25-36

Scalability, portability and predictability: The BSP approach to parallel programmingWilliam F. McColl. fgcs, 12(4):265-272, 1996. [doi]

1995

Scalable ComputingWilliam F. McColl. In Jan van Leeuwen, editor, Computer Science Today: Recent Trends and Developments. Volume 1000 of Lecture Notes in Computer Science, pages 46-61, Springer, 1995.

1994

Scientific Computing on Bulk Synchronous Parallel ArchitecturesRob H. Bisseling, William F. McColl. ifip11-9 1994: 509-514

Virtual Shared Memory: Algorithms and ComplexityAndrew Chin, William F. McColl. iandc, 113(2):199-219, September 1994.

Scalable Parallel Computing: A Grand Unified Theory and its Practical DevelopmentWilliam F. McColl. ifip11-9 1994: 539-546

BSP ProgrammingWilliam F. McColl. dimacs 1994: 21-36

1991

Planar Acyclic ComputationWilliam F. McColl, Mike Paterson, B. H. Bowditch. iandc, 90(2):178-193, February 1991.

1988

Parallel Algorithms and ArchitecturesWilliam F. McColl. shell 1989: 1-22

1987

The Planar Realization of Boolean FunctionsWilliam F. McColl, Mike Paterson. ipl, 24(3):165-170, 1987.

1986

On the number of edges in the transitive closure of a graphWilliam F. McColl, K. Noshita. DAM, 15(1):67-73, 1986. [doi]

1985

Planar Circuits Have Short SpecificationsWilliam F. McColl. STACS 1985: 231-242

On the Planar Monotone Computation of Threshold FunctionsWilliam F. McColl. STACS 1985: 219-230

1981

Planar CrossoversWilliam F. McColl. TC, 30(3):223-225, 1981.

1978

The Circuit Depth of Symmetric Boolean FunctionsWilliam F. McColl. jcss, 17(1):108-115, 1978.

The Maximum Depth of Monotone FormulaeWilliam F. McColl. ipl, 7(2):65, 1978.

1977

The Depth of All Boolean FunctionsWilliam F. McColl, Mike Paterson. SICOMP, 6(2):373-380, 1977.

1976

The Depth of Boolean FunctionsWilliam F. McColl. icalp 1976: 307-321

Some results on circuit depthWilliam F. McColl. PhD thesis, University of Warwick, Coventry, UK, 1976. [doi]

Sign in or sign up to see more results.

runs on WebDSL