The following pages link to William F. McColl (Q1236509):
Displaying 16 items.
- (Q1080861) (redirect page) (← links)
- On the number of edges in the transitive closure of a graph (Q1080862) (← links)
- Memory-efficient matrix multiplication in the BSP model (Q1125810) (← links)
- Complexity hierarchies for Boolean functions (Q1236510) (← links)
- The maximum depth of monotone formulae (Q1245099) (← links)
- The circuit depth of symmetric Boolean functions (Q1251213) (← links)
- A BSP Bareiss algorithm for Toeplitz systems (Q1288540) (← links)
- Virtual shared memory: Algorithms and complexity (Q1333257) (← links)
- (Q3145775) (← links)
- (Q3684035) (← links)
- (Q3684036) (← links)
- Planar Crossovers (Q3904538) (← links)
- (Q3962467) (← links)
- (Q4182434) (← links)
- (Q4196350) (← links)
- Analytical inversion of general tridiagonal matrices (Q4255743) (← links)
