Yacine Boufkhad

28 papers A* 1A 5B 1Journal 16Unranked 5

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