Upper and lower time bounds for parallel random access machines without simultaneous writes
SIAM Journal on Computing
Parallel RAMs with owned global memory and deterministic contex-free language recognition
International Colloquium on Automata, Languages and Programming on Automata, languages and programming
The complexity of Boolean functions
The complexity of Boolean functions
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
Towards understanding exclusive read
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
The power of parallel pointer manipulation
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Asynchronous shared memory parallel computation
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Lower bounds for parallel computation on linked structures
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Exact time bounds for computing boolean functions on PRAMs without simultaneous writes
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Asynchronous shared memory parallel computation (preliminary version)
ACM SIGARCH Computer Architecture News - Symposium on parallel algorithms and architectures
On the degree of Boolean functions as real polynomials
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Error-resilient DNA computation
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Approximate Compaction and Padded-Sorting on Exclusive Write PRAMs
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Regular Languages are Testable with a Constant Number of Queries
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Complexity of some arithmetic problems for binary polynomials
Computational Complexity
Sensitivity versus block sensitivity of Boolean functions
Information Processing Letters
Improved bounds for the randomized decision tree complexity of recursive majority
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Properties and applications of boolean function composition
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Gems in decision tree complexity revisited
ACM SIGACT News
Hi-index | 0.00 |
This paper gives a full characterization of the time needed to compute a Boolean function on a CREW PRAM with an unlimited number of processors.The characterization is given in terms of a new complexity measure of Boolean functions: the “block sensitivity”. This measure is a generalization of the well know “critical sensitivity” measure (see [W], [CDR], [Si]). The block sensitivity is also shown to relate to the Boolean decision tree complexity, and the implication is that the decision tree complexity also fully characterizes the CREW PRAM complexity. This solves an open problem of [W].Our results imply that changes in the instruction set of the processors or in the capacity of the shared memory cells do not change by more than a constant factor the time required by a CREW PRAM to compute any Boolean function. Moreover, we even show that a seemingly weaker version of a CREW PRAM, the CROW PRAM ([DR]), can compute functions as quickly as a general CREW PRAM. This solves an open problem of [DR].Finally, our results have implications regarding the power of randomization in the Boolean decision tree model. We show that in this model, randomization may only achieve a polynomial speedup over deterministic computation. This was known for Las-Vegas randomized computation; we prove it also for 1-sided error computation (a quadratic bound) and 2-sided error (a cubic bound).