Institutional Repository

Browsing School of Computing by Author "Aik-Koen, Heng"

Browsing School of Computing by Author "Aik-Koen, Heng"

Sort by: Order: Results:

  • Some remarks on deleting a node from a binary tree 
    Aik-Koen, Heng (Computer Society of South Africa (on behalf of SAICSIT), 1986)
  • A summation problem 
    Aik-Koen, Heng (Computer Society of South Africa (on behalf of SAICSIT), 1986)
    This paper suggests a method to minimize the roundoff errors of adding N positive nimbers. The idea of construction can be easily applied to a linear recurrence process.

Search UnisaIR


Browse

My Account