default search action
Clarice Dias de Albuquerque
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j6]Clarice Dias de Albuquerque, Henrique Lazari, Reginaldo Palazzo Jr., Daniel Silva Campos:
Hyperbolic quantum color codes with normal subgroup structure derived from the Reidemeister-Schreier method. Comput. Appl. Math. 43(4): 189 (2024) - [j5]Anderson José de Oliveira
, Giuliano Gadioli La Guardia, Reginaldo Palazzo Jr., Clarice Dias de Albuquerque, Cátia Regina de Oliveira Quilles Queiroz, Leandro Bezerra de Lima, Vandenberg Lopes Vieira:
Algebraic and geometric characterizations related to the quantization problem of the C2,8 channel. Comput. Appl. Math. 43(6): 377 (2024) - [j4]Cibele Cristina Trinca
New three- and four-dimensional toric and burst error-correcting quantum codes. Quantum Inf. Process. 23(2): 32 (2024) - 2023
- [i2]Anderson José de Oliveira, Giuliano Gadioli La Guardia, Reginaldo Palazzo Jr., Clarice Dias de Albuquerque, Cátia Regina de Oliveira Quilles Queiroz, Leandro Bezerra de Lima, Vandenberg Lopes Vieira:
Algebraic and Geometric Characterizations Related to the Quantization Problem of the C2, 8 Channel. CoRR abs/2304.12226 (2023) - [i1]Cibele Cristina Trinca, Reginaldo Palazzo Jr., Ricardo Augusto Watanabe, Clarice Dias de Albuquerque, José Carmelo Interlando, Antonio Aparecido de Andrade:
New Three and Four-Dimensional Toric and Burst-Error-Correcting Quantum Codes. CoRR abs/2307.06241 (2023) - 2022
- [j3]Clarice Dias de Albuquerque
Euclidean and hyperbolic asymmetric topological quantum codes. Quantum Inf. Process. 21(1) (2022) - [c3]Cibele Cristina Trinca, Clarice Dias de Albuquerque, Reginaldo Palazzo Júnior, J. Carmelo Interlando, Antonio Aparecido de Andrade, Ricardo Augusto Watanabe:
New Quantum Burst-Error Correcting Codes from Interleaving Technique. GLOBECOM 2022: 5243-5248
2010 – 2019
- 2014
- [j2]Clarice Dias de Albuquerque, Reginaldo Palazzo Júnior, Eduardo Brandani da Silva:
Families of classes of topological quantum codes from tessellations {4i + 2, 2i + 1}, {4i, 4i}, {8i - 4, 4} and {12i - 6, 3}. Quantum Inf. Comput. 14(15-16): 1424-1440 (2014) - 2010
- [j1]Clarice Dias de Albuquerque, Reginaldo Palazzo Júnior, Eduardo Brandani da Silva:
New classes of TQC associated with self-dual, quasi self-dual and denser tessellations. Quantum Inf. Comput. 10(11&12): 956-970 (2010) - [c2]Clarice Dias de Albuquerque, Reginaldo Palazzo Júnior, Eduardo Brandani da Silva:
New classes of topological quantum codes derived from embeddings of graphs on compact surfaces. ISIT 2010: 2691-2694
2000 – 2009
- 2008
- [c1]Clarice Dias de Albuquerque, Reginaldo Palazzo Júnior, Eduardo Brandani da Silva:
Construction of topological quantum codes on compact surfaces. ITW 2008: 391-395
Coauthor Index
aka: Reginaldo Palazzo Jr.
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-09-10 01:14 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: