25 citations · 290 across the 54 of their papers we have counts for
Showing 2013 · cs.PLShow all
3 papers · 2 filters
cs.PL2013★ 3 cited
Long multiplication by instruction sequences with backward jump instructions
J. A. Bergstra, C. A. Middelburg
For each function on bit strings, its restriction to bit strings of any given length can be computed by a finite instruction sequence that contains only instructions to set and get…
cs.PL2013★ 5 cited
Instruction sequences expressing multiplication algorithms
J. A. Bergstra, C. A. Middelburg
For each function on bit strings, its restriction to bit strings of any given length can be computed by a finite instruction sequence that contains only instructions to set and get…
cs.PL2013★ 8 cited
Instruction sequence expressions for the secure hash algorithm SHA-256
J. A. Bergstra, C. A. Middelburg
The secure hash function SHA-256 is a function on bit strings. This means that its restriction to the bit strings of any given length can be computed by a finite instruction sequen…