Skip to search formSkip to main contentSkip to account menu

Pseudorandomness

Known as: Pseudorandom, Pseudo random, Pseudorandom number 
A pseudorandom process is a process that appears to be random but is not. Pseudorandom sequences typically exhibit statistical randomness while being… 
Wikipedia (opens in a new tab)

Related topics

Related topics

40 relations
Automatic link establishmentCombined Linear Congruential GeneratorComparison of version control softwareComputational complexity theory

Broader (1)

Theoretical computer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Exploring Monte Carlo Methods
Exploring Monte Carlo Methods is a basic text that describes the numerical methods that have come to be known as "Monte Carlo… 
Highly Cited
2007
Highly Cited
2007
On finite pseudorandom binary sequences I : Measure of pseudorandomness , the Legendre symbol
On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol by Christian Mauduit (Marseille) and… 
Highly Cited
2006
Highly Cited
2006
Analog-to-Information Conversion via Random Demodulation
Many problems in radar and communication signal processing involve radio frequency (RF) signals of very high bandwidth. This… 
Highly Cited
2005
Highly Cited
2005
On the Dynamical Degradation of Digital Piecewise Linear Chaotic Maps
When chaotic systems are realized with finite precisions in digital computers, their dynamical properties are often found to be… 
Highly Cited
2001
Highly Cited
2001
An Implementation of Key-Based Digital Signal Steganography
A real-life requirement motivated this case study of secure covert communication. An independently researched process is… 
Review
2000
Review
2000
An experimental study of benchmarking functions for genetic algorithms
This paper presents a review and experimental results of major benchmarking functions used for the performance control of genetic… 
Highly Cited
1999
Highly Cited
1999
Generalized low density (Tanner) codes
We build a class of pseudo-random error correcting codes, called generalized low density codes (GLD), from the intersection of… 
Highly Cited
1999
Highly Cited
1999
A test vector inhibiting technique for low energy BIST design
During self-test, the switching activity of the circuit under test is significantly increased compared to normal operation and… 
Highly Cited
1994
Highly Cited
1994
Pseudorandomness for network algorithms
We define pseudorandom generators for Yao’s two-party communication complexity model and exhibit a simple construction, based on… 
Review
1989
Review
1989
Spatial Data Configuration in Statistical Analysis of Regional Economic and Related Problems
1. Introduction: spatial effects and the role of configuration of data.- 1.1 Objectives and approaches.- 1.2 An overview of… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)