X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/prng_gpu.git/blobdiff_plain/4797365cf4607caea2473f7ce2f4fe6c3bbf9c51..e413aa9f2f3893a394428e26368d44eaa851a986:/prng_gpu.tex?ds=inline

diff --git a/prng_gpu.tex b/prng_gpu.tex
index f985e03..f7499d9 100644
--- a/prng_gpu.tex
+++ b/prng_gpu.tex
@@ -1040,7 +1040,7 @@ not only sought in general to obtain chaos, but they are also required for rando
 \end{itemize}
 
 
-We have proven in our previous works~\cite{} that chaotic iterations satisfying Theorem~\ref{Th:Caractérisation   des   IC   chaotiques} are, among other
+We have proven in our previous works~\cite{guyeux12:bc} that chaotic iterations satisfying Theorem~\ref{Th:Caractérisation   des   IC   chaotiques} are, among other
 things, strongly transitive, topologically mixing, chaotic as defined by Li and Yorke,
 and that they have a topological entropy and an exponent of Lyapunov both equal to $ln(\mathsf{N})$,
 where $\mathsf{N}$ is the size of the iterated vector.