Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Bit array

Known as: Boolean array, Bit string, 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… Expand
Wikipedia

Related topics

Related topics

50 relations
APLArithmetic logic unitArray data structureBinary data
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
On lattices, learning with errors, random linear codes, and cryptography
Our main result is a reduction from worst-case lattice problems such as GapSVP and SIVP to a certain learning problem. This… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2007
Highly Cited
2007
Pors: proofs of retrievability for large files
In this paper, we define and explore proofs of retrievability (PORs). A POR scheme enables an archive or back-up service (prover… Expand
  • figure 1
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2004
Highly Cited
2004
The promoter of TL-DNA gene 5 controls the tissue-specific expression of chimaeric genes carried by a novel type of Agrobacterium binary vector
SummaryA “plant gene vector cassette” to be used in combination with various Escherichia coli gene-cloning vectors was… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 3
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… Expand
  • figure 1
  • figure 2
  • figure 6
  • figure 7
  • figure 9
Highly Cited
1998
Highly Cited
1998
On the Properties of Bit String-Based Measures of Chemical Similarity
  • D. Flower
  • J. Chem. Inf. Comput. Sci.
  • 1998
    • Corpus ID: 15353316
With the growth of interest in database searching and compound selection, the quantification of chemical similarity has become an… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Review
1997
Review
1997
Communication Complexity
In this chapter we survey the theory of two-party communication complexity. This field of theoretical computer science aims at… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Highly Cited
1993
Highly Cited
1993
Description of a New Variable-Length Key, 64-bit Block Cipher (Blowfish)
Blowfish, a new secret-key block cipher, is proposed. It is a Feistel network, iterating a simple encryption function 16 times… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 7
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… Expand
Highly Cited
1979
Highly Cited
1979
A fast algorithm for finding dominators in a flowgraph
A fast algorithm for finding dominators in a flowgraph is presented. The algorithm uses depth-first search and an efficient… Expand
  • figure 1
  • figure 3
  • figure 4
  • table I
  • figure 5
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE