default search action
Aude Maignan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i4]Jean-Guillaume Dumas, Alexis Galan, Bruno Grenet, Aude Maignan, Daniel S. Roche:
Communication Optimal Unbalanced Private Set Union. CoRR abs/2402.16393 (2024) - 2023
- [j9]Ross C. McPhedran, Tony C. Scott
, Aude Maignan:
The Keiper-Li Criterion for the Riemann Hypothesis and Generalized Lambert Functions. ACM Commun. Comput. Algebra 57(3): 85-110 (2023) - [j8]Jean-Guillaume Dumas, Aude Maignan
VESPo: Verified Evaluation of Secret Polynomials (with application to dynamic proofs of retrievability). Proc. Priv. Enhancing Technol. 2023(3): 354-374 (2023) - 2022
- [c11]Paul Cousin
Organic Structures Emerging From Bio-Inspired Graph-Rewriting Automata. SYNASC 2022: 293-296 - 2021
- [j7]Roderick Edwards
Correction to: A class of discrete dynamical systems with properties of both cellular automata and L-systems. Nat. Comput. 20(4): 829 (2021) - [c10]Gaspard Anthoine, Jean-Guillaume Dumas, Mélanie de Jonghe, Aude Maignan, Clément Pernet, Michael Hanling, Daniel S. Roche:
Dynamic proofs of retrievability with low server storage. USENIX Security Symposium 2021: 537-554 - [i3]Jean-Guillaume Dumas
VESPo: Verified Evaluation of Secret Polynomials. CoRR abs/2110.02022 (2021) - 2020
- [j6]Roderick Edwards
A class of discrete dynamical systems with properties of both cellular automata and L-systems. Nat. Comput. 19(3): 609-641 (2020) - [i2]Gaspard Anthoine, Jean-Guillaume Dumas
Dynamic proofs of retrievability with low server storage. CoRR abs/2007.12556 (2020)
2010 – 2019
- 2019
- [c9]Michael Hanling, Gaspard Anthoine, Jean-Guillaume Dumas, Aude Maignan
Poster: Proofs of Retrievability with Low Server Storage. CCS 2019: 2601-2603 - 2018
- [j5]David Eppstein, Philipp Kindermann
On the Planar Split Thickness of Graphs. Algorithmica 80(3): 977-994 (2018) - [c8]Soledad Berríos, Julio López Fenner
Random Chromatin Neighborhoods in 2n=40 Mus m. domesticus Meiotic Cells: P-Percolation and Image Segmentation. MLCSB 2018: 142-156 - [c7]Stéphane Despréaux, Aude Maignan
GPaR: A Parallel Graph Rewriting Tool. SYNASC 2018: 53-60 - 2017
- [c6]Rachid Echahed, Aude Maignan
Parallel Graph Rewriting with Overlapping Rules. LPAR 2017: 300-318 - [i1]Rachid Echahed, Aude Maignan:
Parallel Graph Rewriting with Overlapping Rules. CoRR abs/1701.06790 (2017) - 2016
- [j4]Aude Maignan
Fleshing out the generalized Lambert W function. ACM Commun. Comput. Algebra 50(2): 45-60 (2016) - [c5]David Eppstein, Philipp Kindermann
On the Planar Split Thickness of Graphs. LATIN 2016: 403-415
2000 – 2009
- 2003
- [c4]Paul Caspi, Adrian Curic, Aude Maignan
Translating Discrete-Time Simulink to Lustre. EMSOFT 2003: 84-99 - [c3]Paul Caspi, Adrian Curic, Aude Maignan
From simulink to SCADE/lustre to TTA: a layered approach for distributed embedded applications. LCTES 2003: 153-162 - 2001
- [j3]Aude Maignan
Real Solving of Elementary-Algebraic Systems. Numer. Algorithms 27(2): 153-167 (2001) - [c2]Jean Della Dora, Aude Maignan
Hybrid computation. ISSAC 2001: 101-108 - 2000
- [j2]Aude Maignan
On Symbolic-Numeric Solving of Sine-Polynomial Equations. J. Complex. 16(1): 274-285 (2000)
1990 – 1999
- 1999
- [j1]Aude Maignan:
Real solving of ill-conditioned sine-polynomials equations. SIGSAM Bull. 33(3): 17 (1999) - 1998
- [c1]Aude Maignan
Solving One and Two-Dimensional Exponential Polynomial Systems. ISSAC 1998: 215-221
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-05-08 21:45 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: