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)

Related topics

Related topics

50 relations
AC (complexity)AMPLAssertion (software development)BASIC

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
Oscillator and Filter Algorithms for Virtual Analog Synthesis
19 Virtual analog synthesis refers to computational methods that imitate the sound production principles used in electronic music… 
Highly Cited
2005
Highly Cited
2005
Efficient Secure Group Signatures with Dynamic Joins and Keeping Anonymity Against Group Managers
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
Certain Exponential Sums and Random Walks on Elliptic Curves
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
2000
Highly Cited
2000
Critical Motions for Auto-Calibration When Some Intrinsic Parameters Can Vary
Auto-calibration is the recovery of the full camera geometry and Euclidean scene structure from several images of an unknown 3D… 
Highly Cited
1994
Highly Cited
1994
Trellis-coded continuous-phase frequency-shift keying with ring convolutional codes
Trellis-coding techniques are applied to continuous-phase frequency-shift keying (CPFSK). A new coding scheme based on… 
Highly Cited
1993
Highly Cited
1993
High-radix modular multiplication for cryptosystems
  • Peter Kornerup
  • Proceedings of IEEE 11th Symposium on Computer…
  • 1993
  • Corpus ID: 5859414
Two algorithms for modular multiplication with very large moduli are analyzed specifically for their applicability when a high… 
Highly Cited
1990
Highly Cited
1990
Finite projectivity and contravariant finiteness
Let A be an artin algebra, let mod A be the category of finitely generated A-modules, and let pdx mod A be the subcategory of mod… 
Highly Cited
1986
Highly Cited
1986
The extra stage gamma network
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
Minimization of Exclusive or and Logical Equivalence Switching Circuits
This paper is an attempt to develop minimization algorithms for switching circuits based on Reed-Muller canonic forms. In… 
Highly Cited
1967
Highly Cited
1967
On the Time Required to Perform Multiplication
The time required to perform multiplication is investigated. A lower bound on the time required to perform multiplication, as… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)