default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichela Ceria
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j25]Michela Ceria, Relinde P. M. J. Jurrius
:
Alternatives for the q-matroid axioms of independent spaces, bases, and spanning spaces. Adv. Appl. Math. 153: 102632 (2024)- [j24]Michela Ceria, Relinde Jurrius:
Corrigendum to "Alternatives for the q-matroid axioms of independent spaces, bases, and spanning spaces" [Adv. Appl. Math. 153 (2024) 102632]. Adv. Appl. Math. 158: 102708 (2024) - [j23]Michela Ceria, Teo Mora:
Towards a Gröbner-free approach to coding. Des. Codes Cryptogr. 92(1): 179-204 (2024) - [j22]Eimear Byrne, Michela Ceria, Sorina Ionica, Relinde P. M. J. Jurrius:
Weighted Subspace Designs from q-Polymatroids. J. Comb. Theory A 201: 105799 (2024) - 2023
- [j21]Eimear Byrne, Michela Ceria, Sorina Ionica, Relinde P. M. J. Jurrius, Elif Saçikara:
Constructions of new matroids and designs over ${\mathbb {F}}_q$. Des. Codes Cryptogr. 91(2): 451-473 (2023) - [j20]Michela Ceria, Antonio Cossidente, Giuseppe Marino, Francesco Pavese:
On near-MDS codes and caps. Des. Codes Cryptogr. 91(3): 1095-1110 (2023) - [j19]Michela Ceria, Francesco Pavese:
On the geometry of a (q + 1)-arc of PG(3,q), q even. Discret. Math. 346(12): 113594 (2023) - 2022
- [j18]Michela Ceria, Samuel Lundqvist, Teo Mora:
Degröbnerization: a political manifesto. Appl. Algebra Eng. Commun. Comput. 33(6): 675-723 (2022) - [j17]Michela Ceria, Ferdinando Mora:
De Nugis Groebnerialium 6: Rump, Ufnarovski, Zacharias. Appl. Algebra Eng. Commun. Comput. 33(6): 725-749 (2022) - [j16]Angela Aguglia, Michela Ceria, Luca Giuzzi:
Some hypersurfaces over finite fields, minimal codes and secret sharing schemes. Des. Codes Cryptogr. 90(6): 1503-1519 (2022) - [j15]Michela Ceria, Francesco Pavese:
The m-ovoids of W(5, 2) and their generalizations. Finite Fields Their Appl. 84: 102098 (2022) - [j14]Eimear Byrne, Michela Ceria, Relinde P. M. J. Jurrius:
Constructions of new q-cryptomorphisms. J. Comb. Theory B 153: 149-194 (2022) - [j13]Michela Ceria, Ferdinando Mora:
De Nugis Groebnerialium 7: Janet, Gerdt, Tamari. Math. Comput. Sci. 16(4): 29 (2022) - [j12]Michela Ceria:
Applications of Bar Code to Involutive Divisions and a "Greedy" Algorithm for Complete Sets. Math. Comput. Sci. 16(4): 30 (2022) - [c3]Michela Ceria, Ferdinando Mora:
A Degroebnerization Approach to Algebraic Statistics. ISSAC 2022: 419-428 - 2021
- [j11]Michela Ceria, Teo Mora, Andrea Visconti:
Why you cannot even hope to use Ore algebras in Cryptography. Appl. Algebra Eng. Commun. Comput. 32(3): 229-244 (2021) - [j10]Michela Ceria:
Combinatorial decompositions for monomial ideals. J. Symb. Comput. 104: 630-652 (2021) - [c2]Michela Ceria, Samuel Lundqvist, Ferdinando Mora:
Degröbnerization and Its Applications: Reverse Engineering of Gene Regulatory Networks (poster paper). SC-Square@SIAM AG 2021: 27-30 - [i4]Angela Aguglia, Michela Ceria, Luca Giuzzi:
Secret sharing schemes from hypersurfaces over finite fields. CoRR abs/2105.14508 (2021) - [i3]Alessio Caminata, Michela Ceria, Elisa Gorla:
The complexity of solving Weil restriction systems. CoRR abs/2112.10506 (2021) - [i2]Alessio Caminata, Michela Ceria, Elisa Gorla:
The complexity of solving Weil restriction systems. IACR Cryptol. ePrint Arch. 2021: 1670 (2021) - 2020
- [j9]Michela Ceria, Teo Mora, Massimiliano Sala:
HELP: a sparse error locator polynomial for BCH codes. Appl. Algebra Eng. Commun. Comput. 31(3-4): 215-233 (2020) - [j8]Boo Barkee, Michela Ceria, Theo Moriarty, Andrea Visconti:
Why you cannot even hope to use Gröbner bases in cryptography: an eternal golden braid of failures. Appl. Algebra Eng. Commun. Comput. 31(3-4): 235-252 (2020) - [j7]Michela Ceria, Teo Mora:
Toward involutive bases over effective rings. Appl. Algebra Eng. Commun. Comput. 31(5-6): 359-387 (2020) - [j6]Michela Ceria:
Bar Code: A Visual Representation for Finite Sets of Terms and Its Applications. Math. Comput. Sci. 14(2): 497-513 (2020)
2010 – 2019
- 2019
- [j5]Michela Ceria:
Bar code for monomial ideals. J. Symb. Comput. 91: 30-56 (2019) - [j4]Michela Ceria, Teo Mora, Margherita Roggero:
A general framework for Noetherian well ordered polynomial reductions. J. Symb. Comput. 95: 100-133 (2019) - [j3]Daniele Giacomo Vittorio Albricci, Michela Ceria, Federico Cioschi, Nicolò Fornari, Arvin Shakiba, Andrea Visconti:
Measuring Performances of a White-Box Approach in the IoT Context. Symmetry 11(8): 1000 (2019) - 2018
- [c1]Michela Ceria, Teo Mora, Andrea Visconti:
Efficient Computation of Squarefree Separator Polynomials. ICMS 2018: 98-104 - 2017
- [j2]Michela Ceria, Teo Mora:
Buchberger-Weispfenning theory for effective associative rings. J. Symb. Comput. 83: 112-146 (2017) - 2015
- [j1]Michela Ceria, Teo Mora, Margherita Roggero:
Term-ordering free involutive bases. J. Symb. Comput. 68: 87-108 (2015) - [i1]Michela Ceria, Teo Mora, Margherita Roggero:
A unifying form for noetherian polynomial reductions. CoRR abs/1511.03234 (2015)
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 2024-10-13 18:01 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:
