Yacine Boufkhad

According to our database1, Yacine Boufkhad authored at least 24 papers between 1993 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Constraint Reductions.
CoRR, 2020

2018
Efficient Loop Detection in Forwarding Networks and Representing Atoms in a Field of Sets.
CoRR, 2018

2016
Forwarding Tables Verification through Representative Header Sets.
CoRR, 2016

2012
Estimating satisfiability.
Discret. Appl. Math., 2012

2011
Second moment method for a family of boolean CSP
CoRR, 2011

2010
Second Moment Method on k-SAT: a General Framework
CoRR, 2010

Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold.
Proceedings of the Theory and Applications of Satisfiability Testing, 2010

2009
New Encodings of Pseudo-Boolean Constraints into CNF.
Proceedings of the Theory and Applications of Satisfiability Testing, 2009

An upload bandwidth threshold for peer-to-peer Video-on-Demand scalability.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

Fine Tuning of a Distributed VoD System.
Proceedings of the 18th International Conference on Computer Communications and Networks, 2009

2008
Scalable Distributed Video-on-Demand: Theoretical Bounds and Practical Algorithms
CoRR, 2008

Achievable catalog size in peer-to-peer video-on-demand systems.
Proceedings of the 7th international conference on Peer-to-peer systems, 2008

2006
A Translation of Pseudo Boolean Constraints to SAT.
J. Satisf. Boolean Model. Comput., 2006

2005
Regular Random <i>k</i>-SAT: Properties of Balanced Formulas.
J. Autom. Reason., 2005

2004
Full CNF Encoding: The Counting Constraints Case.
Proceedings of the SAT 2004, 2004

2003
Reconstructing (h, v)-convex 2-dimensional patterns of objects from approximate horizontal and vertical projections.
Theor. Comput. Sci., 2003

Typical random 3-SAT formulae and the satisfiability threshold
Electron. Colloquium Comput. Complex., 2003

Efficient CNF Encoding of Boolean Cardinality Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 2003

2000
Redundancy in Random SAT Formulas.
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000

1999
Length of Prime Implicants and Number of Solutions of Random CNF Formulae.
Theor. Comput. Sci., 1999

1998
Algorithms for Propositional KB Approximation.
Proceedings of the Fifteenth National Conference on Artificial Intelligence and Tenth Innovative Applications of Artificial Intelligence Conference, 1998

1997
A General Upper Bound for the Satisfiability Threshold of Random r-SAT Formulae.
J. Algorithms, 1997

Tractable Cover Compilations.
Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, 1997

1993
SAT versus UNSAT.
Proceedings of the Cliques, 1993


  Loading...