A Note on Karr's Algorithm

@inproceedings{MllerOlm2004ANO,
  title={A Note on Karr's Algorithm},
  author={Markus M{\"u}ller-Olm and Helmut Seidl},
  booktitle={ICALP},
  year={2004}
}
We give a simple formulation of Karr’s algorithm for computi ng all affine relationships in affine programs. This simplified algo rithm runs in time O(nk3) wheren is the program size and k is the number of program variables assuming unit cost for arithmetic operations. This improve s upon the original formulation by a factor ofk. Moreover, our re-formulation avoids exponential growth of the lengths of intermediately occurring numbers ( in binary representation) and uses less complicated… CONTINUE READING
Highly Influential
This paper has highly influenced 10 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 77 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.
48 Citations
12 References
Similar Papers

Citations

Publications citing this paper.

77 Citations

01020'06'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 77 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…