Do the arithmetic operations really execute in constant time?

Authors:
Ranjan Chaudhuri
Affiliations:
Eastern Michigan University, Ypsilanti, Michigan
Venue:
ACM SIGCSE Bulletin
Year:
2003

Citing 3
Cited 2

A course in number theory and cryptography

A course in number theory and cryptography
Data Structures and Algorithms

Data Structures and Algorithms
Introduction to Algorithms

Introduction to Algorithms

Teaching bit-level algorithm analysis to the undergraduates in computer science

ACM SIGCSE Bulletin
The p-sized partitioning algorithm for fast computation of factorials of numbers

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.