Do the arithmetic operations really execute in constant time?

@article{Chaudhuri2003DoTA,
  title={Do the arithmetic operations really execute in constant time?},
  author={Ranjan Chaudhuri},
  journal={ACM SIGCSE Bull.},
  year={2003},
  volume={35},
  pages={43-44}
}
  • R. Chaudhuri
  • Published 1 June 2003
  • Computer Science
  • ACM SIGCSE Bull.
The paper emphasizes the need for exposing the undergraduate computer science students to the bit-level analysis of the run-times of certain computer algorithms. These are algorithms where the input(s) consist of one or more integers and only a bit-level analysis yields a more realistic estimate of the run-time behaviors of such algorithms. 
Teaching bit-level algorithm analysis to the undergraduates in computer science
The paper presents a number of elementary examples which could be used to teach the concept of bit-level algorithm analysis to the undergraduate students in Computer Science. Each of these example
The p-sized partitioning algorithm for fast computation of factorials of numbers
TLDR
The method presented here is unique in the sense that it exploits finite order differences to reduce the number of multiplications necessary to compute the factorial.
A Combinatorial Optimization Approach to Constrained Clustering
Motivated by an application in the consolidation of farmland, we study two polytopes tied to the clustering of a geometric point set into clusters of prescribed sizes. First, we characterize the
A Complete Bibliography of Publications in SIGCSE Bulletin: 2000{2009
2012 [AS13b, Wal12a]. 2013 [Alv13, Bar13, Cam13, Car13, CCS13, Cut13, Edi14, Swe13]. 2014 [CDS13, DN14, ND14, Rod14, Tym14a]. 2015 [DeL14a, DeL14b, She15b]. 2016 [AT16a, CCV16, CCV17, MR15, SDCT16a,

References

SHOWING 1-5 OF 5 REFERENCES
Data Structures and Algorithms
TLDR
The basis of this book is the material contained in the first six chapters of the earlier work, The Design and Analysis of Computer Algorithms, and has added material on algorithms for external storage and memory management.
A Course in Number Theory and Cryptography
Computing Curriculum 2001 (CC 2001) Computer Science <computer.org/education/cc2001
  • Computing Curriculum 2001 (CC 2001) Computer Science <computer.org/education/cc2001
J. Data Structures and Algorithms
  • J. Data Structures and Algorithms
  • 1985