✦ LIBER ✦

Efficient algorithms for the clearing of interbank payments

✍ Scribed by Michael M. Güntzer; Dieter Jungnickel; Matthias Leclerc

Book ID: 108445351
Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 555 KB
Volume: 106
Category: Article
ISSN: 0377-2217
DOI: 10.1016/s0377-2217(97)00265-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The topology of interbank payment flows

✍ Kimmo Soramäki; Morten L. Bech; Jeffrey Arnold; Robert J. Glass; Walter E. Beyel 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 692 KB

The Efficiency of Payments for Environme

The Efficiency of Payments for Environmental Services in Tropical Conservation

✍ SVEN WUNDER 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 178 KB

Efficient algorithms for the block edit

Efficient algorithms for the block edit problems

✍ Hsing-Yen Ann; Chang-Biau Yang; Yung-Hsing Peng; Bern-Cherng Liaw 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 466 KB

Efficient Algorithms for the Block Hesse

Efficient Algorithms for the Block Hessenberg Form

✍ Enrique S. Quintana-Ortí; Gregorio Quintana-Ortí; Maribel Castillo; Vicente Hern 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 250 KB

Efficient approximation algorithms for t

Efficient approximation algorithms for the achromatic number

✍ Piotr Krysta; Krzysztof Loryś 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 357 KB

Efficient Algorithms for Computing the J

Efficient Algorithms for Computing the Jacobi Symbol

✍ S.M. Eikenberry; J.P. Sorenson 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 464 KB

We present two new algorithms for computing the Jacobi Symbol: the right-shift and left-shift k-ary algorithms. For inputs of at most n bits in length, both algorithms take O(n 2 / log n) time and O(n) space. This is asymptotically faster than the traditional algorithm, which is based in Euclid's al