Searches , social queries for PSEUDORANDOM GRAPH
Search references for PSEUDORANDOM GRAPH. Phrases containing PSEUDORANDOM GRAPH
See searches and references containing PSEUDORANDOM GRAPH!
Search references for PSEUDORANDOM GRAPH. Phrases containing PSEUDORANDOM GRAPH
See searches and references containing PSEUDORANDOM GRAPH!PSEUDORANDOM GRAPH
Graph obeys some properties of random graphs
In graph theory, a graph is said to be a pseudorandom graph if it obeys certain properties that random graphs obey with high probability. There is no concrete
Pseudorandom_graph
Statement in mathematical combinatorics
2013, Conlon, Fox and Zhao showed using a counting lemma for sparse pseudorandom graphs that rind(H) ≤ cn2Δ+8, where the exponent is best possible up to
Ramsey's_theorem
Sparse graph with strong connectivity
In graph theory, an expander graph is a sparse graph that has strong connectivity properties, quantified using vertex, edge or spectral expansion. Expander
Expander_graph
Topics referred to by the same term
Polynomial vector spaces, denoted by P n {\displaystyle \mathbb {P} _{n}} Pseudorandom number sequence Part number, an identifier of a particular part design
PN
Value used to initialize a pseudo-random number generator
initialize a pseudorandom number generator. A pseudorandom number generator's number sequence is completely determined by the seed: thus, if a pseudorandom number
Random_seed
Assignment of colors to edges of a graph
Ferber, Asaf; Jain, Vishesh (September 2020), "1-factorizations of pseudorandom graphs", Random Structures & Algorithms, 57 (2): 259–278, arXiv:1803.10361
Edge_coloring
Simple polynomial map exhibiting chaotic behavior
the creation of pseudorandom numbers using a computer is an important technique, and one of the methods for generating pseudorandom numbers is the use
Logistic_map
Computer science concept
science, a pseudorandom generator for low-degree polynomials is an efficient procedure that maps a short truly random seed to a longer pseudorandom string
Pseudorandom generators for polynomials
Pseudorandom_generators_for_polynomials
Pseudorandom number generator
middle-square method or midsquares method is a method of generating pseudorandom numbers. In practice it is a highly flawed method for many practical
Middle-square_method
American mathematician
hypergraphs and graph limits. In general, the theory of quasi-randomness gives a rigorous approach to 'random-like' or 'pseudorandom' alternatives. A
Fan_Chung
Important lemma in extremal graph theory
analogues of the blow-up lemma for embedding bounded degree graphs into random and pseudorandom graphs Komlós, János; Sárközy, Gábor N.; Szemerédi, Endre (1997)
Blow-up_lemma
Collection of C++ libraries
that provides support for tasks and structures such as linear algebra, pseudorandom number generation, multithreading, image processing, regular expressions
Boost_(C++_libraries)
analysis Online algorithm Polynomial time approximation scheme Problem size Pseudorandom number generator Quantum algorithm Random-restart hill climbing Randomized
List of algorithm general topics
List_of_algorithm_general_topics
Class of graphs
Forcing graphs play an important role in the study of pseudorandomness in graph sequences. The forcing conjecture states that the forcing graphs are exactly
Forcing_graph
solves the stable matching problem Pseudorandom number generators (uniformly distributed—see also List of pseudorandom number generators for other PRNGs
List_of_algorithms
Czech mathematician and computer scientist
science at the Masaryk University. His research primarily concerns graph theory and graph algorithms. He obtained his Ph.D. from Charles University in Prague
Daniel_Kráľ
American computer scientist
computational complexity theory and cryptography. He focuses on the topics of pseudorandomness and zero-knowledge proofs. His work on the zig-zag product, with Omer
Salil_Vadhan
Venezuelan computer scientist
median of medians (a linear time selection algorithm), the Blum Blum Shub pseudorandom number generator, the Blum–Goldwasser cryptosystem, and more recently
Manuel_Blum
a rotation map is a function that represents an undirected edge-labeled graph, where each vertex enumerates its outgoing neighbors. Rotation maps were
Rotation_map
Polish-American mathematician (1932–2025)
binary digits with pseudorandom properties The Mycielskian, a construction for embedding any undirected graph into a larger graph with strictly higher
Jan_Mycielski
Binary operation in graph theory
operation which takes a large graph ( G {\displaystyle G} ) and a small graph ( H {\displaystyle H} ) and produces a graph that approximately inherits the
Zig-zag_product
Subset of a graph's vertices, including at least one endpoint of every edge
ECCC TR16-124. Khot, Subhash; Minzer, Dor; Safra, Muli (2018). "Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion". 2018 IEEE 59th Annual Symposium
Vertex_cover
Bipartite graph with nodes
K , ϵ ) {\displaystyle (N,M,D,K,\epsilon )} -extractor is a bipartite graph with N {\displaystyle N} nodes on the left and M {\displaystyle M} nodes
Extractor_(mathematics)
Theorem in graph theory
into graphs such that G ( 3 ) {\displaystyle G^{(3)}} sits pseudorandomly on top; a partition of V ( G ) {\displaystyle V(G)} such that the graphs in (1)
Hypergraph_removal_lemma
Linear error correcting code
gives good decoding performance. In general, pseudorandom codes have complex encoders, but pseudorandom codes with the best decoders can have simple encoders
Low-density_parity-check_code
Unsolved problem in computational complexity theory
S2CID 15794408 Khot, Subhash; Minzer, Dor; Safra, Muli (2018), "Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion", 2018 IEEE 59th Annual Symposium
Unique_games_conjecture
American mathematician (1935–2020)
Graham studied the mixing time of this process, motivated by the study of pseudorandom number generators.[A87] Graham became a capable juggler beginning at
Ronald_Graham
Group with no large product-free subset
quotient of Γ n {\displaystyle \Gamma _{n}} is unbounded. Cayley graphs generated from pseudorandom groups have strong mixing properties; that is, BiCay ( Γ
Quasirandom_group
American mathematician (1932–2016)
and merits of maximum length shift register sequences, also known as pseudorandom or pseudonoise sequences, which have extensive military, industrial,
Solomon_W._Golomb
Israeli computer scientist
for Computing Machinery in 2014 "For contributions to the study of pseudorandomness, derandomization, and cryptography." Reingold, Omer (2008), "Undirected
Omer_Reingold
Theorem in functional analysis
into a controlled number of pieces that interact with each other in a pseudorandom way. Another application of the Grothendieck inequality is to produce
Grothendieck_inequality
Simple and widely known encryption technique
the shift by looking at the displacement of particular features of the graph. This is known as frequency analysis. For example, in the English language
Caesar_cipher
(combinatorics) Graph structure theorem (graph theory) Grinberg's theorem (graph theory) Grötzsch's theorem (graph theory) Hajnal–Szemerédi theorem (graph theory)
List_of_theorems
Israeli mathematician and computer scientist
Linial and his co-authors show that these functions behave poorly as pseudorandom number generators, can be approximated well by polynomials, and can be
Nati_Linial
Italian professor of computer science
the University of Milan. He created the xorshift+ and xoroshiro128+ pseudorandom number generators. Xorshift128+ is used in the JavaScript engines of
Sebastiano_Vigna
Algorithm that employs a degree of randomness as part of its logic or procedure
In common practice, randomized algorithms are approximated using a pseudorandom number generator in place of a true source of random bits; such an implementation
Randomized_algorithm
On finding a repeating loop in a sequence
The applications of cycle detection include testing the quality of pseudorandom number generators and cryptographic hash functions, computational number
Cycle_detection
Type of data structure
control systems (although, strictly speaking, they use directed acyclic graphs, not trees); the Tahoe-LAFS backup system; Zeronet; OpenZFS the Bitcoin
Merkle_tree
Mathematical method in extremal graph theory
mathematics, the hypergraph regularity method is a powerful tool in extremal graph theory that refers to the combined application of the hypergraph regularity
Hypergraph_regularity_method
mathematical discipline of graph theory, the expander walk sampling theorem intuitively states that sampling vertices in an expander graph by doing relatively
Expander_walk_sampling
Class of erasure-correcting fountain codes
2002. Like some other fountain codes, LT codes depend on sparse bipartite graphs to trade reception overhead for encoding and decoding speed. The distinguishing
Luby_transform_code
Post-quantum digital signature scheme
Random number generation Cryptographically secure pseudorandom number generator (CSPRNG) Pseudorandom noise (PRN) Secure channel Insecure channel Subliminal
SQIsign
Complexity class (logarithmic space)
whether there exists a path between two vertices in a given undirected graph, is in L, showing that L = SL, since USTCON is SL-complete. One consequence
L_(complexity)
Intelligence in machines
intelligent computing Outline of deep learning Outline of machine learning Pseudorandomness – Appearing random but actually being generated by a deterministic
Artificial_intelligence
Integer factorization algorithm
n {\displaystyle g(x)=(x^{2}+1){\bmod {n}}} ), is used to generate a pseudorandom sequence. g ( x ) {\displaystyle g(x)} must be a polynomial. A starting
Pollard's_rho_algorithm
On the existence of arithmetic progressions in subsets of the natural numbers
satisfy certain pseudorandomness conditions. Later on Conlon, Fox, and Zhao strengthened this theorem by weakening the necessary pseudorandomness condition
Roth's theorem on arithmetic progressions
Roth's_theorem_on_arithmetic_progressions
Model of computational complexity
Boolean circuit with n {\displaystyle n} input bits is a directed acyclic graph in which every node (usually called gates in this context) is either an
Circuit_complexity
Secure multi-party computation protocol
Each participant then locally feeds this shared master secret into a pseudorandom number generator, in order to produce as many shared "coin flips" as
Dining_cryptographers_problem
On 11 August 2013, the Bitcoin Foundation announced that a bug in a pseudorandom number generator within the Android operating system had been exploited
History_of_bitcoin
Statistical fallacy
tendency to underestimate the likelihood of clusters appearing in random or pseudorandom datasets. The name comes from an anecdote about a person in Texas who
Texas_sharpshooter_fallacy
Computational problem
samples typically produce a better covering of configuration space than pseudorandom ones, though some recent work argues that the effect of the source of
Motion_planning
Austrian mathematician (born 1957)
methods. He also investigated (with Istvan Berkes and Walter Philipp) pseudorandom properties of lacunary sequences. In the theory of equidistribution he
Robert_F._Tichy
missing publisher (link). O. Reingold and L. Trevisan and S. Vadhan. Pseudorandom walks in biregular graphs and the RL vs. L problem, ECCC TR05-022, 2004.
RL_(complexity)
Coding theory algorithm
Sipser–Spielman construction of expander codes, where the underlying graph is bipartite graph. Sipser and Spielman introduced a constructive family of asymptotically
Zemor's_decoding_algorithm
Hiding messages in other messages
steganography is the first-ever effort to improve the codebook partition by using Graph theory along with Quantization Index Modulation in low bit-rate streaming
Steganography
Chinese computer scientist, physicist, and computational theorist
the theory of computation, including the complexity-based theory of pseudorandom number generation, cryptography, and communication complexity". In 2021
Andrew_Yao
Tool used in probabilistic polynomial identity testing
numbers are used in a number of applications such as hash table sizing, pseudorandom number generators and in key generation for cryptography. Therefore,
Schwartz–Zippel_lemma
System that regulates the formation of blocks on a blockchain
Retrieved 2007-11-04. Tromp, John (2015). "Cuckoo Cycle: A Memory Bound Graph-Theoretic Proof-of-Work" (PDF). Financial Cryptography and Data Security
Proof_of_work
General-purpose programming language
graphical user interfaces, connecting to relational databases, generating pseudorandom numbers, arithmetic with arbitrary-precision decimals, manipulating regular
Python_(programming_language)
Digital asset using a distributed ledger
"Distributed Ledger Technology: Blockchain Compared to Directed Acyclic Graph", 2018 IEEE 38th International Conference on Distributed Computing Systems
Cryptocurrency
Cryptography secured against quantum computers
isogeny graphs of elliptic curves (and higher-dimensional abelian varieties) over finite fields, in particular supersingular isogeny graphs, to create
Post-quantum_cryptography
Algorithms for zeros of functions
root-finding method for the multivariable case Cryptographically secure pseudorandom number generator – Type of functions designed for being unsolvable by
Root-finding_algorithm
Russian mathematician
Wigderson Circuit complexity Free group Natural proofs One-way function Pseudorandom function family Resolution (logic) "International Mathematical Union:
Alexander_Razborov
Discrete model of computation
cryptography. Two-dimensional cellular automata can be used for constructing a pseudorandom number generator. Cellular automata have been proposed for public-key
Cellular_automaton
or P {\displaystyle \mathbb {P} } .) probit – probit function. PRNG – pseudorandom number generator. PSL – projective special linear group. PNT – prime
List of mathematical abbreviations
List_of_mathematical_abbreviations
only the x coordinates of the points that fall below the function (see graph). As a direct consequence of the fundamental theorem of simulation, the
Ratio_of_uniforms
Amount of computational work that a computer system performs
reason for "+1" in the Linux code from above; FreeBSD instead uses a pseudorandom offset added to the interval. loadavg.h also mentions that the use of
Load_(computing)
Cryptographic attack
An example of a timing attack being performed on a web cache. The left graph denotes a timing attack successfully detecting a cached image whereas the
Timing_attack
American annual computer science prize
Archived from the original on January 22, 2024. Retrieved March 4, 2024. "Open Graph Title: University of Tennessee's Jack Dongarra receives 2021 ACM A.M. Turing
Turing_Award
Finite or infinite ordered list of elements
progression Harmonic progression Holonomic sequence Regular sequence Pseudorandom binary sequence Random sequence Related concepts List (computing) Net
Sequence
Allen, Frances E. Developed bit vector notation and program control-flow graphs; first female IBM Fellow (1989); first female recipient of the ACM's Turing
List of pioneers in computer science
List_of_pioneers_in_computer_science
2018 open and royalty-free video coding format
descriptive parameters to the decoder, which adds back a synthetic, pseudorandom noise signal that's shaped after the original component. It is the visual
AV1
Mathematical theory
e^{-t^{2}/\left(2{\bar {\Delta }}\right)}} Janson's Inequality has been used in pseudorandomness for bounds on constant-depth circuits. Research leading to these inequalities
Janson_inequality
8-bit microprocessor
portable devices, including the Game Gear and the TI-81 and succeeding graphing calculators. The Z80 was the brainchild of Federico Faggin, a key figure
Zilog_Z80
Reed, 1998, vol. 16) Modern Cryptography, Probabilistic Proofs and Pseudorandomness (Oded Goldreich, 1999, vol. 17) Geometric Discrepancy: An Illustrated
Algorithms_and_Combinatorics
Numbers obtained by adding the two previous ones
the Fibonacci search technique and the Fibonacci heap data structure, and graphs called Fibonacci cubes used for interconnecting parallel and distributed
Fibonacci_sequence
Prime number of the form 2^n – 1
polynomials of very high order. Such primitive trinomials are used in pseudorandom number generators with very large periods such as the Mersenne twister
Mersenne_prime
Exponent of a power of two
Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness, Progress in Computer Science and Applied Logic, vol. 22, Birkhäuser
Binary_logarithm
Four Dimensions" 2000 Piotr Indyk (Stanford) "Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation" 1999 Markus Bläser
Machtey_Award
processes CSP—Cryptographic Service Provider CSPRNG—Cryptographically secure pseudorandom number generator CSR—Certificate signing request CSRF—Cross-site request
List of computing and IT abbreviations
List_of_computing_and_IT_abbreviations
Method for finding kth smallest value
random number generator, a version of the Floyd–Rivest algorithm using a pseudorandom number generator seeded with only logarithmically many true random bits
Selection_algorithm
Mathematical function for the probability a given outcome occurs in an experiment
of stochastic processes and fractals. Most algorithms are based on a pseudorandom number generator that produces numbers X {\displaystyle X} that are uniformly
Probability_distribution
Noise generated by an atmosphere
variation is also used to generate high quality random numbers. Unlike pseudorandom number generators (PRNGs), which use algorithms and are inherently deterministic
Atmospheric_noise
Magnetic resonance imaging technique
During data acquisition, MR system settings are intentionally varied in a pseudorandom manner to create unique signal evolutions or "fingerprints" for each
Magnetic resonance fingerprinting
Magnetic_resonance_fingerprinting
Subfield of cryptography
encryption Multi-party fair exchange protocol Oblivious transfer Oblivious Pseudorandom Function Privacy-preserving computational geometry Yao's Millionaires'
Secure multi-party computation
Secure_multi-party_computation
Problem in statistical estimation
for serial numbers in any base . For this, a cryptographically secure pseudorandom number generator may be used. All these methods require a lookup table
German_tank_problem
Computer security method
ISBN 978-3-540-74617-1 Nandi, Mridul (2014). "XLS is Not a Strong Pseudorandom Permutation". Advances in Cryptology – ASIACRYPT 2014. Lecture Notes
Provable_security
Computer simulation with random inputs
called a sequence of stochastic numbers. The algorithms typically rely on pseudorandom numbers, computer generated numbers mimicking true random numbers, to
Stochastic_simulation
Non-linear digital filtering technique to remove noise
1921377. ISSN 1616-8658. Tay, David B. (July 2023). "Median Autoregressive Graph Filters". IEEE Signal Processing Letters. 30: 833–837. Bibcode:2023ISPL
Median_filter
Method of bypassing authentication or encryption in a computer
of Microsoft's BackOffice. The Dual EC DRBG cryptographically secure pseudorandom number generator was revealed in 2013 to possibly have a kleptographic
Backdoor_(computing)
Computer programming method for hashing
computations such as the call to a random or pseudorandom number generator. For instance, Java 8 uses an Xorshift pseudorandom number generator to construct these
Linear_probing
Indian inventions
Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness, Progress in Computer Science and Applied Logic, vol. 22, Birkhäuser
List of Indian inventions and discoveries
List_of_Indian_inventions_and_discoveries
Method for simulating stochastic systems
time of the next event and which event occurs. Using two independent pseudorandom numbers r 1 {\displaystyle r_{1}} and r 2 {\displaystyle r_{2}} , uniformly
Gillespie_algorithm
Development of the mathematical function
Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness, Progress in Computer Science and Applied Logic, vol. 22, Birkhäuser
History_of_logarithms
Authentication and encryption system
by deriving the encryption keys from the resumption ticket using a pseudorandom function. Transport Layer Security QUIC Google Cloud Platform ALTS White
ALTS
Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness, Progress in Computer Science and Applied Logic, vol. 22, Birkhäuser
Timeline_of_mathematics
median of medians (a linear time selection algorithm), the Blum Blum Shub pseudorandom number generator, the Blum-Goldwasser cryptosystem, and more recently
Science and technology in Venezuela
Science_and_technology_in_Venezuela
travel, tourism, insurance
PSEUDORANDOM GRAPH
PSEUDORANDOM GRAPH
PSEUDORANDOM GRAPH
PSEUDORANDOM GRAPH
PSEUDORANDOM GRAPH
PSEUDORANDOM GRAPH
PSEUDORANDOM GRAPH
PSEUDORANDOM GRAPH
PSEUDORANDOM GRAPH
travel, tourism, insurance