Separating the polynomial-time hierarchy by oracles
Proc. 26th annual symposium on Foundations of computer science
Almost optimal lower bounds for small depth circuits
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Computational limitations of small-depth circuits
Computational limitations of small-depth circuits
Optimal bounds for decision problems on the CRCW PRAM
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Limits on the power of concurrent-write parallel machines
Information and Computation
New lower bounds for parallel computation
Journal of the ACM (JACM)
Borel sets and circuit complexity
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Lower bounds in parallel machine computation
Lower bounds in parallel machine computation
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
Constant-time parallel integer sorting
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Ultra-fast expected time parallel algorithms
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Exponential lower bounds for the pigeonhole principle
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Load balancing requires &OHgr;(log*n) expected time
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Fast deterministic approximate and exact parallel sorting
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Optimal parallel string algorithms: sorting, merging and computing the minimum
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Can shared-memory model serve as a bridging model for parallel computation?
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Modeling parallel bandwidth: local vs. global restrictions
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses
IEEE Transactions on Parallel and Distributed Systems
Computational bounds for fundamental problems on general-purpose parallel models
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Fast deterministic processor allocation
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Fixed-dimensional parallel linear programming via relative &egr;-approximations
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
On AC0 implementations of fusion trees and atomic heaps
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Deterministic Parallel Padded Sorting
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Coloring permutation graphs in parallel
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Efficient scalable mesh algorithms for merging, sorting and selection
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
Journal of Computer and System Sciences - Special issue: STOC 2003
Efficient parallel algorithms can be made robust
Distributed Computing
Nexp does not have non-uniform quasipolynomial-size ACC circuits of o(log log n) depth
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
| Hi-index | 0.00 |
Optimal &OHgr;(log n/log log n) lower bounds on the time for CRCW PRAMS with polynomially bounded numbers of processors or memory cells to compute parity and a number of related problems are proven. A strict time hierarchy of explicit Boolean functions of n bits on such machines that holds up to &Ogr;(log n/log log n) time is also exhibited. That is, for every time bound T within this range a function is exhibited that can be easily computed using polynomial resources in time T but requires more than polynomial resources to be computed in time T - 1. Finally, it is shown that almost all Boolean functions of n bits require log n - log log n + &OHgr;(1) time when the number of processors is at most polynomial in n. The bounds do not place restrictions on the uniformity of the algorithms nor on the instruction sets of the machines.