19 papers:
LATA-2014-GwynneK #constraints #on the #satisfiability- On SAT Representations of XOR Constraints (MG, OK), pp. 409–420.
DATE-2013-AmaruGM #canonical #logic #novel #synthesis- Biconditional BDD: a novel canonical BDD for logic synthesis targeting XOR-rich circuits (LGA, PEG, GDM), pp. 1014–1017.
ICALP-v1-2012-AmbainisBBKOSV #game studies #quantum- Quantum Strategies Are Better Than Classical in Almost Any XOR Game (AA, AB, KB, DK, RO, JS, MV), pp. 25–37.
SAT-2012-LaitinenJN #learning- Conflict-Driven XOR-Clause Learning (TL, TAJ, IN), pp. 383–396.
CADE-2011-LiuL #morphism #performance #unification- Efficient General Unification for XOR with Homomorphism (ZL, CL), pp. 407–421.
CIAA-2009-VuilleminG #automaton #normalisation #regular expression- Compact Normal Form for Regular Languages as Xor Automata (JV, NG), pp. 24–33.
RTA-2009-SeidlV #protocol- Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case (HS, KNV), pp. 118–132.
- SAT-2009-Chen #hybrid #reasoning #satisfiability
- Building a Hybrid SAT Solver via Conflict-Driven, Look-Ahead and XOR Reasoning Techniques (JC), pp. 298–311.
- DATE-2008-PlazaMB #constraints #generative #random #using
- Random Stimulus Generation using Entropy and XOR Constraints (SP, ILM, VB), pp. 664–669.
- ICALP-C-2008-KolesnikovS
- Improved Garbled Circuit: Free XOR Gates and Applications (VK, TS), pp. 486–498.
TACAS-2007-CortierKS #analysis #automation #security- Automatic Analysis of the Security of XOR-Based Key Management Schemes (VC, GK, GS), pp. 538–552.
- SAT-2007-GomesHSS #theory and practice
- Short XORs for Model Counting: From Theory to Practice (CPG, JH, AS, BS), pp. 100–106.
- DATE-2006-VandierendonckML #configuration management
- Application-specific reconfigurable XOR-indexing to eliminate cache conflict misses (HV, PM, JDL), pp. 357–362.
- CADE-2005-Steel #api #constraints #deduction #modelling #security
- Deduction with XOR Constraints in Security API Modelling (GS), pp. 322–336.
LICS-2003-ChevalierKRT #protocol- An NP Decision Procedure for Protocol Insecurity with XOR (YC, RK, MR, MT), pp. 261–270.
STOC-1999-SudanTV #generative #pseudo- Pseudorandom Generators Without the XOR Lemma (Extended Abstract) (MS, LT, SPV), pp. 537–546.
DAC-1997-YeR #algorithm #graph #network #synthesis- A Graph-Based Synthesis Algorithm for AND/XOR Networks (YY, KR), pp. 107–112.
- STOC-1997-ImpagliazzoW #exponential
- P = BPP if E Requires Exponential Circuits: Derandomizing the XOR Lemma (RI, AW), pp. 220–229.
- DAC-1992-SarabiP #canonical #network #performance
- Fast Exact and Quasi-Minimal Minimization of Highly Testable Fixed-Polarity AND/XOR Canonical Networks (AS, MAP), pp. 30–35.
