default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAntoine Amarilli
Person information
- affiliation: Télécom Paris, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j18]Antoine Amarilli, Florent Capelli:
Tractable Circuits in Database Theory. SIGMOD Rec. 53(2): 6-20 (2024)- [c47]Antoine Amarilli, Benny Kimelfeld, Sébastien Labbé, Stefan Mengel:
Skyline Operators for Document Spanners. ICDT 2024: 7:1-7:18 - [c46]Antoine Amarilli, Timothy van Bremen, Kuldeep S. Meel:
Conjunctive Queries on Probabilistic Graphs: The Limits of Approximability. ICDT 2024: 15:1-15:20 - [c45]Antoine Amarilli, Pierre Bourhis, Florent Capelli, Mikaël Monet:
Ranked Enumeration for MSO on Trees via Knowledge Compilation. ICDT 2024: 25:1-25:18 - [e1]Antoine Amarilli
, Alin Deutsch:
The Provenance of Elegance in Computation - Essays Dedicated to Val Tannen, Tannen's Festschrift, May 24-25, 2024, University of Pennsylvania, Philadelphia, PA, USA. OASIcs 119, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-320-1 [contents] - [i53]Antoine Amarilli, Mikaël Monet, Dan Suciu:
The Non-Cancelling Intersections Conjecture. CoRR abs/2401.16210 (2024) - [i52]Antoine Amarilli, Marcelo Arenas, YooJung Choi, Mikaël Monet, Guy Van den Broeck, Benjie Wang:
A Circus of Circuits: Connections Between Decision Diagrams, Circuits, and Automata. CoRR abs/2404.09674 (2024) - [i51]Antoine Amarilli, Florent Capelli:
Tractable Circuits in Database Theory. CoRR abs/2407.01127 (2024) - [i50]Antoine Amarilli:
Survey of Results on the ModPath and ModCycle Problems. CoRR abs/2409.00770 (2024) - 2023
- [b2]Antoine Amarilli:
Query Evaluation: Enumeration, Maintenance, Reliability. Polytechnic Institute of Paris, Palaiseau, France, 2023 - [j17]Antoine Amarilli:
Should conferences still require mandatory attendance? A column by Theoretical Computer Scientists for Future (TCS4F). Bull. EATCS 139 (2023) - [j16]Antoine Amarilli, Charles Paperman:
Locality and Centrality: The Variety ZG. Log. Methods Comput. Sci. 19(4) (2023) - [j15]Osnat Drien, Matanya Freiman, Antoine Amarilli, Yael Amsterdamer:
Query-Guided Resolution in Uncertain Databases. Proc. ACM Manag. Data 1(2): 180:1-180:27 (2023) - [c44]Antoine Amarilli:
Uniform Reliability for Unbounded Homomorphism-Closed Graph Queries. ICDT 2023: 14:1-14:17 - [c43]Antoine Amarilli, Mikaël Monet:
Enumerating Regular Languages with Bounded Delay. STACS 2023: 8:1-8:18 - [i49]Antoine Amarilli:
Degree-3 Planar Graphs as Topological Minors of Wall Graphs in Polynomial Time. CoRR abs/2302.03461 (2023) - [i48]Antoine Amarilli, Benny Kimelfeld, Sébastien Labbé, Stefan Mengel:
Skyline Operators for Document Spanners. CoRR abs/2304.06155 (2023) - [i47]Antoine Amarilli, Timothy van Bremen, Kuldeep S. Meel:
Conjunctive Queries on Probabilistic Graphs: The Limits of Approximability. CoRR abs/2309.13287 (2023) - [i46]Antoine Amarilli, Pierre Bourhis, Florent Capelli, Mikaël Monet:
Ranked Enumeration for MSO on Trees via Knowledge Compilation. CoRR abs/2310.00731 (2023) - 2022
- [j14]Antoine Amarilli, Ismail Ilkan Ceylan:
The Dichotomy of Evaluating Homomorphism-Closed Queries on Probabilistic Graphs. Log. Methods Comput. Sci. 18(1) (2022) - [j13]Antoine Amarilli, Michael Benedikt:
When Can We Answer Queries Using Result-Bounded Data Interfaces? Log. Methods Comput. Sci. 18(2) (2022) - [j12]Antoine Amarilli, Benny Kimelfeld:
Uniform Reliability of Self-Join-Free Conjunctive Queries. Log. Methods Comput. Sci. 18(4) (2022) - [c42]Antoine Amarilli, Christophe Claramunt, Demetrios Zeinalipour-Yazti:
Climate change and computing: facts, perspectives and an open discussion. DEBS 2022: 6 - [c41]Antoine Amarilli, Mikaël Monet:
Weighted Counting of Matchings in Unbounded-Treewidth Graph Families. MFCS 2022: 9:1-9:15 - [c40]Antoine Amarilli, Louis Jachiet, Martin Muñoz, Cristian Riveros:
Efficient Enumeration for Annotated Grammars. PODS 2022: 291-300 - [c39]Antoine Amarilli, Yael Amsterdamer:
Worst-case analysis for interactive evaluation of Boolean provenance. TaPP 2022: 6:1-6:8 - [i45]Antoine Amarilli, Louis Jachiet, Martin Muñoz, Cristian Riveros:
Efficient enumeration algorithms for annotated grammars. CoRR abs/2201.00549 (2022) - [i44]Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom:
Query Answering with Transitive and Linear-Ordered Data. CoRR abs/2202.08555 (2022) - [i43]Antoine Amarilli, Mikaël Monet:
Weighted Counting of Matchings in Unbounded-Treewidth Graph Families. CoRR abs/2205.00851 (2022) - [i42]Antoine Amarilli, Yael Amsterdamer:
Worst-case Analysis for Interactive Evaluation of Boolean Provenance. CoRR abs/2205.04224 (2022) - [i41]Antoine Amarilli:
Uniform Reliability for Unbounded Homomorphism-Closed Graph Queries. CoRR abs/2209.11177 (2022) - [i40]Antoine Amarilli, Mikaël Monet:
Enumerating Regular Languages in Constant Delay. CoRR abs/2209.14878 (2022) - [i39]Antoine Amarilli, Michael Benedikt:
Tighter bounds for query answering with Guarded TGDs. CoRR abs/2212.11362 (2022) - 2021
- [j11]Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth:
Constant-Delay Enumeration for Nondeterministic Document Spanners. ACM Trans. Database Syst. 46(1): 2:1-2:30 (2021) - [c38]Antoine Amarilli, Louis Jachiet, Charles Paperman:
Dynamic Membership for Regular Languages. ICALP 2021: 116:1-116:17 - [c37]Osnat Drien, Antoine Amarilli, Yael Amsterdamer:
Managing Consent for Data Access in Shared Databases. ICDE 2021: 1949-1954 - [c36]Antoine Amarilli, Benny Kimelfeld:
Uniform Reliability of Self-Join-Free Conjunctive Queries. ICDT 2021: 17:1-17:17 - [i38]Antoine Amarilli, Charles Paperman:
Locality and Centrality: The Variety ZG. CoRR abs/2102.07724 (2021) - [i37]Antoine Amarilli, Louis Jachiet, Charles Paperman:
Dynamic Membership for Regular Languages. CoRR abs/2102.07728 (2021) - 2020
- [j10]Antoine Amarilli, Florent Capelli, Mikaël Monet, Pierre Senellart:
Connecting Knowledge Compilation Classes and Width Parameters. Theory Comput. Syst. 64(5): 861-914 (2020) - [j9]Antoine Amarilli, Florent Capelli, Mikaël Monet, Pierre Senellart:
Correction to: Connecting Knowledge Compilation Classes and Width Parameters. Theory Comput. Syst. 64(5): 915 (2020) - [j8]Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth:
Constant-Delay Enumeration for Nondeterministic Document Spanners. SIGMOD Rec. 49(1): 25-32 (2020) - [j7]Antoine Amarilli, Michael Benedikt:
Finite Open-world Query Answering with Number Restrictions. ACM Trans. Comput. Log. 21(4): 27:1-27:73 (2020) - [c35]Julien Romero, Nicoleta Preda, Antoine Amarilli, Fabian M. Suchanek:
Computing and Illustrating Query Rewritings on Path Views with Binding Patterns. CIKM 2020: 3449-3452 - [c34]Julien Romero, Nicoleta Preda, Antoine Amarilli, Fabian M. Suchanek:
Equivalent Rewritings on Path Views with Binding Patterns. ESWC 2020: 446-462 - [c33]Antoine Amarilli, Ismail Ilkan Ceylan:
A Dichotomy for Homomorphism-Closed Queries on Probabilistic Graphs. ICDT 2020: 5:1-5:20 - [i36]Antoine Amarilli, Michael Benedikt:
Finite Open-World Query Answering with Number Restrictions. CoRR abs/2003.02521 (2020) - [i35]Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth:
Constant-Delay Enumeration for Nondeterministic Document Spanners. CoRR abs/2003.02576 (2020) - [i34]Julien Romero, Nicoleta Preda, Antoine Amarilli, Fabian M. Suchanek:
Equivalent Rewritings on Path Views with Binding Patterns. CoRR abs/2003.07316 (2020)
2010 – 2019
- 2019
- [j6]Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart:
Evaluating Datalog via Tree Automata and Cycluits. Theory Comput. Syst. 63(7): 1620-1678 (2019) - [j5]Antoine Amarilli, Mouhamadou Lamine Ba, Daniel Deutch, Pierre Senellart:
Computing possible and certain answers over order-incomplete data. Theor. Comput. Sci. 797: 42-76 (2019) - [c32]Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth:
Constant-Delay Enumeration for Nondeterministic Document Spanners. ICDT 2019: 22:1-22:19 - [c31]Andy Shih, Guy Van den Broeck, Paul Beame, Antoine Amarilli:
Smoothing Structured Decomposable Circuits. NeurIPS 2019: 11412-11422 - [c30]Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth:
Enumeration on Trees with Tractable Combined Complexity and Efficient Updates. PODS 2019: 89-103 - [i33]Andy Shih, Guy Van den Broeck, Paul Beame, Antoine Amarilli:
Smoothing Structured Decomposable Circuits. CoRR abs/1906.00311 (2019) - [i32]Antoine Amarilli, Benny Kimelfeld:
Model Counting for Conjunctive Queries Without Self-Joins. CoRR abs/1908.07093 (2019) - [i31]Antoine Amarilli, Ismail Ilkan Ceylan:
A Dichotomy for Homomorphism-Closed Queries on Probabilistic Graphs. CoRR abs/1910.02048 (2019) - 2018
- [j4]Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom:
Query Answering with Transitive and Linear-Ordered Data. J. Artif. Intell. Res. 63: 191-264 (2018) - [c29]Antoine Amarilli, Charles Paperman:
Topological Sorting with Regular Constraints. ICALP 2018: 115:1-115:14 - [c28]Antoine Amarilli, Pierre Bourhis, Stefan Mengel:
Enumeration on Trees under Relabelings. ICDT 2018: 5:1-5:18 - [c27]Antoine Amarilli, Mikaël Monet, Pierre Senellart:
Connecting Width and Structure in Knowledge Compilation. ICDT 2018: 6:1-6:17 - [c26]Antoine Amarilli, Michael Benedikt:
When Can We Answer Queries Using Result-Bounded Data Interfaces? PODS 2018: 281-293 - [i30]Antoine Amarilli, Mouhamadou Lamine Ba, Daniel Deutch, Pierre Senellart:
Computing Possible and Certain Answers over Order-Incomplete Data. CoRR abs/1801.06396 (2018) - [i29]Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth:
Constant-Delay Enumeration for Nondeterministic Document Spanners. CoRR abs/1807.09320 (2018) - [i28]Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart:
Evaluating Datalog via Tree Automata and Cycluits. CoRR abs/1808.04663 (2018) - [i27]Antoine Amarilli, Michael Benedikt:
When Can We Answer Queries Using Result-Bounded Data Interfaces? CoRR abs/1810.07822 (2018) - [i26]Antoine Amarilli, Florent Capelli, Mikaël Monet, Pierre Senellart:
Connecting Knowledge Compilation Classes and Width Parameters. CoRR abs/1811.02944 (2018) - [i25]Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth:
Enumeration on Trees with Tractable Combined Complexity and Efficient Updates. CoRR abs/1812.09519 (2018) - 2017
- [c25]Antoine Amarilli, Pierre Bourhis, Louis Jachiet, Stefan Mengel:
A Circuit-Based Approach to Efficient Enumeration. ICALP 2017: 111:1-111:15 - [c24]Antoine Amarilli, Yael Amsterdamer, Tova Milo, Pierre Senellart:
Top-k Querying of Unknown Values under Order Constraints. ICDT 2017: 5:1-5:18 - [c23]Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart:
Combined Tractability of Query Evaluation via Tree Automata and Cycluits. ICDT 2017: 6:1-6:19 - [c22]Antoine Amarilli, Mikaël Monet, Pierre Senellart:
Conjunctive Queries on Probabilistic Graphs: Combined Complexity. PODS 2017: 217-232 - [c21]Antoine Amarilli, Mouhamadou Lamine Ba, Daniel Deutch, Pierre Senellart:
Possible and Certain Answers for Queries over Order-Incomplete Data. TIME 2017: 4:1-4:19 - [c20]Luis Galárraga, Simon Razniewski, Antoine Amarilli, Fabian M. Suchanek:
Predicting Completeness in Knowledge Bases. WSDM 2017: 375-383 - [i24]Antoine Amarilli, Yael Amsterdamer, Tova Milo, Pierre Senellart:
Top-k Querying of Unknown Values under Order Constraints (Extended Version). CoRR abs/1701.02634 (2017) - [i23]Antoine Amarilli, Pierre Bourhis, Louis Jachiet, Stefan Mengel:
A Circuit-Based Approach to Efficient Enumeration. CoRR abs/1702.05589 (2017) - [i22]Antoine Amarilli, Mikaël Monet, Pierre Senellart:
Conjunctive Queries on Probabilistic Graphs: Combined Complexity. CoRR abs/1703.03201 (2017) - [i21]Antoine Amarilli, Michael Benedikt:
When Can We Answer Queries Using Result-Bounded Data Interfaces? CoRR abs/1706.07936 (2017) - [i20]Antoine Amarilli, Charles Paperman:
A Dichotomy on Constrained Topological Sorting. CoRR abs/1707.04310 (2017) - [i19]Antoine Amarilli, Mouhamadou Lamine Ba, Daniel Deutch, Pierre Senellart:
Possible and Certain Answers for Queries over Order-Incomplete Data. CoRR abs/1707.07222 (2017) - [i18]Antoine Amarilli, Pierre Bourhis, Stefan Mengel:
Enumeration on Trees under Relabelings. CoRR abs/1709.06185 (2017) - [i17]Antoine Amarilli, Mikaël Monet, Pierre Senellart:
Connecting Width and Structure in Knowledge Compilation. CoRR abs/1709.06188 (2017) - 2016
- [b1]Antoine Amarilli:
Leveraging the Structure of Uncertain Data. (Tirer parti de la structure des données incertaines). Télécom ParisTech, France, 2016 - [j3]Ruiming Tang, Antoine Amarilli, Pierre Senellart, Stéphane Bressan:
A Framework for Sampling-Based XML Data Pricing. Trans. Large Scale Data Knowl. Centered Syst. 24: 116-138 (2016) - [c19]Antoine Amarilli, Marc Beunardeau, Rémi Géraud, David Naccache:
Failure is Also an Option. The New Codebreakers 2016: 161-165 - [c18]Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom:
Query Answering with Transitive and Linear-Ordered Data. IJCAI 2016: 893-899 - [c17]Antoine Amarilli, Pierre Bourhis, Pierre Senellart:
Tractable Lineages on Treelike Instances: Limits and Extensions. PODS 2016: 355-370 - [c16]Antoine Amarilli, Silviu Maniu, Mikaël Monet:
Challenges for Efficient Query Evaluation on Structured Probabilistic Data. SUM 2016: 323-330 - [i16]Antoine Amarilli, Pierre Bourhis, Pierre Senellart:
Tractable Lineages on Treelike Instances: Limits and Extensions. CoRR abs/1604.02761 (2016) - [i15]Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom:
Query Answering with Transitive and Linear-Ordered Data. CoRR abs/1607.00813 (2016) - [i14]Antoine Amarilli, Silviu Maniu, Mikaël Monet:
Challenges for Efficient Query Evaluation on Structured Probabilistic Data. CoRR abs/1607.05538 (2016) - [i13]Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart:
Combined Tractability of Query Evaluation via Tree Automata and Cycluits (Extended Version). CoRR abs/1612.04203 (2016) - [i12]Luis Galárraga, Simon Razniewski, Antoine Amarilli, Fabian M. Suchanek:
Predicting Completeness in Knowledge Bases. CoRR abs/1612.05786 (2016) - 2015
- [j2]Antoine Amarilli:
Possibility in probabilistic XML. Ingénierie des Systèmes d Inf. 20(5): 53-75 (2015) - [j1]Antoine Amarilli, Silviu Maniu, Pierre Senellart:
Intensional data on the web. SIGWEB Newsl. 2015(Summer): 4:1-4:12 (2015) - [c15]Antoine Amarilli, Pierre Bourhis, Pierre Senellart:
Provenance Circuits for Trees and Treelike Instances. ICALP (2) 2015: 56-68 - [c14]Antoine Amarilli, Michael Benedikt:
Combining Existential Rules and Description Logics. IJCAI 2015: 2691-2697 - [c13]Antoine Amarilli, Michael Benedikt:
Finite Open-World Query Answering with Number Restrictions. LICS 2015: 305-316 - [c12]Antoine Amarilli:
Structurally Tractable Uncertain Data. SIGMOD PhD Symposium 2015: 39-44 - [c11]Aliaksandr Talaika, Joanna Biega, Antoine Amarilli, Fabian M. Suchanek:
IBEX: Harvesting Entities from the Web Using Unique Identifiers. WebDB 2015: 13-19 - [i11]Antoine Amarilli, Michael Benedikt:
Combining Existential Rules and Description Logics (Extended Version). CoRR abs/1505.00326 (2015) - [i10]Aliaksandr Talaika, Joanna Biega, Antoine Amarilli, Fabian M. Suchanek:
Harvesting Entities from the Web Using Unique Identifiers - IBEX. CoRR abs/1505.00841 (2015) - [i9]Antoine Amarilli, Michael Benedikt:
Finite Open-World Query Answering with Number Restrictions (Extended Version). CoRR abs/1505.04216 (2015) - [i8]Antoine Amarilli:
Structurally Tractable Uncertain Data. CoRR abs/1507.04955 (2015) - [i7]Antoine Amarilli, Pierre Bourhis, Pierre Senellart:
Provenance Circuits for Trees and Treelike Instances (Extended Version). CoRR abs/1511.08723 (2015) - 2014
- [c10]Antoine Amarilli:
The Possibility Problem for Probabilistic XML. AMW 2014 - [c9]Antoine Amarilli, Luis Galárraga, Nicoleta Preda, Fabian M. Suchanek:
Recent Topics of Research around the YAGO Knowledge Base. APWeb 2014: 1-12 - [c8]Antoine Amarilli, Yael Amsterdamer, Tova Milo:
Uncertainty in Crowd Data Sourcing Under Structural Constraints. DASFAA Workshops 2014: 351-359 - [c7]Ruiming Tang, Antoine Amarilli, Pierre Senellart, Stéphane Bressan:
Get a Sample for a Discount - Sampling-Based XML Data Pricing. DEXA (1) 2014: 20-34 - [c6]Antoine Amarilli, Yael Amsterdamer, Tova Milo:
On the Complexity of Mining Itemsets from the Crowd Using Taxonomies. ICDT 2014: 15-25 - [i6]Antoine Amarilli, Yael Amsterdamer, Tova Milo:
Uncertainty in Crowd Data Sourcing under Structural Constraints. CoRR abs/1403.0783 (2014) - [i5]Antoine Amarilli:
The Possibility Problem for Probabilistic XML (Extended Version). CoRR abs/1404.3131 (2014) - 2013
- [c5]Antoine Amarilli, Pierre Senellart:
On the Connections between Relational and XML Probabilistic Data Models. BNCOD 2013: 121-134 - [i4]Antoine Amarilli, Yael Amsterdamer, Tova Milo:
On the Complexity of Mining Itemsets from the Crowd Using Taxonomies. CoRR abs/1312.3248 (2013) - 2012
- [c4]Antoine Amarilli, Fabrice Ben Hamouda, Florian Bourse, Robin Morisset, David Naccache, Pablo Rauzy:
From Rational Number Reconstruction to Set Reconciliation and File Synchronization. TGC 2012: 1-18 - [c3]Marilena Oita, Antoine Amarilli, Pierre Senellart:
Cross-Fertilizing Deep Web Analysis and Ontology Enrichment. VLDS 2012: 5-8 - [i3]Antoine Amarilli, Marc Jeanmougin:
A Proof of the Pumping Lemma for Context-Free Languages Through Pushdown Automata. CoRR abs/1207.2819 (2012) - 2011
- [c2]Antoine Amarilli, David Naccache, Pablo Rauzy, Emil Simion:
Can a Program Reverse-Engineer Itself? IMACC 2011: 1-9 - [c1]Antoine Amarilli, Sascha Müller, David Naccache, Dan Page, Pablo Rauzy, Michael Tunstall:
Can Code Polymorphism Limit Information Leakage? WISTP 2011: 1-21 - [i2]Antoine Amarilli, Sascha Müller, David Naccache, Daniel Page, Pablo Rauzy, Michael Tunstall:
Can Code Polymorphism Limit Information Leakage? IACR Cryptol. ePrint Arch. 2011: 99 (2011) - [i1]Antoine Amarilli, David Naccache, Pablo Rauzy, Emil Simion:
Can a Program Reverse-Engineer Itself? IACR Cryptol. ePrint Arch. 2011: 497 (2011)
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-12-04 20:17 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:
