dblp.uni-trier.dewww.uni-trier.de

Yacine Boufkhad Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
16EEYacine Boufkhad, Fabien Mathieu, Fabien de Montgolfier, Diego Perino, Laurent Viennot: An upload bandwidth threshold for peer-to-peer Video-on-Demand scalability. IPDPS 2009: 1-10
15EEOlivier Bailleux, Yacine Boufkhad, Olivier Roussel: New Encodings of Pseudo-Boolean Constraints into CNF. SAT 2009: 181-194
2008
14EELaurent 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
13EEOlivier Bailleux, Yacine Boufkhad, Olivier Roussel: A Translation of Pseudo Boolean Constraints to SAT. JSAT 2(1-4): 191-200 (2006)
2005
12EEYacine 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
11EEOlivier Bailleux, Yacine Boufkhad: Full CNF Encoding: The Counting Constraints Case. SAT 2004
2003
10EEOlivier Bailleux, Yacine Boufkhad: Efficient CNF Encoding of Boolean Cardinality Constraints. CP 2003: 108-122
9EEOlivier 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
7EEOlivier 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
5EEOlivier Dubois, Yacine Boufkhad, Jacques Mandler: Typical random 3-SAT formulae and the satisfiability threshold. SODA 2000: 126-127
1999
4EEYacine 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)

Coauthor Index

1Olivier Bailleux [10] [11] [13] [15]
2O. Dubios [1]
3Olivier Dubois [4] [5] [7] [8] [9] [12]
4Éric Grégoire [2]
5Yannet Interian [12]
6Jacques Mandler [5] [7] [9]
7Pierre Marquis [2]
8Fabien Mathieu [14] [16]
9Bertrand Mazure [2]
10Fabien de Montgolfier [14] [16]
11Maurice Nivat [8]
12Diego Perino [14] [16]
13Olivier Roussel [6] [13] [15]
14Lakhdar Sais [2]
15Bart Selman [12]
16Laurent Viennot [14] [16]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)