default search action
Pierre Genevès
Person information
- affiliation: CNRS, France
- affiliation (former): EPFL, Lausanne, Switzerland
- affiliation (former): IBM T.J. Watson Research Center, NY, USA
- affiliation (former): University Grenoble Alpes, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j11]Amela Fejza, Pierre Genevès, Nabil Layaïda:
Efficient Enumeration of Recursive Plans in Transformation-based Query Optimizers. Proc. VLDB Endow. 17(11): 3095-3108 (2024) - [c47]Luisa Werner, Nabil Layaïda, Pierre Genevès, Jérôme Euzenat, Damien Graux:
Reproduce, Replicate, Reevaluate. The Long but Safe Way to Extend Machine Learning Methods. AAAI 2024: 15850-15858 - [c46]Amela Fejza, Pierre Genevès, Nabil Layaïda:
A Fast Plan Enumerator for Recursive Queries. ICDE 2024: 5449-5452 - [i14]Chandan Sharma, Pierre Genevès, Nils Gesbert, Nabil Layaïda:
Schema-Based Query Optimisation for Graph Databases. CoRR abs/2403.01863 (2024) - 2023
- [c45]Amela Fejza, Pierre Genevès, Nabil Layaïda, Sarah Chlyah:
The µ-RA System for Recursive Path Queries over Graphs. CIKM 2023: 5041-5045 - [c44]Luisa Werner, Nabil Layaïda, Pierre Genevès, Sarah Chlyah:
Knowledge Enhanced Graph Neural Networks. DSAA 2023: 1-10 - [i13]Luisa Werner, Nabil Layaïda, Pierre Genevès, Sarah Chlyah:
Knowledge Enhanced Graph Neural Networks. CoRR abs/2303.15487 (2023) - [i12]Sarah Chlyah, Nils Gesbert, Pierre Genevès, Nabil Layaïda:
Efficient Iterative Programs with Distributed Data Collections. CoRR abs/2306.07690 (2023) - [i11]Amela Fejza, Pierre Genevès, Nabil Layaïda:
Efficient Enumeration of Recursive Plans in Transformation-based Query Optimizers. CoRR abs/2312.02572 (2023) - 2021
- [c43]Raouf Kerkouche, Gergely Ács, Claude Castelluccia, Pierre Genevès:
Privacy-preserving and bandwidth-efficient federated learning: an application to in-hospital mortality prediction. CHIL 2021: 25-35 - [c42]Raouf Kerkouche, Gergely Ács, Claude Castelluccia, Pierre Genevès:
Compression Boosts Differentially Private Federated Learning. EuroS&P 2021: 304-318 - [c41]Raouf Kerkouche, Gergely Ács, Claude Castelluccia, Pierre Genevès:
Constrained differentially private federated learning for low-bandwidth devices. UAI 2021: 1756-1765 - [i10]Raouf Kerkouche, Gergely Ács, Claude Castelluccia, Pierre Genevès:
Constrained Differentially Private Federated Learning for Low-bandwidth Devices. CoRR abs/2103.00342 (2021) - [i9]Sarah Chlyah, Pierre Genevès, Nabil Layaïda:
Distributed Evaluation of Graph Queries using Recursive Relational Algebra. CoRR abs/2111.12487 (2021) - 2020
- [j10]Hyeonseung Im, Pierre Genevès, Nils Gesbert, Nabil Layaïda:
Backward type inference for XML queries. Theor. Comput. Sci. 823: 69-99 (2020) - [c40]Muideen Lawal, Pierre Genevès, Nabil Layaïda:
A Cost Estimation Technique for Recursive Relational Algebra. CIKM 2020: 3297-3300 - [c39]Louis Jachiet, Pierre Genevès, Nils Gesbert, Nabil Layaïda:
On the Optimization of Recursive Relational Queries: Application to Graph Queries. SIGMOD Conference 2020: 681-697 - [i8]Raouf Kerkouche, Gergely Ács, Claude Castelluccia, Pierre Genevès:
Compression Boosts Differentially Private Federated Learning. CoRR abs/2011.05578 (2020)
2010 – 2019
- 2018
- [j9]Pierre Genevès, Thomas Calmant, Nabil Layaïda, Marion Lepelley, Svetlana Artemova, Jean-Luc Bosson:
Scalable Machine Learning for Predicting At-Risk Profiles Upon Hospital Admission. Big Data Res. 12: 23-34 (2018) - [j8]Melisachew Wudage Chekol, Jérôme Euzenat, Pierre Genevès, Nabil Layaïda:
SPARQL Query Containment Under Schema. J. Data Semant. 7(3): 133-154 (2018) - [j7]Thibaud Michel, Pierre Genevès, Hassen Fourati, Nabil Layaïda:
Attitude estimation for indoor navigation and augmented reality with smartphones. Pervasive Mob. Comput. 46: 96-121 (2018) - [c38]Damien Graux, Louis Jachiet, Pierre Genevès, Nabil Layaïda:
A Multi-Criteria Experimental Ranking of Distributed SPARQL Evaluators. IEEE BigData 2018: 693-702 - [c37]Amela Fejza, Pierre Genevès, Nabil Layaïda, Jean-Luc Bosson:
Scalable and Interpretable Predictive Models for Electronic Health Records. DSAA 2018: 341-350 - [c36]Abdullah Abbas, Pierre Genevès, Cécile Roisin, Nabil Layaïda:
Selectivity Estimation for SPARQL Triple Patterns with Shape Expressions. ICWE 2018: 195-209 - [c35]Thibaud Michel, Pierre Genevès, Nabil Layaïda:
A Method to Quantitatively Evaluate Geo Augmented Reality Applications. ISMAR Adjunct 2018: 9-14 - [c34]Jérôme David, Jérôme Euzenat, Pierre Genevès, Nabil Layaïda:
Evaluation of Query Transformations without Data: Short paper. WWW (Companion Volume) 2018: 1599-1602 - 2017
- [c33]Abdullah Abbas, Pierre Genevès, Cécile Roisin, Nabil Layaïda:
SPARQL Query Containment with ShEx Constraints. ADBIS 2017: 343-356 - [c32]Thibaud Michel, Pierre Genevès, Hassen Fourati, Nabil Layaïda:
On attitude estimation with smartphones. PerCom 2017: 267-275 - 2016
- [c31]Damien Graux, Pierre Genevès, Nabil Layaïda:
Smart Trip Alternatives for the Curious. ISWC (Posters & Demos) 2016 - [c30]Damien Graux, Louis Jachiet, Pierre Genevès, Nabil Layaïda:
SPARQLGX in Action: Efficient Distributed Evaluation of SPARQL with Apache Spark. ISWC (Posters & Demos) 2016 - [c29]Damien Graux, Louis Jachiet, Pierre Genevès, Nabil Layaïda:
SPARQLGX: Efficient Distributed Evaluation of SPARQL with Apache Spark. ISWC (2) 2016: 80-87 - 2015
- [j6]Pierre Genevès, Nabil Layaïda, Alan Schmitt, Nils Gesbert:
Efficiently Deciding μ-Calculus with Converse over Finite Trees. ACM Trans. Comput. Log. 16(2): 16:1-16:41 (2015) - [j5]Nils Gesbert, Pierre Genevès, Nabil Layaïda:
A Logical Approach to Deciding Semantic Subtyping. ACM Trans. Program. Lang. Syst. 38(1): 3:1-3:31 (2015) - [c28]Nicola Guido, Pierre Genevès, Nabil Layaïda, Cécile Roisin:
On Query-Update Independence for SPARQL. CIKM 2015: 1675-1678 - [c27]Pierre Genevès, Nils Gesbert:
XQuery and static typing: tackling the problem of backward axes. ICFP 2015: 88-100 - [c26]Pierre Genevès, Alan Schmitt:
Expressive Logical Combinators for Free. IJCAI 2015: 311-317 - [c25]Martí Bosch, Pierre Genevès, Nabil Layaïda:
Reasoning with Style. IJCAI 2015: 2227-2233 - [c24]Thibaud Michel, Hassen Fourati, Pierre Genevès, Nabil Layaïda:
A comparative analysis of attitude estimation for pedestrian navigation with smartphones. IPIN 2015: 1-10 - [e1]Christine Vanoirbeek, Pierre Genevès:
Proceedings of the 2015 ACM Symposium on Document Engineering, DocEng 2015, Lausanne, Switzerland, September 8-11, 2015. ACM 2015, ISBN 978-1-4503-3307-8 [contents] - 2014
- [b2]Pierre Genevès:
Static Analysis for Data-Centric Web Programming. Grenoble Alpes University, France, 2014 - [j4]Pierre Genevès, Nabil Layaïda:
Equipping IDEs with XML-Path Reasoning Capabilities. ACM Trans. Internet Techn. 13(4): 13:1-13:20 (2014) - [c23]Martí Bosch, Pierre Genevès, Nabil Layaïda:
Automated refactoring for size reduction of CSS style sheets. ACM Symposium on Document Engineering 2014: 13-16 - [i7]Mathieu Razafimahazo, Nabil Layaïda, Pierre Genevès, Thibaud Michel:
Mobile Augmented Reality Applications for Smart Cities. ERCIM News 2014(98) (2014) - 2013
- [c22]Melisachew Wudage Chekol, Jérôme Euzenat, Pierre Genevès, Nabil Layaïda:
Evaluating and Benchmarking SPARQL Query Containment Solvers. ISWC (2) 2013: 408-423 - [c21]Pierre Genevès, Nabil Layaïda:
XML validation: looking backward - strongly typed and flexible XML processing are not incompatible. WWW (Companion Volume) 2013: 219-220 - 2012
- [c20]Melisachew Wudage Chekol, Jérôme Euzenat, Pierre Genevès, Nabil Layaïda:
SPARQL Query Containment Under SHI Axioms. AAAI 2012: 10-16 - [c19]Melisachew Wudage Chekol, Jérôme Euzenat, Pierre Genevès, Nabil Layaïda:
SPARQL Query Containment under RDFS Entailment Regime. IJCAR 2012: 134-148 - [c18]Muhammad Junedi, Pierre Genevès, Nabil Layaïda:
XML query-update independence analysis revisited. ACM Symposium on Document Engineering 2012: 95-98 - [c17]Raquel Araújo de Oliveira, Pierre Genevès, Nabil Layaïda:
Toward automated schema-directed code revision. ACM Symposium on Document Engineering 2012: 103-106 - [c16]Pierre Genevès, Nabil Layaïda, Vincent Quint:
On the analysis of cascading style sheets. WWW 2012: 809-818 - 2011
- [j3]Pierre Genevès, Nabil Layaïda, Vincent Quint:
Impact of XML Schema Evolution. ACM Trans. Internet Techn. 11(1): 4:1-4:27 (2011) - [c15]Melisachew Wudage Chekol, Jérôme Euzenat, Pierre Genevès, Nabil Layaïda:
PSPARQL Query Containment. DBPL 2011 - [c14]Nils Gesbert, Pierre Genevès, Nabil Layaïda:
Parametric polymorphism and semantic subtyping: the logical connection. ICFP 2011: 107-116 - [c13]Pierre Genevès, Nabil Layaïda:
Inconsistent path detection for XML IDEs. ICSE 2011: 983-985 - [c12]Everardo Bárcenas, Pierre Genevès, Nabil Layaïda, Alan Schmitt:
Query Reasoning on Trees with Types, Interleaving, and Counting. IJCAI 2011: 718-723 - 2010
- [c11]Pierre Genevès, Nabil Layaïda:
XML reasoning made practical. ICDE 2010: 1169-1172 - [c10]Pierre Genevès, Nabil Layaïda:
Eliminating dead-code from XQuery programs. ICSE (2) 2010: 305-306 - [c9]Nabil Layaïda, Pierre Genevès:
Debugging standard document formats. WWW 2010: 1269-1272 - [i6]Everardo Bárcenas, Pierre Genevès, Nabil Layaïda, Alan Schmitt:
A Tree Logic with Graded Paths and Nominals. CoRR abs/1005.5623 (2010) - [i5]Everardo Bárcenas, Pierre Genevès, Nabil Layaïda, Alan Schmitt:
On the Count of Trees. CoRR abs/1008.5073 (2010)
2000 – 2009
- 2009
- [c8]Everardo Bárcenas, Pierre Genevès, Nabil Layaïda:
On the analysis of queries with counting constraints. ACM Symposium on Document Engineering 2009: 21-24 - [c7]Pierre Genevès, Nabil Layaïda, Vincent Quint:
Identifying query incompatibilities with evolving XML schemas. ICFP 2009: 221-230 - 2008
- [i4]Pierre Genevès:
Logics for XML. CoRR abs/0810.4460 (2008) - [i3]Pierre Genevès, Nabil Layaïda, Vincent Quint:
Ensuring Query Compatibility with Evolving XML Schemas. CoRR abs/0811.4324 (2008) - [i2]Pierre Genevès, Nabil Layaïda:
XML Static Analyzer User Manual. CoRR abs/0812.3550 (2008) - [i1]Pierre Genevès, Nabil Layaïda:
Static Analysis of XML Programs. ERCIM News 2008(72) (2008) - 2007
- [j2]Pierre Genevès, Nabil Layaïda:
Deciding XPath containment with MSO. Data Knowl. Eng. 63(1): 108-136 (2007) - [c6]Pierre Genevès, Nabil Layaïda, Alan Schmitt:
XPath Typing Using a Modal Logic with Converse for Finite Trees. PLAN-X 2007: 61-72 - [c5]Pierre Genevès, Nabil Layaïda, Alan Schmitt:
Efficient static analysis of XML paths and types. PLDI 2007: 342-351 - 2006
- [b1]Pierre Genevès:
Logics for XML. (Logiques pour XML). Grenoble Institute of Technology, France, 2006 - [j1]Pierre Genevès, Nabil Layaïda:
A system for the static analysis of XPath. ACM Trans. Inf. Syst. 24(4): 475-502 (2006) - [c4]Pierre Genevès, Nabil Layaïda:
Comparing XML path expressions. ACM Symposium on Document Engineering 2006: 65-74 - 2005
- [c3]Pierre Genevès, Kristoffer Høgsbro Rose:
Compiling XPath for streaming access policy. ACM Symposium on Document Engineering 2005: 52-54 - 2004
- [c2]Pierre Genevès, Jean-Yves Vion-Dury:
Logic-based XPath optimization. ACM Symposium on Document Engineering 2004: 211-219 - [c1]Pierre Genevès:
Improving Efficiency of XPath-Based XML Querying. IFIP Student Forum 2004: 143-154
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-09-21 01: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