b'@techreport{DiksHagerup96,'b'\nTITLE = {More general parallel tree contraction: Register allocation and broadcasting in a tree},\nAUTHOR = {Diks, Krzysztof and Hagerup, Torben},\nLANGUAGE = {eng},\nNUMBER = {MPI-I-1996-1-024},\nINSTITUTION = {Max-Planck-Institut f{\\"u}r Informatik},\nADDRESS = {Saarbr{\\"u}cken},\nYEAR = {1996},\nDATE = {1996},\nABSTRACT = {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.},\nTYPE = {Research Report / Max-Planck-Institut f\xc3\xbcr Informatik},\n}\n'