The structure of communication problems in cellular automata. - Raimundo Briceño; Pierre-Etienne Meunier (Automata, 2011)

Letting Alice and Bob choose which problem to solve: Implications to the study of cellular automata. - Raimundo Briceño; Ivan Rapaport (Theor. Comput. Sci., 2013)

Strong Spatial Mixing in Homomorphism Spaces. - Raimundo Briceño; Ronnie Pavlov (SIAM J. Discret. Math., 2017)

Long range actions, connectedness, and dismantlability in relational structures. - Raimundo Briceño; Andrei Bulatov 001; Víctor Dalmau; Benoît Larose (CoRR, 2019)

Mixing properties of colourings of the ℤd lattice. - Noga Alon; Raimundo Briceño; Nishant Chandgotia; Alexander Magazinov; Yinon Spinka (Comb. Probab. Comput., 2021)

Dismantlability, connectedness, and mixing in relational structures. - Raimundo Briceño; Andrei Bulatov 001; Víctor Dalmau; Benoît Larose (J. Comb. Theory B, 2021)

Communication complexity meets cellular automata: Necessary conditions for intrinsic universality. - Raimundo Briceño; Ivan Rapaport (Nat. Comput., 2021)