Gelasio Salazar

Gelasio Salazar

Auto-generated profile, based on publicly available information

Gelasio Salazar

Department of Mathematics and Statistics, Carleton University, Ottawa, Ontario, K1S 5B6, Canada

Research Focus & Metrics

Academic Career Length

29Years (1998-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 December 1998 in Chaos: An Interdisciplinary Journal of Nonlinear Science
Verified
Journal Article
Closed access
JUJesús Urı́as
Jesús Urı́as
EUEdgardo Ugalde
Edgardo Ugalde
GSGelasio Salazar
Gelasio Salazar
Cryptosystems for binary information are based on two primitives: an indexed family of permutations of binary words and a generator of pseudorandom sequences of indices. A very efficient implementation of the primitives is constructed using the phenomenon of synchronization in cellular automata.

1 May 2002 in Graphs and Combinatorics
Verified
Journal Article
Closed access
PDF file
RRR. Bruce Richter
R. Bruce Richter
GSGelasio Salazar
Gelasio Salazar


1 May 2001 in Journal of Combinatorial Theory, Series B
Verified
Journal Article
Closed access
PDF file
HJHector A. Juarez
Hector A. Juarez
GSGelasio Salazar
Gelasio Salazar

1 September 2005 in Graphs and Combinatorics
Verified
Journal Article
Closed access
PDF file
CMCriel Merino
Criel Merino
GSGelasio Salazar
Gelasio Salazar
JUJorge Urrutia
Jorge Urrutia

27 September 2000 in arXiv
Verified
Preprint
Open access
PDF file
LGLev Glebsky
Lev Glebsky
GSGelasio Salazar
Gelasio Salazar
It has been long congectured that the crossing number of $C_m\times C_n$ is $(m-2)n$ for $2<m<=n$. In this paper we proved that conjecture is true for all but finitely many $n$ for each $m$. More specifically we proved conjecture for $n>=(m/2)((m+3)^2/2+1)$.The proof is largely based on the theory of arrangements introduced by Adamsson and further developed by Adamsson and Richter.