XOR

Known as: XOR (computer game), XOR (disambiguation) 
XOR is a computer puzzle game created by Astral Software and published by Logotron in 1987 for a range of platforms including the Acorn Electron… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
A straightforward way of constructing an n-bit pseudorandom function is to XOR two or more pseudorandom permutations: p1… (More)
Is this relevant?
2014
2014
In this paper, a low-power high speed 4-2 compressor circuit is proposed for fast digital arithmetic integrated circuits. The 4-2… (More)
  • figure 4
  • figure 5
  • figure 6
  • table I
  • table II
Is this relevant?
2012
2012
Self-testing a quantum device means verifying the existence of a certain quantum state as well as the effect of the associated… (More)
Is this relevant?
2011
2011
MDS erasure codes are ubiquitous in storage systems that must tolerate failures. While classic Reed-Solomon codes can provide a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
In the Horn theory based approach for cryptographic protocol analysis, cryptographic protocols and (Dolev–Yao) intruders are… (More)
  • figure 4
Is this relevant?
2008
2008
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty… (More)
Is this relevant?
2007
2007
In many security protocols, such as group protocols, principals have to perform iterative or recursive computations. We call such… (More)
  • figure 2
Is this relevant?
2006
2006
Embedded systems allow application-specific optimizations to improve the power/performance trade-off. In this paper, we show how… (More)
  • figure 1
  • figure 2
  • table 2
  • table 3
Is this relevant?
Highly Cited
1997
Highly Cited
1997
This paper makes the case for the use of XOR-based placem functions for cache memories. It shows that these XOR-mappi schemes can… (More)
  • table 1
  • figure 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
Review
1995
Review
1995
A fundamental lemma of Yao states that computational weakunpredictability of Boolean predicates is amplified when the results of… (More)
Is this relevant?