de.mpg.escidoc.pubman.appbase.FacesBean
English

# Item

ITEM ACTIONSEXPORT

Released

Report

#### More geneal parallel tree contraction: Register allocation and broadcasting in a tree

##### MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44564

Hagerup,  Torben
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

##### Locator
There are no locators available
##### Fulltext (public)

1996-1-024
(Any fulltext), 10KB

##### Supplementary Material (public)
There is no public supplementary material available
##### Citation

Diks, K., & Hagerup, T.(1996). More geneal parallel tree contraction: Register allocation and broadcasting in a tree (MPI-I-1996-1-024). Saarbrücken: Max-Planck-Institut für Informatik.

Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-A055-7
##### Abstract
We consider arithmetic expressions over operators $+$, $-$, $*$, $/$, and $\sqrt{\ }$, with integer operands. For an expression $E$, a separation bound $sep(E)$ is a positive real number with the property that $E\neq 0$ implies $|E| \geq sep(E)$. We propose a new separation bound that is easy to compute an d stronger than previous bounds.