Ackermann and the superpowers. - António Porto; Armando B. Matos (SIGACT News, 1980)

Simulação computacional de redes de caminhos de ferro electrificadas - Armando B. Matos (1980)

Regular Languages and a Class of Logic Programs. - Armando B. Matos (EPIA, 1993)

Some Results on the Complexity of SLD-Derivations. - Armando B. Matos (EPIA, 1993)

An introduction to ultimately periodic sets of integers. - Armando B. Matos (SIGACT News, 1994)

A Matrix Model for the Flow of Control in Prolog Programs with Applications to Profiling. - Armando B. Matos (Softw. Pract. Exp., 1994)

Periodic Sets of Integers. - Armando B. Matos (Theor. Comput. Sci., 1994)

Monadic Logic Programs and Functional Complexity. - Armando B. Matos (Theor. Comput. Sci., 1997)

Linear programs in a simple reversible language. - Armando B. Matos (Theor. Comput. Sci., 2003)

The efficiency of primitive recursive functions: A programmer's view. - Armando B. Matos (Theor. Comput. Sci., 2015)

Primitive recursive functions versus partial recursive functions: comparing the degree of undecidability. - Armando B. Matos (CoRR, 2016)

The Fixed Point Problem for General and for Linear SRL Programs is Undecidable. - Armando B. Matos; Luca Paolini; Luca Roversi (ICTCS, 2018)

On the Expressivity of Total Reversible Programming Languages. - Armando B. Matos; Luca Paolini; Luca Roversi (RC, 2020)

The fixed point problem of a simple reversible language. - Armando B. Matos; Luca Paolini; Luca Roversi (Theor. Comput. Sci., 2020)

Splitting Recursion Schemes into Reversible and Classical Interacting Threads. - Armando B. Matos; Luca Paolini; Luca Roversi (RC, 2021)

Interleaving classical and reversible. - Armando B. Matos; Luca Paolini; Luca Roversi (CoRR, 2021)