Principles and Practice of Constraint Programming -CP, Lecture Notes in Computer Science, vol.3258, pp.77-91, 2004. ,

Lower Bounds for Lovász-Schrijver Systems and Beyond Follow from Multiparty Communication Complexity, SIAM J. Comput, vol.37, issue.3, pp.845-869, 2007. ,

Symbolic manipulation of boolean functions using a graphical representation, Proceedings of the 22nd ACM/IEEE conference on Design automation, DAC 1985, pp.688-694, 1985. ,

A direct construction of polynomial-size OBDD proof of pigeon hole problem, Information Processing Letters, vol.109, issue.10, pp.472-477, 2009. ,

On multi-partition communication complexity, Inf. Comput, vol.194, issue.1, pp.49-75, 2004. ,

Exponential Lower Bounds for Refuting Random Formulas Using Ordered Binary Decision Diagrams, Lecture Notes in Computer Science, vol.7913, pp.127-138, 2013. ,

, , 2013.

Low-density parity-check codes. Information Theory, IRE Transactions on, vol.8, pp.21-28, 1962. ,

Resolution and binary decision diagrams cannot simulate each other polynomially, Discrete Applied Mathematics, vol.130, issue.2, pp.157-171, 2003. ,

List decoding from erasures: bounds and code constructions. Information Theory, IEEE Transactions on, vol.49, issue.11, pp.2826-2833, 2003. ,

An exponential lower bound for a constraint propagation proof system based on ordered binary decision diagrams, Journal of Symbolic Logic, vol.73, issue.1, pp.227-237, 2008. ,

Communication complexity, 1997. ,

Ramanujan graphs, Combinatorica, vol.8, issue.3, pp.261-277, 1988. ,

On the complexity of Constructing Optimal Ordered Binary Decision Diagrams, Proceedings of Mathematical Foundations of Computer Science, vol.841, pp.515-524, 1994. ,

Algorithms and Data Structures in VLSI Design: OBDD -Foundations and Applications, 1998. ,

Symbolic Techniques in Satisfiability Solving, 7th International Conference on Theory and Applications of Satisfiability Testing, vol.3542, pp.235-250, 2004. ,

Nearly-Exponential Size Lower Bounds for Symbolic Quantifier Elimination Algorithms and OBDD-Based Proofs of Unsatisfiability, 2007. ,

, On OBDD-Based Algorithms and Proof Systems That Change Order of Variables

On the relative efficiency of resolution-like proofs and ordered binary decision diagram proofs, Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, pp.100-111, 2008. ,

An Exponential Lower Bound on OBDD Refutations for Pigeonhole Formulas, Proceedings Fourth Athens Colloquium on Algorithms and Complexity, vol.4, pp.13-21, 2009. ,

Hard Examples for Resolution, JACM, vol.34, issue.1, pp.209-219, 1987. ,