Properties of complexity measures for PRAMs and WRAMs

This publication has 8 references indexed in Scilit:

• On the evolution of random graphs
  Published by Walter de Gruyter GmbH ,2011
• Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
  SIAM Journal on Computing, 1986
• The critical complexity of all (monotone) boolean functions and monotone graph properties
  Information and Control, 1985
• Trade-Offs between Depth and Width in Parallel Computation
  SIAM Journal on Computing, 1985
• Optimal decision trees and one-time-only branching programs for symmetric Boolean functions
  Information and Control, 1984
• The critical complexity of graph properties
  Information Processing Letters, 1984
• Extremal hypergraph problems
  Published by Cambridge University Press (CUP) ,1979
• On recognizing graph properties from adjacency matrices
  Theoretical Computer Science, 1976