default search action
Bruno Marnette
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [i4]Jessica Schrouff, Kai Wohlfahrt
, Bruno Marnette, Liam Atkinson:
Inferring Javascript types using Graph Neural Networks. CoRR abs/1905.06707 (2019) - 2018
- [c8]Chaiyong Ragkhitwetsagul
A picture is worth a thousand words: Code clone detection based on image similarity. IWSC 2018: 44-50 - 2012
- [i3]Bruno Marnette:
Resolution and Datalog Rewriting Under Value Invention and Equality Constraints. CoRR abs/1212.0254 (2012) - 2011
- [j2]Bruno Marnette, Giansalvatore Mecca, Paolo Papotti, Salvatore Raunich, Donatello Santoro:
++Spicy: an OpenSource Tool for Second-Generation Schema Mapping and Data Exchange. Proc. VLDB Endow. 4(12): 1438-1441 (2011) - 2010
- [b1]Bruno Marnette:
Tractable schema mappings under oblivious termination. University of Oxford, UK, 2010 - [j1]Bruno Marnette, Giansalvatore Mecca, Paolo Papotti:
Scalable Data Exchange with Functional Dependencies. Proc. VLDB Endow. 3(1): 105-116 (2010) - [c7]François Bry
Datalog Relaunched: Simulation Unification and Value Invention. Datalog 2010: 321-350 - [c6]Bruno Marnette, Floris Geerts
Static analysis of schema-mappings ensuring oblivious termination. ICDT 2010: 183-195 - [c5]Andrea Calì, Georg Gottlob
Datalog+/-: A Family of Logical Knowledge Representation and Query Languages for New Applications. LICS 2010: 228-242
2000 – 2009
- 2009
- [c4]Georg Gottlob
HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results. Graph Theory, Computational Intelligence and Thought 2009: 87-99 - [c3]Bruno Marnette:
Generalized schema-mappings: from termination to tractability. PODS 2009: 13-22 - [p1]François Bry
SPARQLog: SPARQL with Rules and Quantification. Semantic Web Information Management 2009: 341-370 - 2008
- [c2]François Bry, Tim Furche, Clemens Ley, Benedikt Linse, Bruno Marnette:
Taming Existence in RDF Querying. RR 2008: 236-237 - 2007
- [c1]Bruno Marnette, Viktor Kuncak, Martin C. Rinard:
Polynomial Constraints for Sets with Cardinality Bounds. FoSSaCS 2007: 258-273 - 2005
- [i2]Viktor Kuncak, Martin C. Rinard, Bruno Marnette:
On Algorithms and Complexity for Sets with Cardinality Constraints. Deduction and Applications 2005 - [i1]Bruno Marnette, Viktor Kuncak, Martin C. Rinard:
On Algorithms and Complexity for Sets with Cardinality Constraints. CoRR abs/cs/0508123 (2005)
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-04-25 05:44 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: