Yacine Boufkhad

Publication Activity (10 Years)

Years Active: 1993-2020
Publications (10 Years): 3

Top Topics

Accurate Estimation

Verification Method

Satisfiability Problem

Quantified Boolean Formulas

Top Venues

Discret. Appl. Math.

Publications

Olivier Bailleux, Yacine Boufkhad
Constraint Reductions. CoRR (2020)
Laurent Viennot, Yacine Boufkhad, Leonardo Linguaglossa, Fabien Mathieu, Diego Perino
Efficient Loop Detection in Forwarding Networks and Representing Atoms in a Field of Sets. CoRR (2018)
Yacine Boufkhad, Ricardo De La Paz, Leonardo Linguaglossa, Fabien Mathieu, Diego Perino, Laurent Viennot
Forwarding Tables Verification through Representative Header Sets. CoRR (2016)
Yacine Boufkhad, Thomas Hugel
Estimating satisfiability. Discret. Appl. Math. 160 (1-2) (2012)
Yacine Boufkhad, Olivier Dubois
Second moment method for a family of boolean CSP CoRR (2011)
Thomas Hugel, Yacine Boufkhad
Second Moment Method on k-SAT: a General Framework CoRR (2010)
Yacine Boufkhad, Thomas Hugel
Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold. SAT (2010)
Yacine Boufkhad, Thomas Hugel
Estimating Satisfiability CoRR (2010)
Thomas Hugel, Yacine Boufkhad
Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold CoRR (2010)
Yacine Boufkhad, Fabien Mathieu, Fabien de Montgolfier, Diego Perino, Laurent Viennot
An upload bandwidth threshold for peer-to-peer Video-on-Demand scalability. IPDPS (2009)
Yacine Boufkhad, Fabien Mathieu, Fabien de Montgolfier, Diego Perino, Laurent Viennot
Fine Tuning of a Distributed VoD System. ICCCN (2009)
Olivier Bailleux, Yacine Boufkhad, Olivier Roussel
New Encodings of Pseudo-Boolean Constraints into CNF. SAT (2009)
Laurent Viennot, Yacine Boufkhad, Fabien Mathieu, Fabien de Montgolfier, Diego Perino
Scalable Distributed Video-on-Demand: Theoretical Bounds and Practical Algorithms CoRR (2008)
Yacine Boufkhad, Fabien Mathieu, Fabien de Montgolfier, Diego Perino, Laurent Viennot
Achievable catalog size in peer-to-peer video-on-demand systems. IPTPS (2008)
Olivier Bailleux, Yacine Boufkhad, Olivier Roussel
A Translation of Pseudo Boolean Constraints to SAT. J. Satisf. Boolean Model. Comput. 2 (1-4) (2006)
Yacine Boufkhad, Olivier Dubois, Yannet Interian, Bart Selman
-SAT: Properties of Balanced Formulas. J. Autom. Reason. 35 (1-3) (2005)
Olivier Bailleux, Yacine Boufkhad
Full CNF Encoding: The Counting Constraints Case. SAT (2004)
Yacine Boufkhad, Olivier Dubois, Maurice Nivat
Reconstructing (h, v)-convex 2-dimensional patterns of objects from approximate horizontal and vertical projections. Theor. Comput. Sci. 290 (3) (2003)
Olivier Dubois, Yacine Boufkhad, Jacques Mandler
Typical random 3-SAT formulae and the satisfiability threshold Electron. Colloquium Comput. Complex. 10 (007) (2003)
Olivier Bailleux, Yacine Boufkhad
Efficient CNF Encoding of Boolean Cardinality Constraints. CP (2003)
Olivier Dubois, Yacine Boufkhad, Jacques Mandler
Typical random 3-SAT formulae and the satisfiability threshold CoRR (2002)
Yacine Boufkhad, Olivier Roussel
Redundancy in Random SAT Formulas. AAAI/IAAI (2000)
Olivier Dubois, Yacine Boufkhad, Jacques Mandler
Typical random 3-SAT formulae and the satisfiability threshold. SODA (2000)
Yacine Boufkhad, Olivier Dubois
Length of Prime Implicants and Number of Solutions of Random CNF Formulae. Theor. Comput. Sci. 215 (1-2) (1999)
Yacine Boufkhad
Algorithms for Propositional KB Approximation. AAAI/IAAI (1998)
O. Dubios, Yacine Boufkhad
A General Upper Bound for the Satisfiability Threshold of Random r-SAT Formulae. J. Algorithms 24 (2) (1997)
Yacine Boufkhad, Éric Grégoire, Pierre Marquis, Bertrand Mazure, Lakhdar Sais
Tractable Cover Compilations. IJCAI (1) (1997)
Olivier Dubois, Pascal André, Yacine Boufkhad, Jacques Carlier
SAT versus UNSAT. Cliques, Coloring, and Satisfiability (1993)