Skip to search formSkip to main contentSkip to account menu

Modulo operation

Known as: Mod operator, Modulo function, Mod 
In computing, the modulo operation finds the remainder after division of one number by another (sometimes called modulus). Given two positive numbers… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
19 Virtual analog synthesis refers to computational methods that imitate the sound production principles used in electronic music… 
Highly Cited
2005
Highly Cited
2005
The demonstration of an efficient construction proven secure in a formal model that captures all intuitive security properties of… 
Highly Cited
2005
Highly Cited
2005
Abstract For a given elliptic curve $\mathbf{E}$ , we obtain an upper bound on the discrepancy of sets of multiples ${{z}_{s}}G… 
Highly Cited
1995
Highly Cited
1995
Rate 1/2 convolutional codes over the ring of integers modulo M are combined with M-ary continuous phase modulation (CPM) schemes… 
Highly Cited
1994
Highly Cited
1994
Trellis-coding techniques are applied to continuous-phase frequency-shift keying (CPFSK). A new coding scheme based on… 
Highly Cited
1994
Highly Cited
1994
A very simple multiplier cell is developed for use in a linear, purely systolic array forming a digit-serial multiplier for… 
Review
1987
Review
1987
The problem of specifying, constructing, and understanding specialized, limited inference systems arises in many areas of AI. As… 
Highly Cited
1986
Highly Cited
1986
The augmented data manipulator (ADM), inverse augmented data manipulator (IADM), and the gamma network are based on the Plus… 
Highly Cited
1970
Highly Cited
1970
This paper is an attempt to develop minimization algorithms for switching circuits based on Reed-Muller canonic forms. In… 
Highly Cited
1970
Highly Cited
1970
An upper bound is derived for the time required to add numbers modulo 2n, using circuit elements with a limited fan-in and unit…