Complete classifications for the communication complexity of regular languages

Theory of Computing Systems

Volumn 38, Issue 2, 2005, Pages 135-159

  Tesson, Pascal ^a   Thérien, Denis ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION COMPLEXITY; COMPLETE CLASSIFICATION; COUNTING MODELS;

CONTEXT FREE LANGUAGES;

COMMUNICATION;

EID: 23944480981     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-004-1190-2     Document Type: Conference Paper

References (23)

1. J. Almeida. Finite Semigroups and Universal Algebra. Series in Algebra, volume 3. World Scientific, Singapore, 1994.
2. L. Babai, P. Frankl, and J. Simon. Complexity classes in communication complexity theory. In Proc. 27th IEEE Symp. Found. Comput. Sci. (FOCS '86), pages 337-347, 1986.
3. L. Babai and P. G. Kimmel. Randomized simultaneous messages. In Proc. 12th Conf. Comput. Complexity (CCC '97), pages 239-247, 1997.
4. L. Babai, N. Nisan, and M. Szegedy. Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs. J. Comput. System Sci., 45(2):204-232, Oct. 1992.
5. 1. J. Comput. System Sci., 38(1):150-164, 1989. Preliminary version appeared in STOC '86.
6. 1. J. ACM, 35(4):941-952, Oct. 1988.
7. C. Damm, M. Krause, C. Meinel, and S. Waack. On relations between counting communication complexity classes. In Proc. 9th Ann. Symp. Theoret Aspects Comput. Sci. (STACS '92), 1992. Full version to appear in J. Comput. System Sci. Currently available, e.g. from www.num.math.uni-goettingen.de/damm/.
8. S. Eilenberg. Automata, Languages and Machines, volume B. Academic Press, New York, 1976.
9. V. Grolmusz. Separating the communication complexities of MOD m and MOD p circuits. In Proc. 33rd IEEE FOCS, pages 278-287, 1992.
10. B. Kalyanasundaram and G. Schnitger. The probabilistic communication complexity of set intersection. SIAM J. Discrete Math., 5(4):545-557, 1992.
11. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, Cambridge, 1997.
12. C. Meinel and S. Waack. The "log rank" conjecture for modular communication complexity. Comput. Complexity, 10(1):70-91, 2001.
13. J.-E. Pin. Varieties of Formal Languages. North Oxford Academic, London, 1986.
14. J.-E. Pin. Syntactic semigroups. In G. R. A. Salomaa, editor, Handbook of Language Theory, volume 1, chapter 10, pages 679-746. Springer-Verlag, Berlin, 1997.
15. J.-E. Pin and P. Weil. Profinite semigroups, Mal'cev products, and identities. J. Algebra, 182:604-626, 1996.
16. P. Pudlák. An application of Hindman's theorem to a problem on communication complexity. Combin. Probab. Comput., 12(5-6):661-670, 2003.
17. J.-F. Raymond, P. Tesson, and D. Thérien. An algebraic approach to communication complexity. In Pmc. ICALP '98, pages 29-40. Lecture Notes in Computer Science, volume 1443. Springer-Verlag, Berlin, 1995.
18. A. Razborov. On the distributed complexity of disjointness. Theoret. Comput. Sci., 106(2):385-390, Dec. 1992. (Note.)
19. M. Szegedy. Functions with bounded symmetric communication complexity, programs over commutative monoids, and ACC. J. Comput. System Sci., 47(3):405-423, 1993.
20. P. Tesson. Computational Complexity Questions Related to Finite Monoids and Semigroups. Ph.D. thesis, McGill University, 2003.
21. P. Tesson and D. Thérien. Diamonds are forever: the variety DA. In G. Gomez, P. Silva, and J.-E. Pin, editors, Semigroups, Algorithms, Automata and Languages. WSP, Slupsk, 2002.
22. D. Thérien and T. Wilke. Over words, two variables are as powerful as one quantifier alternation. In Proc. 30th ACM Symp. Theory Comput., pages 256-263, 1998.
23. P. Weil. Closure of varieties of languages under products with counter. J. Comput. System Sci., 45:316-339, 1992.