Conference paper
Risks and potentials of using EMV for internet payments
Els van Herreweghen, Uta Wille
USENIX Workshop on Smartcard Technology 1999
A deterministic O1992-time algorithm for the problem of routing an aribitrary permutation on an N-processor bounded-degree network with bounded buffers is presented. Unlike all previous deterministic solutions to this problem, our routing scheme does not reduce the routing problem to sorting and does not use the sorting network of Ajtai, et al. [1]. Consequently, the constant in the run time of our routing scheme is substantially smaller, and the network topology is significantly simpler. © 1992, ACM. All rights reserved.
Els van Herreweghen, Uta Wille
USENIX Workshop on Smartcard Technology 1999
Arthur Nádas
IEEE Transactions on Neural Networks
Annina Riedhauser, Viacheslav Snigirev, et al.
CLEO 2023
Wei Zhang, Timothy Wood, et al.
ICAC 2014