Michela Ceria

Orcid: 0000-0001-6059-9930

According to our database1, Michela Ceria authored at least 31 papers between 2015 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Alternatives for the <i>q</i>-matroid axioms of independent spaces, bases, and spanning spaces.
Adv. Appl. Math., February, 2024

Weighted Subspace Designs from <i>q</i>-Polymatroids.
J. Comb. Theory A, January, 2024

Towards a Gröbner-free approach to coding.
Des. Codes Cryptogr., January, 2024

Corrigendum to "Alternatives for the q-matroid axioms of independent spaces, bases, and spanning spaces" [Adv. Appl. Math. 153 (2024) 102632].
Adv. Appl. Math., 2024

2023
On the geometry of a (<i>q</i> + 1)-arc of PG(3,<i>q</i>), <i>q</i> even.
Discret. Math., December, 2023

On near-MDS codes and caps.
Des. Codes Cryptogr., March, 2023

Constructions of new matroids and designs over ${\mathbb {F}}_q$.
Des. Codes Cryptogr., February, 2023

2022
De Nugis Groebnerialium 7: Janet, Gerdt, Tamari.
Math. Comput. Sci., 2022

Applications of Bar Code to Involutive Divisions and a "Greedy" Algorithm for Complete Sets.
Math. Comput. Sci., 2022

Constructions of new <i>q</i>-cryptomorphisms.
J. Comb. Theory B, 2022

The <i>m</i>-ovoids of W(5, 2) and their generalizations.
Finite Fields Their Appl., 2022

Some hypersurfaces over finite fields, minimal codes and secret sharing schemes.
Des. Codes Cryptogr., 2022

De Nugis Groebnerialium 6: Rump, Ufnarovski, Zacharias.
Appl. Algebra Eng. Commun. Comput., 2022

Degröbnerization: a political manifesto.
Appl. Algebra Eng. Commun. Comput., 2022

A Degroebnerization Approach to Algebraic Statistics.
Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

2021
Combinatorial decompositions for monomial ideals.
J. Symb. Comput., 2021

The complexity of solving Weil restriction systems.
IACR Cryptol. ePrint Arch., 2021

Secret sharing schemes from hypersurfaces over finite fields.
CoRR, 2021

Why you cannot even hope to use Ore algebras in Cryptography.
Appl. Algebra Eng. Commun. Comput., 2021

Degröbnerization and Its Applications: Reverse Engineering of Gene Regulatory Networks (poster paper).
Proceedings of the 6th SC-Square Workshop co-located with the SIAM Conference on Applied Algebraic Geometry, 2021

2020
Bar Code: A Visual Representation for Finite Sets of Terms and Its Applications.
Math. Comput. Sci., 2020

HELP: a sparse error locator polynomial for BCH codes.
Appl. Algebra Eng. Commun. Comput., 2020

Toward involutive bases over effective rings.
Appl. Algebra Eng. Commun. Comput., 2020

Why you cannot even hope to use Gröbner bases in cryptography: an eternal golden braid of failures.
Appl. Algebra Eng. Commun. Comput., 2020

2019
Measuring Performances of a White-Box Approach in the IoT Context.
Symmetry, 2019

A general framework for Noetherian well ordered polynomial reductions.
J. Symb. Comput., 2019

Bar code for monomial ideals.
J. Symb. Comput., 2019

2018
Efficient Computation of Squarefree Separator Polynomials.
Proceedings of the Mathematical Software - ICMS 2018, 2018

2017
Buchberger-Weispfenning theory for effective associative rings.
J. Symb. Comput., 2017

2015
Term-ordering free involutive bases.
J. Symb. Comput., 2015

A unifying form for noetherian polynomial reductions.
CoRR, 2015


  Loading...