b'@techreport{Sibeyn1999,'b'\nTITLE = {Ultimate parallel list ranking?},\nAUTHOR = {Sibeyn, Jop},\nLANGUAGE = {eng},\nNUMBER = {MPI-I-1999-1-005},\nINSTITUTION = {Max-Planck-Institut f{\\"u}r Informatik},\nADDRESS = {Saarbr{\\"u}cken},\nYEAR = {1999},\nDATE = {1999},\nABSTRACT = {Two improved list-ranking algorithms are presented. The ``peeling-off\'\' algorithm leads to an optimal PRAM algorithm, but was designed with application on a real parallel machine in mind. It is simpler than earlier algorithms, and in a range of problem sizes, where previously several algorithms where required for the best performance, now this single algorithm suffices. If the problem size is much larger than the number of available processors, then the ``sparse-ruling-sets\'\' algorithm is even better. In previous versions this algorithm had very restricted practical application because of the large number of communication rounds it was performing. This main weakness of this algorithm is overcome by adding two new ideas, each of which reduces the number of communication rounds by a factor of two.},\nTYPE = {Research Report / Max-Planck-Institut f\xc3\xbcr Informatik},\n}\n'