FAQ

Bit array

Known as: Boolean vector, Bit vector, Bitvector 
A bit array (also known as bitmap, bitset, bit string, or bit vector) is an array data structure that compactly stores bits. It can be used to… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1961-2017
05010015019612017

Related topics

Related topics

50 relations
.NET Framework3SUMAPLArithmetic logic unit
(More)

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Bit array
Java
Information retrieval
C++
Logical connective
Mask

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
A Decision Procedure for Bit-Vectors and Arrays
STP is a decision procedure for the satisfiability of quantifier-free formulas in the theory of bit-vectors and arrays that has… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Pors: proofs of retrievability for large files
In this paper, we define and explore <i>proofs of retrievability</i> (PORs). A POR scheme enables an archive or back-up service… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
On lattices, learning with errors, random linear codes, and cryptography
Our main result is a reduction from worst-case lattice problems such as SVP and SIVP to a certain learning problem. This learning… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
OCB: a block-cipher mode of operation for efficient authenticated encryption
We describe a parallelizable block-cipher mode of operation that simultaneously provides privacy and authenticity. OCB encrypts… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1998
Highly Cited
1998
The Decision Diffie-Hellman Problem
 
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Protecting Data Privacy in Private Information Retrieval Schemes
Private Information Retrieval (PIR) schemes allow a user to retrieve the i-th bit of a data string 2, replicated in k 2 2… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Unconditional Security Against Memory-Bounded Adversaries
We propose a private-key cryptosystem and a protocol for key agreement by public discussion that are unconditionally secure based… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Generalized privacy amplification
~ This paper provides a general treatment of privacy amplification by public discussion, a concept introduced by Bennett… (More)
Is this relevant?
Highly Cited
1989
Highly Cited
1989
A Performance Evaluation of Four Parallel Join Algorithms in a Shared-Nothing Multiprocessor Environment
In this paper we analyze and compare four parallel join algorithms. Grace and Hybrid hash represent the class of hash-based join… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1988
Highly Cited
1988
Privacy Amplification by Public Discussion
In this paper, we investigate how the use of a channel with perfect authenticity but no privacy can be used to repair the defects… (More)
Is this relevant?