We now have our own terminal tournament featuring a competition for data scientists, analysts, and engineers. Iran's president issues open letter to the American public Dietitians say you shouldn't ...

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 ...

This program offers a C++ solution to compute the Greatest Common Divisor (GCD) of two strings, showcasing an application of the Euclidean algorithm for string manipulation.

My solutions to Google's Foobar Challenge for coding data structures and algorithms. Includes my solution code, unit tests, background notes, design notes, and references.

The technical term is named after the Persian mathematician Muhammad Ibn Musa al-Khwarizmi, author of a work on calculation rules (who lived around 780 to 850 AD). Examples from everyday life are ...

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 ...

Abstract: RSA, which based on the great difficulty of integer factorization, is the most widely-used public-key cryptosystem used in electronic commerce. Euclid algorithm and extended Euclid algorithm ...