Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. AHO,A.V. — ULLMAN,J.D. — YANAKAKIS,M.: On notions of information transfer in VLSI circuits. In: Proc. 15th ACM STOC, ACM 1983, pp. 133–139.
2. ĎUPIŠ,P. — GALIL,Z. — SCHNITGER,G.: Lower bounds on communication complexity. In: Proc. 16th ACM Symp. on Theory of Computing, ACM 1984,pp.81–91.
3. GUBAŠ,X. — WACZULÍK,J.: Closure properties of the complexity measures A and AT2. ŠVOČ 1987, section VLSI and computer graphics. Comenius University, Bratislava 1987, (in Slovak) 25 p.
4. HAJNAL,A. — MAASS,W. — TURAN,G.: On the communication complexity of graph properties. In: Proc. 20th Annual ACM STOC, ACM 1988, pp. 186–191.
5. HARPER, L.H.: Optimal numbering and isoperimetrical problems on graphs. Journ. of combinatorial theory, 1966, v. 1, no. 1 pp. 385–393.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献