EUROCRYPT
2011
Springer
13 years 4 months ago
2011
Springer
Abstract. We describe efficient formulas for computing pairings on ordinary elliptic curves over prime fields. First, we generalize lazy reduction techniques, previously considere...
JCT
2011
13 years 7 months ago
2011
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 ....
ORL
2007
14 years 7 days ago
2007
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 ...
DM
1998
14 years 12 days ago
1998
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...
MCSS
2006
Springer
14 years 20 days ago
2006
Springer
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...
DM
2010
14 years 24 days ago
2010
Arratia, Bollob
CDC
2008
IEEE
14 years 7 months ago
2008
IEEE
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...