b'@techreport{Mikkel97,'b'\nTITLE = {Faster deterministic sorting and priority queues in linear space},\nAUTHOR = {Thorup, Mikkel},\nLANGUAGE = {eng},\nNUMBER = {MPI-I-1997-1-016},\nINSTITUTION = {Max-Planck-Institut f{\\"u}r Informatik},\nADDRESS = {Saarbr{\\"u}cken},\nYEAR = {1997},\nDATE = {1997},\nABSTRACT = {The RAM complexity of deterministic linear space sorting of integers in words is improved from $O(n\\sqrt{\\log n})$ to $O(n(\\log\\log n)^2)$. No better bounds are known for polynomial space. In fact, the techniques give a deterministic linear space priority queue supporting insert and delete in $O((\\log\\log n)^2)$ amortized time and find-min in constant time. The priority queue can be implemented using addition, shift, and bit-wise boolean operations.},\nTYPE = {Research Report / Max-Planck-Institut f\xc3\xbcr Informatik},\n}\n'