EXPANSION GRAPHS IN CRYPTOGRAPHY – PART II

GRAFOS EXPANSORES EN CRIPTOGRAFÍA – PARTE II

Published 2019-01-21

Open | Download
PDF (Spanish) FLIP
Issue
Vol. 6 No. 11 (2019): Revista Ingeniería, Matemáticas y Ciencias de la Información
Section
Artículos
How to Cite
[1]
D. A. GARCÍA, “EXPANSION GRAPHS IN CRYPTOGRAPHY – PART II”, Rev. Ing. Mat. Cienc. Inf, vol. 6, no. 11, pp. 73–83, Jan. 2019, Accessed: Dec. 22, 2024. [Online]. Available: https://ojs.urepublicana.edu.co/index.php/ingenieria/article/view/501
doi
Dimensions
PlumX
license

 

Esta obra está bajo una licencia internacional

Atribución/Reconocimiento 4.0 Internacional
DARÍO ALEJANDRO GARCÍA
Universidad de los Andes
    Show authors biography

    DARÍO ALEJANDRO GARCÍA,

    Matemático de la Universidad Nacional de Colombia, Magíster en Matemáticas y Doctorado en Matemáticas de la Universidad de los Andes. Postdoctorado/Estancia postdoctoral UNIVERSITE CLAUDE BERNARD LYON 1 Mathématiques - Institut Camile Jordan. Postdoctorado/Estancia postdoctoral UNIVERSITY OF LEEDS. Marie Curie Fellowship.

    Expansion graphs are a class of graphs that have two apparently contradictory properties: they are sparse and well connected. These graphs have important applications in computer science, such as the construction of optimized network configurations and, as we will see later, the construction of good graph-based summary functions.

    DOI: http://dx.doi.org/10.21017/rimci.2019.v6.n11.a57

    Article visits 1343 | PDF visits 1315

    Downloads

    Download data is not yet available.
    Tutorials

    Autors:

    How send article?

    Evaluator pair

    How to evaluate an article?

    Information

    Current Issue

    QR code

    Más leídos en los últimos 30 días

    Sistema OJS 3.4.0.5 - Metabiblioteca |