b'@techreport{BrodalPinotti98,'b'\nTITLE = {Comparator networks for binary heap construction},\nAUTHOR = {Brodal, Gerth St{\\o}lting and Pinotti, M. Cristina},\nLANGUAGE = {eng},\nNUMBER = {MPI-I-1998-1-002},\nINSTITUTION = {Max-Planck-Institut f{\\"u}r Informatik},\nADDRESS = {Saarbr{\\"u}cken},\nYEAR = {1998},\nDATE = {1998},\nABSTRACT = {Comparator networks for constructing binary heaps of size $n$ are presented which have size $O(n\\log\\log n)$ and depth $O(\\log n)$. A lower bound of $n\\log\\log n-O(n)$ for the size of any heap construction network is also proven, implying that the networks presented are within a constant factor of optimal. We give a tight relation between the leading constants in the size of selection networks and in the size of heap constructiion networks.},\nTYPE = {Research Report / Max-Planck-Institut f\xc3\xbcr Informatik},\n}\n'