Upper and lower time bounds for parallel random access machines without simultaneous writes
SIAM Journal on Computing
The complexity of matrix transposition on one-tape off-line Turing machines
Theoretical Computer Science
An introduction to Kolmogorov complexity and its applications
An introduction to Kolmogorov complexity and its applications
k one-way heads cannot do string-matching
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Trade-offs between communication and space
Journal of Computer and System Sciences
Communication-Space Tradeoffs for UnrestrictedProtocols
SIAM Journal on Computing
Communication complexity
Multi-party finite computations
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
| Hi-index | 0.00 |