Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Robert Gallant"'
Autor:
Robert Gallant, Georg Gunther
Publikováno v:
The College Mathematics Journal. 53:3-12
Oligodendrocytes are the myelinating cell of the CNS and are critical for the functionality of the nervous system. In the packed CNS, we know distinct profiles of oligodendrocytes are present. Here, we used intravital imaging in zebrafish to identify
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e0cb65e620eddf97ec99664dca203046
https://doi.org/10.1101/2022.03.10.483786
https://doi.org/10.1101/2022.03.10.483786
Autor:
Robert Gallant, Nancy E. Clarke
Publikováno v:
Discrete Mathematics. 340:1705-1715
For a fixed integer t, a set of vertices B of a graph G is a t-limited packing of G provided that the closed neighbourhood of any vertex in G contains at most t elements of B. The size of a largest possible t-limited packing in G is denoted Lt(G) and
Autor:
Robert Gallant
Publikováno v:
Journal of Mathematical Cryptology, Vol 6, Iss 1, Pp 1-20 (2012)
We consider finding discrete logarithms in a group G when the help of an algorithm D that distinguishes certain subsets of G from each other is available. For a group G of prime order p, if algorithm D is polynomialtime with complexity c(log(p)), we
Autor:
Robert J. Lambert, Adrian Antipa, Scott A. Vanstone, Robert Gallant, Daniel R. L. Brown, René Struik
Publikováno v:
Selected Areas in Cryptography ISBN: 9783540331087
Selected Areas in Cryptography
Selected Areas in Cryptography
Verification of ECDSA signatures is considerably slower than generation of ECDSA signatures. This paper describes a method that can be used to accelerate verification of ECDSA signatures by more than 40% with virtually no added implementation complex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::432b59dd43f64be7121f0655509cff1b
https://doi.org/10.1007/11693383_21
https://doi.org/10.1007/11693383_21
Publikováno v:
Mathematics of Computation; 1999, Vol. 69 Issue 232, p1699-1705, 7p
Publikováno v:
Discrete Applied Mathematics. (12):1357-1364
We define a k-limited packing in a graph, which generalizes a packing in a graph, and give several bounds on the size of a k-limited packing. One such bound involves the domination number of the graph, and here we show, when k = 2 , that all trees at