Nachum Dershowitz
- Raymond T. Boute. The Euclidean definition of the functions div and mod. ACM Trans. Program. Lang. Syst., 14(2):127--144, April 1992. Google Scholar
Digital Library
- Nicolas Brisebarre, David Defour, Peter Kornerup, Jean-Michel Muller, and Nathalie Revol. A new range-reduction algorithm. IEEE Trans. Comput., 54(3):331--339, March 2005. Google ScholarDigital Library
- Nachum Dershowitz and Edward M. Reingold. Calendrical Calculations. Cambridge University Press, New York, NY, USA, 3rd edition, 2007. Google ScholarDigital Library
- Ronald L. Graham, Donald E. Knuth, and Oren Patashnik. Concrete Mathematics. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 2nd edition, 1994.Google Scholar
- Kenneth E. Iverson. A Programming Language. John Wiley & Sons, Inc., New York, NY, USA, 1962. Google ScholarDigital Library
- Tsuneo Nakanishi and Akira Fukuda. Modulo interval arithmetic and its application to program analysis. Transactions of Information Processing Society of Japan (Jöhö Shori Gakkai ronbun shi), 42(4):829--837, April 2001.Google Scholar
- Tsuneo Nakanishi, Akira Fukuda, Kazuki Joe, and Constantine D. Polychronopoulos. The modulo interval: A simple and practical representation for program analysis. In Proceedings of the 1999 International Conference on Parallel Architectures and Compilation Techniques, PACT '99, pages 91--96, Washington, DC, USA, 1999. IEEE Computer Society. Google ScholarDigital Library
Index Terms
- Modulo intervals: a proposed notation
Recommendations
On the distinctness of maximal length sequences over Z/(pq) modulo 2
This paper studies the distinctness problem of the reductions modulo 2 of maximal length sequences over Z/(pq), where p and q are two different odd primes with p 1, it is proved that if there exist a nonnegative integer S and a primitive element @x in Z/...
k-Intervals: A New Extension of the k-Means Algorithm
ICTAI '14: Proceedings of the 2014 IEEE 26th International Conference on Tools with Artificial IntelligenceIn this paper we propose a new extension of the k-means algorithm by changing the model it uses to represent clusters. The objectives of traditional k-means and lots of other k-means-related clustering algorithms are all center-based. We suggest using ...
A universal sequence of integers generating balanced Steinhaus figures modulo an odd number
In this paper, we partially solve an open problem, due to J.C. Molluzzo in 1976, on the existence of balanced Steinhaus triangles modulo a positive integer n, that are Steinhaus triangles containing all the elements of Z/nZ with the same multiplicity. ...
Comments