William F. McColl · VLDB 2026 Research

VLDB 2026 Research / reviewers in the wild / expert

William F. McColl

dblp:m/WilliamFMcColl · also Bill McColl · DBLP profile ↗

← Back

19ranked-venue papers

13as first author

1since 2021 · last 2023

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 11 · 10 first-authorSystems, architecture and hardware · 8 · 3 first-author · 1 since 2021Databases, data management, data science and information retrieval · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science 5 papers		Distributed computing theory · 72% Computational complexity · 22% Coding theory · 4%
Computer architecture, parallel and distributed computing, and storage systems 1 paper		Electronic design automation · 100%

Topics — the 8 heaviest of 9, each with the papers that count most for it

Topic	Weight	Papers	Last	Evidence papers
Distributed computing theory distributed algorithms	0.0	1	1994	Virtual Shared Memory: Algorithms and Complexity · Inf. Comput. 1994
Distributed computing theory distributed complexity	0.0	1	1994	Virtual Shared Memory: Algorithms and Complexity · Inf. Comput. 1994
Distributed computing theory shared memory	0.0	1	1994	Virtual Shared Memory: Algorithms and Complexity · Inf. Comput. 1994
Coding theory boolean functions	0.0	2	1977	The Depth of All Boolean Functions · SIAM J. Comput. 1977 The Depth of Boolean Functions · ICALP 1976
Computational complexity circuit complexity	0.0	2	1977	The Depth of All Boolean Functions · SIAM J. Comput. 1977 The Depth of Boolean Functions · ICALP 1976
Electronic design automation physical design	0.0	1	1981	Planar Crossovers · IEEE Trans. Computers 1981
Computational complexity › circuit complexity circuit depth	0.0	1	1977	The Depth of All Boolean Functions · SIAM J. Comput. 1977
Graph algorithms and graph theory planar graphs	0.0	1	1981	Planar Crossovers · IEEE Trans. Computers 1981

Methods — techniques the papers use, named apart from their topics

circuit complexity theory · 0.0

Year	Publication	Venue	Position
2023	A Parallel Scan Algorithm in the Tensor Core Unit Model Anastasios Zouzias, William F. McColl	Euro-Par	2
1999	Parallel Programming: Models, Methods, and Languages - Introduction Luc Bougé, William F. McColl, Mamoun Filali, Henk J. Sips	Euro-Par	2
1999	Memory-Efficient Matrix Multiplication in the BSP Model William F. McColl, Alexander Tiskin	Algorithmica	1
1999	A BSP Bareiss Algorithm for Toeplitz Systems Yuguang Huang, William F. McColl	J. Parallel Distributed Comput.	2
1998	Theory and Algorithms for Parallel Computation William F. McColl	Euro-Par	1
1998	A two-way BSP algorithm for tridiagonal systems Yuguang Huang, William F. McColl	Future Gener. Comput. Syst.	2
1998	BSPlib: The BSP programming library abstract BSPlib is a small communications library for bulk synchronous parallel (BSP) programming which consists of only 20 basic operations. This paper presents the full definition of BSPlib in C, motivates the design of its basic operations, and gives examples of their use. The library enables programming in two distinct styles: direct remote memory access (DRMA) using put or get operations, and bulk synchronous message passing (BSMP). Currently, implementations of BSPlib exist for a variety of modern architectures, including massively parallel computers with distributed memory, shared memory multiprocessors, and networks of workstations. BSPlib has been used in several scientific and industrial applications; this paper briefly describes applications in benchmarking, Fast Fourier Transforms (FFTs), sorting, and molecular dynamics. Jonathan M. D. Hill, William F. McColl, Dan C. Stefanescu, Mark W. Goudreau, Kevin J. Lang, Satish Rao, Torsten Suel, Thanasis Tsantilas, Rob H. Bisseling	Parallel Comput.	2
1996	Scalability, portability and predictability: The BSP approach to parallel programming William F. McColl	Future Gener. Comput. Syst.	1
1994	Virtual Shared Memory: Algorithms and Complexity Andrew Chin, William F. McColl	Inf. Comput.	2
1991	Planar Acyclic Computation William F. McColl, Mike Paterson, Brian H. Bowditch	Inf. Comput.	1
1987	The Planar Realization of Boolean Functions William F. McColl, Mike Paterson	Inf. Process. Lett.	1
1986	On the number of edges in the transitive closure of a graph William F. McColl, K. Noshita	Discret. Appl. Math.	1
1985	On the Planar Monotone Computation of Threshold Functions William F. McColl	STACS	1
1985	Planar Circuits Have Short Specifications William F. McColl	STACS	1
1981	Planar Crossovers abstract Those bases which permit the realization of a planar crossover are characterized. William F. McColl	IEEE Trans. Computers	1
1978	The Maximum Depth of Monotone Formulae William F. McColl	Inf. Process. Lett.	1
1978	The Circuit Depth of Symmetric Boolean Functions William F. McColl	J. Comput. Syst. Sci.	1
1977	The Depth of All Boolean Functions abstract Every Boolean function of n arguments has a circuit of depth $n + 1$ over the basis $\{ f\|f:\{ 0,1\} ^2 \to \{ 0,1\} \} $. William F. McColl, Mike Paterson	SIAM J. Comput.	1
1976	The Depth of Boolean Functions William F. McColl	ICALP	1