Author:
Hromkovič Juraj,Schnitger Georg
Publisher
Springer Berlin Heidelberg
Reference44 articles.
1. Abelson, H., Lower bounds on information transfer in distributed computations. Proc. 19th Annual Symp. on Foundations of Computer Science, 151–158, 1978.
2. Aho, A.V., Ullman, J.D., Yannakakis, M., On notions of informations transfer in VLSI circuits. Proc. 15th Annual ACM Symp. on Theory of Computing, 133–139, 1983.
3. Babai, L., Nisan, N., Szegedy, M., Multiparty protocols and logspace-hard pseudo-random sequences. Proc. 21st Annual ACM Symp. on Theory of Computing, 1–11, 1989.
4. Beame, P., A general sequential time-space trade-off for finding unique elements. Proc. 21st Annual ACM Symp. on Theory of Computing, 197–203, 1989.
5. Cobham, A., The intrinsic computational difficulty of functions. Proc. 1964 Congress for Logic, Mathematics and Philosophy of Science, North Holland, 24–30, 1964.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献