The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Yacine Boufkhad: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Yacine Boufkhad
    Algorithms for Propositional KB Approximation. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 1998, pp:280-285 [Conf]
  2. Yacine Boufkhad, Olivier Roussel
    Redundancy in Random SAT Formulas. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 2000, pp:273-278 [Conf]
  3. Olivier Bailleux, Yacine Boufkhad
    Efficient CNF Encoding of Boolean Cardinality Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:108-122 [Conf]
  4. Yacine Boufkhad, Éric Grégoire, Pierre Marquis, Bertrand Mazure, Lakhdar Sais
    Tractable Cover Compilations. [Citation Graph (0, 0)][DBLP]
    IJCAI (1), 1997, pp:122-127 [Conf]
  5. Olivier Bailleux, Yacine Boufkhad
    Full CNF Encoding: The Counting Constraints Case. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  6. Olivier Dubois, Yacine Boufkhad, Jacques Mandler
    Typical random 3-SAT formulae and the satisfiability threshold. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:126-127 [Conf]
  7. Olivier Dubois, Yacine Boufkhad, Jacques Mandler
    Typical random 3-SAT formulae and the satisfiability threshold [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  8. Olivier Dubois, Yacine Boufkhad, Jacques Mandler
    Typical random 3-SAT formulae and the satisfiability threshold [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:007, pp:- [Journal]
  9. O. Dubios, Yacine Boufkhad
    A General Upper Bound for the Satisfiability Threshold of Random r-SAT Formulae. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:24, n:2, pp:395-420 [Journal]
  10. Yacine Boufkhad, Olivier Dubois, Yannet Interian, Bart Selman
    Regular Random k-SAT: Properties of Balanced Formulas. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2005, v:35, n:1-3, pp:181-200 [Journal]
  11. Yacine Boufkhad, Olivier Dubois
    Length of Prime Implicants and Number of Solutions of Random CNF Formulae. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:215, n:1-2, pp:1-30 [Journal]
  12. Yacine Boufkhad, Olivier Dubois, Maurice Nivat
    Reconstructing (h, v)-convex 2-dimensional patterns of objects from approximate horizontal and vertical projections. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1647-1664 [Journal]

  13. An upload bandwidth threshold for peer-to-peer Video-on-Demand scalability. [Citation Graph (, )][DBLP]


  14. New Encodings of Pseudo-Boolean Constraints into CNF. [Citation Graph (, )][DBLP]


  15. Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold. [Citation Graph (, )][DBLP]


  16. Scalable Distributed Video-on-Demand: Theoretical Bounds and Practical Algorithms [Citation Graph (, )][DBLP]


  17. Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold [Citation Graph (, )][DBLP]


  18. Estimating Satisfiability [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002