Armando B. Matos

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Splitting Recursion Schemes into Reversible and Classical Interacting Threads Reversible Computation	2021-11-03	Paper
On the expressivity of total reversible programming languages	2021-07-05	Paper
The fixed point problem of a simple reversible language Theoretical Computer Science	2020-04-21	Paper
Conditional Rényi Entropies IEEE Transactions on Information Theory	2017-07-12	Paper
Distinguishing two probability ensembles with one sample from each ensemble Theory of Computing Systems	2017-01-12	Paper
The efficiency of primitive recursive functions: a programmer's view Theoretical Computer Science	2015-07-24	Paper
Entropy measures vs. Kolmogorov complexity Entropy	2012-01-09	Paper
Depth as randomness deficiency Theory of Computing Systems	2009-10-19	Paper
Linear programs in a simple reversible language. Theoretical Computer Science	2003-08-17	Paper
Monadic logic programs and functional complexity Theoretical Computer Science	1998-07-23	Paper
Periodic sets of integers Theoretical Computer Science	1995-01-11	Paper
scientific article; zbMATH DE number 3711945 (Why is no real title available?)	1980-01-01	Paper

Research outcomes over time

This page was built for person: Armando B. Matos