Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,568,302 papers from all fields of science
Search
Sign In
Create Free Account
Bit array
Known as:
Boolean array
, Bit string
, Bitvector
Expand
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
Create Alert
Alert
Related topics
Related topics
50 relations
APL
Arithmetic logic unit
Array data structure
Binary 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
O. Regev
JACM
2009
Corpus ID: 207156623
Our main result is a reduction from worst-case lattice problems such as GapSVP and SIVP to a certain learning problem. This…
Expand
Highly Cited
2007
Highly Cited
2007
Pors: proofs of retrievability for large files
A. Juels
,
B. Kaliski
CCS '07
2007
Corpus ID: 6032317
In this paper, we define and explore proofs of retrievability (PORs). A POR scheme enables an archive or back-up service (prover…
Expand
Highly Cited
2005
Highly Cited
2005
On lattices, learning with errors, random linear codes, and cryptography
O. Regev
STOC '05
2005
Corpus ID: 53223958
Our main result is a reduction from worst-case lattice problems such as SVP and SIVP to a certain learning problem. This learning…
Expand
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
C. Koncz
,
J. Schell
Molecular and General Genetics MGG
2004
Corpus ID: 19772021
SummaryA “plant gene vector cassette” to be used in combination with various Escherichia coli gene-cloning vectors was…
Expand
Highly Cited
2001
Highly Cited
2001
OCB: a block-cipher mode of operation for efficient authenticated encryption
P. Rogaway
,
M. Bellare
,
J. Black
,
Ted Krovetz
CCS '01
2001
Corpus ID: 123503
We describe a parallelizable block-cipher mode of operation that simultaneously provides privacy and authenticity. OCB encrypts…
Expand
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
Review
1997
Review
1997
Communication Complexity
E. Kushilevitz
Adv. Comput.
1997
Corpus ID: 47195834
Highly Cited
1993
Highly Cited
1993
Description of a New Variable-Length Key, 64-bit Block Cipher (Blowfish)
B. Schneier
FSE
1993
Corpus ID: 15840323
Blowfish, a new secret-key block cipher, is proposed. It is a Feistel network, iterating a simple encryption function 16 times…
Expand
Highly Cited
1988
Highly Cited
1988
Privacy Amplification by Public Discussion
C. H. Bennett
,
G. Brassard
,
J. Robert
SIAM J. Comput.
1988
Corpus ID: 5956782
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
Thomas Lengauer
,
R. Tarjan
TOPL
1979
Corpus ID: 976012
A fast algorithm for finding dominators in a flowgraph is presented. The algorithm uses depth-first search and an efficient…
Expand
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