Abstract. We describe efficient formulas for computing pairings on ordinary elliptic curves over prime fields. First, we generalize lazy reduction techniques, previously considere...
Diego F. Aranha, Koray Karabina, Patrick Longa, Ca...
A non-crossing pairing on a bitstring matches 1s and 0s in a manner such that the pairing diagram is nonintersecting. By considering such pairings on arbitrary bitstrings 1n1 0m1 ....
Todd Kemp, Karl Mahlburg, Amarpreet Rattan, Cliffo...
For the M/D/1 processor sharing queue, explicit formulas for the coefficient of variation of the sojourn time conditioned on the service time and on the residual service times of ...
Abstract. We give explicit formulas for the Kazhdan-Lusztig P- and Rpolynomials for permutations coming from the variety F1,n−1 of incomplete flags consisting of a line and a hy...
We obtain explicit formulas for normalized doubly coprime factorizations of the transfer functions of the following class of linear systems: the input and output operators are vec...
Abstract— The Chen-Fliess series is known to be an exponential Lie series. Previously explicit formulas for the iterated integral coefficients were known only for its factorizat...