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
2009
Highly Cited
2009
Boolector: An Efficient SMT Solver for Bit-Vectors and Arrays
Satisfiability Modulo Theories (SMT) is the problem of deciding satisfiability of a logical formula, expressed in a combination… 
Highly Cited
2005
Highly Cited
2005
Dealing with spatial heterogeneity
Heterogeneity can be dealt with by defining homogeneous equivalent properties, known as averaging, or by trying to describe the… 
Highly Cited
2005
Highly Cited
2005
Fast Computation of Large Distributions and Its Cryptographic Applications
Let X1,X2,..., Xk be independent n bit random variables. If they have arbitrary distributions, we show how to compute… 
Highly Cited
2003
Highly Cited
2003
Peer-to-Peer Systems II
Structured peer-to-peer overlay networks provide a useful substrate for building distributed applications but there are general… 
Highly Cited
2000
Highly Cited
2000
On the construction of some capacity-approaching coding schemes
This thesis proposes two constructive methods of approaching the Shannon limit very closely. Interestingly, these two methods… 
Highly Cited
1999
Highly Cited
1999
Efficient VLSI implementation of modulo (2/sup n//spl plusmn/1) addition and multiplication
  • R. Zimmermann
  • Proceedings 14th IEEE Symposium on Computer…
  • 1999
  • Corpus ID: 14419934
New VLSI circuit architectures for addition and multiplication modulo (2/sup n/-1) and (2/sup n/+1) are proposed that allow the… 
Highly Cited
1996
Highly Cited
1996
Metropolitan area video-on-demand service using pyramid broadcasting
Abstract.Pyramid broadcasting is a new way of giving video-on-demand service on a metropolitan scale. We multiplex the most… 
Highly Cited
1996
Highly Cited
1996
Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
We show that computing the most significant bits of the secret key in a Diffie-Hellman key-exchange protocol from the public keys… 
Highly Cited
1990
Highly Cited
1990
Explicit bounds for primality testing and related problems
Many number-theoretic algorithms rely on a result of Ankeny, which states that if the Extended Riemann Hypothesis (ERH) is true… 
Highly Cited
1990
Highly Cited
1990
An Implementation of an Efficient Algorithm for Bisimulation Equivalence
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)