There’s a rather beautiful algorithm for finding the greatest common divisor of two positive integers. For example, the greatest common divisor of 120 and 105 is 15. It’s clear that 15 is a divisor of ...

Abstract: The story behind the Euclidean algorithm and its relationship to the solution of the Diophantine equation is examined in this article. The Euclidean algorithm appears in Proposition 2 in ...

Abstract: In this paper, we present a Reformulated Euclidean Algorithm (REA) and its optimized architecture for Reed-Solomon decoding. Through algorithm ...

The Euclid space telescope has released five mesmerizing new photos of our universe, kicking off a six-year campaign to unveil the secrets of dark matter, dark energy and other cosmological mysteries.

A Java Swing GUI Tool which is used in order to calculate the Modular Multiplicative Inverse Value of a set of two user-specified numbers of significant size. Allows the user to calculate the solution ...

ABSTRACT: In certain computational systems the amount of space required to execute an algorithm is even more restrictive than the corresponding time necessary for solution of a problem. In this paper ...

This was an invited paper for a festschrift in honor of Manfred Broy’s 60th birthday. It’s a whimsical introduction to TLA+, including proofs. Judged as literature, it’s probably the best thing I have ...