Aude Maignan

Orcid: 0000-0002-0905-2515

According to our database¹, Aude Maignan authored at least 22 papers between 1998 and 2025.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2025

Optimal Communication Unbalanced Private Set Union.

[BibT_eX]

[DOI]

Proceedings of the Applied Cryptography and Network Security, 2025

2024

Communication Optimal Unbalanced Private Set Union.

[BibT_eX]

[DOI]

CoRR, 2024

2023

The Keiper-Li Criterion for the Riemann Hypothesis and Generalized Lambert Functions.

[BibT_eX]

[DOI]

Ross C. McPhedran

Tony C. Scott

Aude Maignan

ACM Commun. Comput. Algebra, September, 2023

VESPo: Verified Evaluation of Secret Polynomials (with application to dynamic proofs of retrievability).

[BibT_eX]

[DOI]

Proc. Priv. Enhancing Technol., July, 2023

2022

Organic Structures Emerging From Bio-Inspired Graph-Rewriting Automata.

[BibT_eX]

[DOI]

Paul Cousin

Aude Maignan

Proceedings of the 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2022

2021

Correction to: A class of discrete dynamical systems with properties of both cellular automata and L-systems.

[BibT_eX]

[DOI]

Roderick Edwards

Aude Maignan

Nat. Comput., 2021

VESPo: Verified Evaluation of Secret Polynomials.

[BibT_eX]

[DOI]

CoRR, 2021

Dynamic proofs of retrievability with low server storage.

[BibT_eX]

[DOI]

Proceedings of the 30th USENIX Security Symposium, 2021

2020

A class of discrete dynamical systems with properties of both cellular automata and L-systems.

[BibT_eX]

[DOI]

Roderick Edwards

Aude Maignan

Nat. Comput., 2020

2019

Poster: Proofs of Retrievability with Low Server Storage.

[BibT_eX]

[DOI]

Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

2018

GPaR: A Parallel Graph Rewriting Tool.

[BibT_eX]

[DOI]

Stéphane Despréaux

Aude Maignan

Proceedings of the 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2018

Random Chromatin Neighborhoods in 2n=40 Mus m. domesticus Meiotic Cells: P-Percolation and Image Segmentation.

[BibT_eX]

[DOI]

Soledad Berríos

Julio López Fenner

Aude Maignan

Proceedings of the Molecular Logic and Computational Synthetic Biology, 2018

2017

Parallel Graph Rewriting with Overlapping Rules.

[BibT_eX]

[DOI]

Rachid Echahed

Aude Maignan

Proceedings of the LPAR-21, 2017

2016

Fleshing out the generalized Lambert <i>W</i> function.

[BibT_eX]

[DOI]

Aude Maignan

Tony C. Scott

ACM Commun. Comput. Algebra, 2016

On the Planar Split Thickness of Graphs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2003

From simulink to SCADE/lustre to TTA: a layered approach for distributed embedded applications.

[BibT_eX]

[DOI]

Proceedings of the 2003 Conference on Languages, 2003

Translating Discrete-Time Simulink to Lustre.

[BibT_eX]

[DOI]

Proceedings of the Embedded Software, Third International Conference, 2003

2001

Real Solving of Elementary-Algebraic Systems.

[BibT_eX]

[DOI]

Aude Maignan

Numer. Algorithms, 2001

Hybrid computation.

[BibT_eX]

[DOI]

Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, 2001

2000

On Symbolic-Numeric Solving of Sine-Polynomial Equations.

[BibT_eX]

[DOI]

Aude Maignan

J. Complex., 2000

1999

Real solving of ill-conditioned sine-polynomials equations.

[BibT_eX]

[DOI]

Aude Maignan

SIGSAM Bull., 1999

1998

Solving One and Two-Dimensional Exponential Polynomial Systems.

[BibT_eX]

[DOI]

Aude Maignan

Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation, 1998

Aude Maignan

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...