default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLucas Bordeaux
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[c26]Nicolas Durrande, Vincent Adam, Lucas Bordeaux, Stefanos Eleftheriadis, James Hensman:
Banded Matrix Operators for Gaussian Markov Models in the Automatic Differentiation Era. AISTATS 2019: 2780-2789- [i4]Nicolas Durrande, Vincent Adam
, Lucas Bordeaux, Stefanos Eleftheriadis, James Hensman:
Banded Matrix Operators for Gaussian Markov Models in the Automatic Differentiation Era. CoRR abs/1902.10078 (2019) - 2016
- [j9]Jonathan Taylor, Lucas Bordeaux, Thomas J. Cashman, Bob Corish, Cem Keskin, Toby Sharp, Eduardo Soto, David Sweeney, Julien P. C. Valentin, Benjamin Luff, Arran Topalian, Erroll Wood, Sameh Khamis, Pushmeet Kohli, Shahram Izadi, Richard Banks, Andrew W. Fitzgibbon, Jamie Shotton:
Efficient and precise interactive hand tracking through joint, continuous optimization of pose and correspondences. ACM Trans. Graph. 35(4): 143:1-143:12 (2016) - [c25]Yoad Lewenberg, Yoram Bachrach, Lucas Bordeaux, Pushmeet Kohli:
Political Dimensionality Estimation Using a Probabilistic Graphical Model. UAI 2016 - 2014
- [e1]Lucas Bordeaux, Youssef Hamadi, Pushmeet Kohli:
Tractability: Practical Approaches to Hard Problems. Cambridge University Press 2014, ISBN 9781139177801 [contents] - [i3]Lucas Bordeaux, Marco Cadoli, Toni Mancini:
A Unifying Framework for Structural Properties of CSPs: Definitions, Complexity, Tractability. CoRR abs/1401.3430 (2014) - [i2]Lucas Bordeaux, George Katsirelos, Nina Narodytska, Moshe Y. Vardi:
The Complexity of Integer Bound Propagation. CoRR abs/1401.3887 (2014) - 2013
- [c24]Thi-Van-Anh Nguyen, Arnaud Lallouet, Lucas Bordeaux:
Constraint Games: Framework and Local Search Solver. ICTAI 2013: 963-970 - 2012
- [c23]Lucas Bordeaux, Nina Narodytska:
On the Violation of Circuits in Decomposable Negation Normal Form. Australasian Conference on Artificial Intelligence 2012: 194-205 - [c22]Lucas Bordeaux, Mikolás Janota, João Marques-Silva, Pierre Marquis:
On Unit-Refutation Complete Formulae with Existentially Quantified Variables. KR 2012 - [c21]Lucas Bordeaux, João Marques-Silva:
Knowledge Compilation with Empowerment. SOFSEM 2012: 612-624 - 2011
- [j8]Lucas Bordeaux, George Katsirelos, Nina Narodytska, Moshe Y. Vardi:
The Complexity of Integer Bound Propagation. J. Artif. Intell. Res. 40: 657-676 (2011) - 2010
- [c20]Vincent Vidal, Lucas Bordeaux, Youssef Hamadi:
Adaptive K-Parallel Best-First Search: A Simple but Efficient Algorithm for Multi-Core Domain-Independent Planning. SOCS 2010: 100-107
2000 – 2009
- 2009
- [j7]Lucas Bordeaux, Marco Cadoli, Toni Mancini:
Generalizing consistency and other constraint properties to quantified constraints. ACM Trans. Comput. Log. 10(3): 17:1-17:25 (2009) - [c19]Lucas Bordeaux, Youssef Hamadi, Horst Samulowitz:
Experiments with Massively Parallel Constraint Solving. IJCAI 2009: 443-448 - 2008
- [j6]Lucas Bordeaux, Marco Cadoli, Toni Mancini:
A Unifying Framework for Structural Properties of CSPs: Definitions, Complexity, Tractability. J. Artif. Intell. Res. 32: 607-629 (2008) - [c18]Gilles Audemard, Lucas Bordeaux, Youssef Hamadi, Saïd Jabbour, Lakhdar Sais:
A Generalized Framework for Conflict Analysis. SAT 2008: 21-27 - 2007
- [j5]Youssef Hamadi, Lucas Bordeaux:
Preface to Special Issue on SAT/CP Integration. J. Satisf. Boolean Model. Comput. 1(3-4) (2007) - [c17]Sathiamoorthy Subbarayan, Lucas Bordeaux, Youssef Hamadi:
Knowledge Compilation Properties of Tree-of-BDDs. AAAI 2007: 502-507 - [c16]Lucas Bordeaux, Youssef Hamadi, Moshe Y. Vardi:
An Analysis of Slow Convergence in Interval Propagation. CP 2007: 790-797 - [c15]Lucas Bordeaux, Horst Samulowitz:
On the stochastic constraint satisfaction framework. SAC 2007: 316-320 - [c14]Lucas Bordeaux, Lintao Zhang:
A solver for quantified Boolean and linear constraints. SAC 2007: 321-325 - [i1]Lucas Bordeaux, Marco Cadoli, Toni Mancini:
Generalizing Consistency and other Constraint Properties to Quantified Constraints. CoRR abs/0705.3561 (2007) - 2006
- [j4]Lucas Bordeaux, Youssef Hamadi, Lintao Zhang:
Propositional Satisfiability and Constraint Programming: A comparative survey. ACM Comput. Surv. 38(4): 12 (2006) - [j3]Gwen Salaün, Lucas Bordeaux, Marco Schaerf:
Describing and reasoning on Web Services using Process Algebra. Int. J. Bus. Process. Integr. Manag. 1(2): 116-128 (2006) - [j2]Carsten Rother, Lucas Bordeaux, Youssef Hamadi, Andrew Blake:
AutoCollage. ACM Trans. Graph. 25(3): 847-852 (2006) - 2005
- [c13]Lucas Bordeaux, Marco Cadoli, Toni Mancini:
CSP Properties for Quantified Constraints: Definitions and Complexity. AAAI 2005: 360-365 - 2004
- [c12]Lucas Bordeaux, Brice Pajot:
Computing Equilibria Using Interval Constraints. CSCLP 2004: 157-171 - [c11]Gwen Salaün, Lucas Bordeaux, Marco Schaerf:
Describing and Reasoning on Web Services using Process Algebra. ICWS 2004: 43- - [c10]Lucas Bordeaux, Marco Cadoli, Toni Mancini:
Exploiting Fixable, Removable, and Implied Values in Constraint Satisfaction Problems. LPAR 2004: 270-284 - [c9]Lucas Bordeaux, Gwen Salaün, Daniela Berardi, Massimo Mecella:
When are Two Web Services Compatible? TES 2004: 15-28 - [c8]Lucas Bordeaux, Gwen Salaün:
Using Process Algebra for Web Services: Early Results and Perspectives. TES 2004: 54-68 - 2003
- [j1]Lucas Bordeaux, Éric Monfroy:
Extraction de programmes à partir de spécifications en logique existentielle du second ordre par compilation de connaissances. Tech. Sci. Informatiques 22(1): 190-202 (2003) - [c7]Lucas Bordeaux, Éric Monfroy:
Extraction de programmes à partir de spécifications en logique existentielle du second ordre par compilation de connaissances. JFPLC 2003: 189-202 - 2002
- [c6]Lucas Bordeaux, Éric Monfroy, Frédéric Benhamou:
Towards Automated Reasoning on the Properties of Numerical Constraints. International Workshop on Constraint Solving and Constraint Logic Programming 2002: 47-61 - [c5]Lucas Bordeaux, Éric Monfroy:
Beyond NP: Arc-Consistency for Quantified Constraints. CP 2002: 371-386 - [c4]Lucas Bordeaux, Éric Monfroy, Frédéric Benhamou:
Raisonnement sur les propriétés de contraintes numériques. JFPLC 2002: 13- - 2001
- [c3]Lucas Bordeaux, Éric Monfroy, Frédéric Benhamou:
Improved bounds on the complexity of kB-consistency. IJCAI 2001: 303-308 - [c2]Lucas Bordeaux, Éric Monfroy, Frédéric Benhamou:
Amélioration de la complexité des kB-consistances. JFPLC 2001: 207-222 - 2000
- [c1]Lucas Bordeaux, Frédéric Benhamou:
Automated reasoning on monotonic constraints. ICTAI 2000: 401-
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-24 23:01 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:
