Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmina Doumane
Person information
- affiliation (PhD 2017): Paris Diderot University, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c17]Amina Doumane:
Regular Expressions for Tree-Width 2 Graphs. ICALP 2022: 121:1-121:20- [c16]David Baelde, Amina Doumane, Denis Kuperberg, Alexis Saurin:
Bouncing Threads for Circular and Non-Wellfounded Proofs: Towards Compositionality with Circular Proofs. LICS 2022: 63:1-63:13 - 2021
- [c15]Amina Doumane:
The Class of Representable Semilattice-Ordered Monoids Is Not a Variety. RAMiCS 2021: 144-158 - [c14]Amina Doumane:
Non-Axiomatizability of the Equational Theories of Positive Relation Algebras (Invited Talk). MFCS 2021: 1:1-1:1 - [c13]Amina Doumane:
Graph Characterization of the Universal Theory of Relations. MFCS 2021: 41:1-41:15 - 2020
- [c12]Amina Doumane, Damien Pous:
Non Axiomatisability of Positive Relation Algebras with Constants, via Graph Homomorphisms. CONCUR 2020: 29:1-29:16 - [c11]Mikolaj Bojanczyk, Amina Doumane:
First-order tree-to-tree functions. LICS 2020: 252-265 - [i2]Mikolaj Bojanczyk, Amina Doumane:
First-order tree-to-tree functions. CoRR abs/2002.09307 (2020) - [i1]David Baelde, Amina Doumane, Denis Kuperberg, Alexis Saurin:
Bouncing threads for infinitary and circular proofs. CoRR abs/2005.08257 (2020)
2010 – 2019
- 2019
- [c10]Amina Doumane, Denis Kuperberg, Damien Pous, Cécilia Pradic:
Kleene Algebra with Hypotheses. FoSSaCS 2019: 207-223 - 2018
- [c9]Amina Doumane, Damien Pous:
Completeness for Identity-free Kleene Lattices. CONCUR 2018: 18:1-18:17 - [c8]Anupam Das
, Amina Doumane, Damien Pous:
Left-Handed Completeness for Kleene algebra, via Cyclic Proofs. LPAR 2018: 271-289 - 2017
- [b1]Amina Doumane:
On the infinitary proof theory of logics with fixed points. (Théorie de la démonstration infinitaire pour les logiques à points fixes). Paris Diderot University, France, 2017 - [c7]Amina Doumane:
Constructive completeness for the linear-time μ-calculus. LICS 2017: 1-12 - 2016
- [c6]David Baelde, Amina Doumane, Alexis Saurin:
Infinitary Proof Theory: the Multiplicative Additive Case. CSL 2016: 42:1-42:17 - [c5]Amina Doumane, David Baelde, Lucca Hirschi, Alexis Saurin:
Towards Completeness via Proof Search in the Linear Time μ-calculus: The case of Büchi inclusions. LICS 2016: 377-386 - 2015
- [c4]David Baelde, Amina Doumane, Alexis Saurin:
Least and Greatest Fixed Points in Ludics. CSL 2015: 549-566 - [c3]Marc Bagnol, Amina Doumane, Alexis Saurin:
On the Dependencies of Logical Rules. FoSSaCS 2015: 436-450 - 2014
- [c2]Marc Bagnol, Amina Doumane, Alexis Saurin:
Analyse de dépendances et correction des réseaux de preuve. JFLA 2014: 159-174 - [c1]Pierre-Marie Pédrot, Amina Doumane, Alexis Saurin:
Nécessité faite loi : de la réduction linéaire de tête à l'évaluation paresseuse. JFLA 2014: 175-189
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-03-14 23:49 CET 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:
