Melissa Antonelli

Orcid: 0009-0006-9072-4847

According to our database1, Melissa Antonelli authored at least 24 papers between 2021 and 2026.

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

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Recursion and proof theoretical characterizations of small circuit classes with modulo counting via discrete differential equations (long version).
CoRR, May, 2026

Counting Worlds Branching Time Semantics for post-hoc Bias Mitigation in generative AI.
CoRR, April, 2026

A Linear Temporal Logic of Frequencies on Series of Events.
CoRR, April, 2026

Towards new characterizations of small circuit classes via discrete ordinary differential equations.
Theor. Comput. Sci., 2026

2025
Characterizing Small Circuit Classes from FAC^0 to FAC^1 via Discrete Ordinary Differential Equations.
CoRR, June, 2025

Circuit Complexity Meets Discrete Ordinary Differential Equations: An Overview.
Proceedings of the Short Paper Proceedings of the 7th International Workshop on Artificial Intelligence and Formal Verification, 2025

Characterizing Small Circuit Classes from FAC⁰ to FAC¹ via Discrete Ordinary Differential Equations.
Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science, 2025

2024
Towards a Logical Foundation of Randomized Computation: Doctoral Thesis Abstract.
Künstliche Intell., August, 2024

On Randomized Computational Models and Complexity Classes: a Historical Overview.
CoRR, 2024

Towards logical foundations for probabilistic computation.
Ann. Pure Appl. Log., 2024

A New Characterization of FAC⁰ via Discrete Ordinary Differential Equations.
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

Towards New Characterizations of Small Circuit Classes via Discrete Ordinary Differential Equations (short paper).
Proceedings of the 25th Italian Conference on Theoretical Computer Science, 2024

Enumerating Error Bounded Polytime Algorithms Through Arithmetical Theories.
Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024

On the Proof Theory of Apodictic Syllogistic.
Proceedings of the Advances in Modal Logic, AiML 2024, Prague, Czech Republic, 2024

2023
Towards a logical foundation of randomized computation.
PhD thesis, 2023

An Arithmetic Theory for the Poly-Time Random Functions.
CoRR, 2023

Towards a Logical Foundation of Randomized Computation.
Proceedings of the 2nd Workshop on Bias, 2023

2022
Some Remarks on Counting Propositional Logic.
CoRR, 2022

Curry and Howard Meet Borel.
Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

Two Remarks on Counting Propositional Logic.
Proceedings of 1st Workshop on Bias, 2022

2021
On Measure Quantifiers in First-Order Arithmetic (Long Version).
CoRR, 2021

On Counting Propositional Logic.
CoRR, 2021

On Counting Propositional Logic and Wagner's Hierarchy.
Proceedings of the 22nd Italian Conference on Theoretical Computer Science, 2021

On Measure Quantifiers in First-Order Arithmetic.
Proceedings of the Connecting with Computability, 2021


  Loading...