Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
random bits
Description:
Binary values generated or used randomly, serving as a resource in algorithms, automata, and theoretical computer science.
Primary topic:
Information and Cyber Security (24%)
Related topics:
Information and Cyber Security (24%),
Complexity and Algorithms in Graphs (12%),
Cryptography and Data Security (12%)
OpenAlex ID:
keywords/random-bits
Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
2000
·
Jaikumar Radhakrishnan
, Amnon Ta-Shma
·
SIAM Journal on Discrete Mathematics
·
232
A More Efficient AES Threshold Implementation
2014
·
Begül Bilgin
, Benedikt Gierlichs
, et al.
·
Lecture notes in computer science
·
127
PDF
Polynomial hash functions are reliable: Extended abstract
1992
·
M. Dietzfelbinger
, J. Gil
, et al.
·
Lecture notes in computer science
·
111
Tiny families of functions with random properties: A quality-size trade-off for hashing
1997
·
Oded Goldreich
, Avi Wigderson
·
Random Structures and Algorithms
·
108
Controlled Gradual Disclosure Schemes for Random Bits and Their Applications
2007
·
Richard Cleve
·
Springer eBooks
·
87
PDF
Constant-Time Discrete Gaussian Sampling
2018
·
Angshuman Karmakar
, Sujoy Sinha Roy
, et al.
·
IEEE Transactions on Computers
·
58
PDF
The Complexity of Distributions
2012
·
Emanuele Viola
·
SIAM Journal on Computing
·
57
Competitiveness via consensus
2003
·
Andrew V. Goldberg
, Jason D. Hartline
·
Symposium on Discrete Algorithms
·
56
Better computing on the anonymous ring
1991
·
Hagit Attiya
, Marc Snir
·
Journal of Algorithms
·
56
Optimal Discrete Uniform Generation from Coin Flips, and Applications
2013
·
Lumbroso, Jérémie
·
arXiv (Cornell University)
·
43
PDF
On Universal Simulation of Information Sources Using Training Data
2004
·
N. Merhav
, M.J. Weinberger
·
IEEE Transactions on Information Theory
·
42
Almost Euclidean subspaces of ℓ 1 N VIA expander codes
2010
·
Venkatesan Guruswami
, James R. Lee
, et al.
·
COMBINATORICA
·
40
PDF
Noise Stability of Weighted Majority
2020
·
Yuval Peres
·
Progress in probability
·
39
Randomness in Distribution Protocols
1996
·
Carlo Blundo
, Alfredo De Santis
, et al.
·
Information and Computation
·
37
Private Circuits: A Modular Approach
2018
·
Prabhanjan Ananth
, Yuval Ishai
, et al.
·
Lecture notes in computer science
·
36
Exponential separations in the energy complexity of leader election
2017
·
Yi-Jun Chang
, Tsvi Kopelowitz
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
32
PDF
Resolvability theory for the multiple-access channel
1998
·
Y. Steinberg
·
IEEE Transactions on Information Theory
·
32
Simple permutations mix well
2005
·
Shlomo Hoory
, Avner Magen
, et al.
·
Theoretical Computer Science
·
31
Efficient generation of random nonsingular matrices
1993
·
Dana Randall
·
Random Structures and Algorithms
·
29
Which properties of a random sequence are dynamically sensitive?
2003
·
Itai Benjamini
, Olle Häggström
, et al.
·
The Annals of Probability
·
28
PDF
Randomness in Private Computations
1997
·
Eyal Kushilevitz
, Yishay Mansour
·
SIAM Journal on Discrete Mathematics
·
27
Tight Bounds for Quasirandom Rumor Spreading
2009
·
Spyros Angelopoulos
, Benjamin Doerr
, et al.
·
The Electronic Journal of Combinatorics
·
26
PDF
Derandomizing Complexity Classes
2001
·
Peter Bro Miltersen
·
Combinatorial optimization
·
26
Remarks on the Most Informative Function Conjecture at fixed mean
2015
·
Kindler, Guy
, O'Donnell, Ryan
, et al.
·
arXiv (Cornell University)
·
25
PDF
Secure multiplex coding with dependent and non-uniform multiple messages
2012
·
Masahito Hayashi
, Ryutaroh Matsumoto
·
Allerton Conference on Communication, Control, and Computing
·
24
Show more works
View as search
Works count:
249
Citation count:
2,224
Year
Topic
Type