default search action
António Malheiro
Person information
- affiliation: Universidade NOVA de Lisboa, Portugal
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j14]André Carvalho
, António Malheiro
Subsets of groups in public-key cryptography. Adv. Math. Commun. 19(3): 980-995 (2025) - 2023
- [i5]André Carvalho, António Malheiro:
Subsets of groups in public-key cryptography. CoRR abs/2311.15039 (2023)
2010 – 2019
- 2019
- [j13]Alan J. Cain
Combinatorics of patience sorting monoids. Discret. Math. 342(9): 2590-2611 (2019) - [j12]Alan J. Cain, António Malheiro
The monoids of the patience sorting algorithm. Int. J. Algebra Comput. 29(1): 85-125 (2019) - [j11]Alan J. Cain
Crystal monoids & crystal bases: Rewriting systems and biautomatic structures for plactic monoids of types An, Bn, Cn, Dn, and G2. J. Comb. Theory A 162: 406-466 (2019) - [i4]António Malheiro
A Note on a Unifying Proof of the Undecidability of Several Diagrammatic Properties of Term Rewriting Systems. CoRR abs/1910.09254 (2019) - 2018
- [j10]Alan J. Cain
Identities in Plactic, Hypoplactic, Sylvester, Baxter, and Related Monoids. Electron. J. Comb. 25(3): 3 (2018) - [j9]João Araújo
Decidability and independence of conjugacy problems in finitely presented monoids. Theor. Comput. Sci. 731: 88-98 (2018) - 2017
- [j8]Alan J. Cain
On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids. Inf. Comput. 255: 68-93 (2017) - [c2]Alan J. Cain
Combinatorics of Cyclic Shifts in Plactic, Hypoplactic, Sylvester, and Related Monoids. WORDS 2017: 190-202 - 2015
- [j7]Alan J. Cain
Rewriting systems and biautomatic structures for Chinese, hypoplactic, and sylvester monoids. Int. J. Algebra Comput. 25(1-2): 51-80 (2015) - [j6]Alan J. Cain
Deciding conjugacy in sylvester monoids and other homogeneous monoids. Int. J. Algebra Comput. 25(5): 899-915 (2015) - 2014
- [i3]Alan J. Cain, Robert D. Gray, António Malheiro:
On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids. CoRR abs/1407.7428 (2014) - [i2]Alan J. Cain, Robert D. Gray, António Malheiro
Crystal bases, finite complete rewriting systems, and biautomatic structures for Plactic monoids of types $A_n$, $B_n$, $C_n$, $D_n$, and $G_2$. CoRR abs/1412.7040 (2014) - 2013
- [j5]Robert D. Gray, António Malheiro
Homotopy bases and finite derivation type for Schützenberger groups of monoids. J. Symb. Comput. 50: 50-78 (2013) - [i1]Alan J. Cain, Robert D. Gray, António Malheiro:
Rewriting systems and biautomatic structures for Chinese, hypoplactic, and Sylvester monoids. CoRR abs/1310.6572 (2013) - 2011
- [j4]Robert D. Gray, António Malheiro
On properties not inherited by monoids from their Schützenberger groups. Inf. Comput. 209(7): 1120-1134 (2011) - [j3]Robert D. Gray, António Malheiro
Finite complete rewriting systems for regular semigroups. Theor. Comput. Sci. 412(8-10): 654-661 (2011)
2000 – 2009
- 2008
- [c1]António Malheiro:
On Finite Semigroup Cross-Sections and Complete Rewriting Systems. TMFCS 2008: 59-63 - 2006
- [j2]António Malheiro
Finite derivation type for Rees matrix semigroups. Theor. Comput. Sci. 355(3): 274-290 (2006) - 2005
- [j1]António Malheiro
Complete Rewriting Systems For Codified Submonoids. Int. J. Algebra Comput. 15(2): 207-216 (2005)
Coauthor Index
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 2025-05-15 21:32 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: