The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

William F. McColl: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002