Author:
Ďuriš Pavol,Hromkovič Juraj,Inoue Katsushi
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference28 articles.
1. H. Abelson, Lower bounds on information transfer in distributive computations, Proceedings of the 19th IEEE FOCS, FOCS, Ann Arbor, MI, 1978, pp. 151–158 (also: J. ACM 27 (1980) 384–292).
2. A.V. Aho, J.D. Ullman, M. Yannakakis, On notions of information transfer in VLSI circuits, Proceedings of the 15th Annual ACM, STOCS, ACM, New York, 1983, pp. 133–139.
3. L. Babai, Monte Carlo algorithms in graph isomorphism techniques, Research Report no. 79-10, Département de mathématiques et statistique, Université de Montréal, 1979.
4. P. Ďuriš, J. Hromkovič, J.D.P. Rolim, G. Schnitger, Las Vegas versus determinism for one-way communication complexity, finite automata and polynomial-time computations, Proceedings of STACS‘97, Lecture Notes in Computer Science, Vol. 1200, Springer, Berlin, 1997, pp. 117–128.
5. Exact lower bounds for computing Boolean functions on CREW PRAMs;Dietzelfelbinger;J. Comput. System Sci.,1994
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On probabilistic pushdown automata;Information and Computation;2010-08
2. Path-Bounded One-Way Multihead Finite Automata;IEICE Transactions on Information and Systems;2005-01-01