default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArmando B. Matos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c5]Armando B. Matos, Luca Paolini
, Luca Roversi:
Splitting Recursion Schemes into Reversible and Classical Interacting Threads. RC 2021: 204-213- [i3]Armando B. Matos, Luca Paolini, Luca Roversi:
Interleaving classical and reversible. CoRR abs/2102.09436 (2021) - [i2]Armando B. Matos, Luca Paolini, Luca Roversi:
Splitting recursion schemes into reversible and classical interacting threads. CoRR abs/2105.04910 (2021) - 2020
- [j8]Armando B. Matos, Luca Paolini, Luca Roversi:
The fixed point problem of a simple reversible language. Theor. Comput. Sci. 813: 143-154 (2020) - [c4]Armando B. Matos, Luca Paolini, Luca Roversi:
On the Expressivity of Total Reversible Programming Languages. RC 2020: 128-143
2010 – 2019
- 2018
- [c3]Armando B. Matos, Luca Paolini, Luca Roversi:
The Fixed Point Problem for General and for Linear SRL Programs is Undecidable. ICTCS 2018: 128-139 - 2016
- [i1]Armando B. Matos:
Primitive recursive functions versus partial recursive functions: comparing the degree of undecidability. CoRR abs/1607.01686 (2016) - 2015
- [j7]Armando B. Matos:
The efficiency of primitive recursive functions: A programmer's view. Theor. Comput. Sci. 594: 65-81 (2015)
2000 – 2009
- 2003
- [j6]Armando B. Matos:
Linear programs in a simple reversible language. Theor. Comput. Sci. 290(3): 2063-2074 (2003)
1990 – 1999
- 1997
- [j5]Armando B. Matos:
Monadic Logic Programs and Functional Complexity. Theor. Comput. Sci. 176(1-2): 175-204 (1997) - 1994
- [j4]Armando B. Matos:
An introduction to ultimately periodic sets of integers. SIGACT News 25(1): 90-96 (1994) - [j3]Armando B. Matos:
A Matrix Model for the Flow of Control in Prolog Programs with Applications to Profiling. Softw. Pract. Exp. 24(8): 729-746 (1994) - [j2]Armando B. Matos:
Periodic Sets of Integers. Theor. Comput. Sci. 127(2): 287-312 (1994) - 1993
- [c2]Armando B. Matos:
Regular Languages and a Class of Logic Programs. EPIA 1993: 150-157 - [c1]Armando B. Matos:
Some Results on the Complexity of SLD-Derivations. EPIA 1993: 158-169
1980 – 1989
- 1980
- [b1]Armando B. Matos:
Simulação computacional de redes de caminhos de ferro electrificadas. University of Porto, Portugal, 1980 - [j1]António Porto, Armando B. Matos:
Ackermann and the superpowers. SIGACT News 12(3): 90-95 (1980)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
