Recent work has shown that for some multi-user networks, carefully controlling the algebraic structure of the coding scheme may be just as useful as selecting the correct input distribution. The algebraic structure of the code permits to decode just a function of the codewords, rather than the full codewords, over interfering links. In particular, for linear channel models, including finite field and Gaussian networks, linearly structured codes and lattice codes have been successfully used to prove new capacity results. In this note, we discuss several paradigmatic examples of computation over interfering links, involving linear and non-linear interference models, various noise characteristics, and feedback.