276 citations · 496 across the 21 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2012★ 5 cited
A Comparative Study on the Performance of Permutation Algorithms
Youssef Bassil
Permutation is the different arrangements that can be made with a given number of things taking some or all of them at a time. The notation P(n,r) is used to denote the number of p…
cs.DS2012★ 4 cited
Sequential and Parallel Algorithms for the Addition of Big-Integer Numbers
Youssef Bassil, Aziz Barbar
Today's PCs can directly manipulate numbers not longer than 64 bits because the size of the CPU registers and the data-path are limited. Consequently, arithmetic operations such as…
cs.DS2012★ 1 cited
Sequential & Parallel Algorithms for Big-Integer Numbers Subtraction
Youssef Bassil, Aziz Barbar
Many emerging computer applications require the processing of large numbers, larger than what a CPU can handle. In fact, the top of the line PCs can only manipulate numbers not lon…