2008 |
14 | EE | Laurent Viennot,
Yacine Boufkhad,
Fabien Mathieu,
Fabien de Montgolfier,
Diego Perino:
Scalable Distributed Video-on-Demand: Theoretical Bounds and Practical Algorithms
CoRR abs/0804.0743: (2008) |
2006 |
13 | EE | Olivier Bailleux,
Yacine Boufkhad,
Olivier Roussel:
A Translation of Pseudo Boolean Constraints to SAT.
JSAT 2(1-4): 191-200 (2006) |
2005 |
12 | EE | Yacine Boufkhad,
Olivier Dubois,
Yannet Interian,
Bart Selman:
Regular Random k-SAT: Properties of Balanced Formulas.
J. Autom. Reasoning 35(1-3): 181-200 (2005) |
2004 |
11 | EE | Olivier Bailleux,
Yacine Boufkhad:
Full CNF Encoding: The Counting Constraints Case.
SAT 2004 |
2003 |
10 | EE | Olivier Bailleux,
Yacine Boufkhad:
Efficient CNF Encoding of Boolean Cardinality Constraints.
CP 2003: 108-122 |
9 | EE | Olivier Dubois,
Yacine Boufkhad,
Jacques Mandler:
Typical random 3-SAT formulae and the satisfiability threshold
Electronic Colloquium on Computational Complexity (ECCC) 10(007): (2003) |
8 | | 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): 1647-1664 (2003) |
2002 |
7 | EE | Olivier Dubois,
Yacine Boufkhad,
Jacques Mandler:
Typical random 3-SAT formulae and the satisfiability threshold
CoRR cs.DM/0211036: (2002) |
2000 |
6 | | Yacine Boufkhad,
Olivier Roussel:
Redundancy in Random SAT Formulas.
AAAI/IAAI 2000: 273-278 |
5 | EE | Olivier Dubois,
Yacine Boufkhad,
Jacques Mandler:
Typical random 3-SAT formulae and the satisfiability threshold.
SODA 2000: 126-127 |
1999 |
4 | EE | Yacine Boufkhad,
Olivier Dubois:
Length of Prime Implicants and Number of Solutions of Random CNF Formulae.
Theor. Comput. Sci. 215(1-2): 1-30 (1999) |
1998 |
3 | | Yacine Boufkhad:
Algorithms for Propositional KB Approximation.
AAAI/IAAI 1998: 280-285 |
1997 |
2 | | Yacine Boufkhad,
Éric Grégoire,
Pierre Marquis,
Bertrand Mazure,
Lakhdar Sais:
Tractable Cover Compilations.
IJCAI (1) 1997: 122-127 |
1 | | O. Dubios,
Yacine Boufkhad:
A General Upper Bound for the Satisfiability Threshold of Random r-SAT Formulae.
J. Algorithms 24(2): 395-420 (1997) |