![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Yacine Boufkhad
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2012
- [j6]Yacine Boufkhad, Thomas Hugel:
Estimating satisfiability. Discret. Appl. Math. 160(1-2): 61-80 (2012) - 2006
- [j5]Olivier Bailleux, Yacine Boufkhad, Olivier Roussel:
A Translation of Pseudo Boolean Constraints to SAT. J. Satisf. Boolean Model. Comput. 2(1-4): 191-200 (2006) - 2005
- [j4]Yacine Boufkhad, Olivier Dubois, Yannet Interian, Bart Selman:
Regular Random k-SAT: Properties of Balanced Formulas. J. Autom. Reason. 35(1-3): 181-200 (2005) - 2003
- [j3]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) - 1999
- [j2]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) - 1997
- [j1]O. Dubios, Yacine Boufkhad:
A General Upper Bound for the Satisfiability Threshold of Random r-SAT Formulae. J. Algorithms 24(2): 395-420 (1997)
Conference and Workshop Papers
- 2010
- [c12]Yacine Boufkhad, Thomas Hugel:
Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold. SAT 2010: 99-112 - 2009
- [c11]Yacine Boufkhad, Fabien Mathieu, Fabien de Montgolfier, Diego Perino, Laurent Viennot:
Fine Tuning of a Distributed VoD System. ICCCN 2009: 1-7 - [c10]Yacine 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 - [c9]Olivier Bailleux, Yacine Boufkhad, Olivier Roussel:
New Encodings of Pseudo-Boolean Constraints into CNF. SAT 2009: 181-194 - 2008
- [c8]Yacine Boufkhad, Fabien Mathieu, Fabien de Montgolfier, Diego Perino, Laurent Viennot:
Achievable catalog size in peer-to-peer video-on-demand systems. IPTPS 2008: 4 - 2004
- [c7]Olivier Bailleux, Yacine Boufkhad:
Full CNF Encoding: The Counting Constraints Case. SAT 2004 - 2003
- [c6]Olivier Bailleux, Yacine Boufkhad:
Efficient CNF Encoding of Boolean Cardinality Constraints. CP 2003: 108-122 - 2000
- [c5]Yacine Boufkhad, Olivier Roussel:
Redundancy in Random SAT Formulas. AAAI/IAAI 2000: 273-278 - [c4]Olivier Dubois, Yacine Boufkhad, Jacques Mandler:
Typical random 3-SAT formulae and the satisfiability threshold. SODA 2000: 126-127 - 1998
- [c3]Yacine Boufkhad:
Algorithms for Propositional KB Approximation. AAAI/IAAI 1998: 280-285 - 1997
- [c2]Yacine Boufkhad, Éric Grégoire, Pierre Marquis, Bertrand Mazure, Lakhdar Sais:
Tractable Cover Compilations. IJCAI (1) 1997: 122-127 - 1993
- [c1]Olivier Dubois, Pascal André, Yacine Boufkhad, Jacques Carlier:
SAT versus UNSAT. Cliques, Coloring, and Satisfiability 1993: 415-436
Informal and Other Publications
- 2020
- [i10]Olivier Bailleux, Yacine Boufkhad:
Constraint Reductions. CoRR abs/2006.02081 (2020) - 2018
- [i9]Laurent Viennot, Yacine Boufkhad, Leonardo Linguaglossa, Fabien Mathieu, Diego Perino:
Efficient Loop Detection in Forwarding Networks and Representing Atoms in a Field of Sets. CoRR abs/1809.01896 (2018) - 2016
- [i8]Yacine Boufkhad, Ricardo De La Paz, Leonardo Linguaglossa, Fabien Mathieu, Diego Perino, Laurent Viennot:
Forwarding Tables Verification through Representative Header Sets. CoRR abs/1601.07002 (2016) - 2011
- [i7]Yacine Boufkhad, Olivier Dubois:
Second moment method for a family of boolean CSP. CoRR abs/1107.2737 (2011) - 2010
- [i6]Thomas Hugel, Yacine Boufkhad:
Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold. CoRR abs/1002.1636 (2010) - [i5]Yacine Boufkhad, Thomas Hugel:
Estimating Satisfiability. CoRR abs/1005.4518 (2010) - [i4]Thomas Hugel, Yacine Boufkhad:
Second Moment Method on k-SAT: a General Framework. CoRR abs/1009.5588 (2010) - 2008
- [i3]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) - 2003
- [i2]Olivier Dubois, Yacine Boufkhad, Jacques Mandler:
Typical random 3-SAT formulae and the satisfiability threshold. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [i1]Olivier Dubois, Yacine Boufkhad, Jacques Mandler:
Typical random 3-SAT formulae and the satisfiability threshold. CoRR cs.DM/0211036 (2002)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint