▁the ▁ 2 0 0 6 ▁Winter ▁Olympics ▁Category : O lymp ic ▁ske leton ▁rac ers ▁of ▁the ▁United ▁States <0x0A> </s> ▁A ▁Kin etic ▁He ater ▁is ▁a ▁kin etic ▁priority ▁queue ▁similar ▁to ▁a ▁kin etic ▁heap , ▁that ▁makes ▁use ▁of ▁random ization ▁to ▁simplify ▁its ▁analysis ▁in ▁a ▁way ▁similar ▁to ▁a ▁tre ap . ▁Specifically , ▁each ▁element ▁has ▁a ▁random ▁key ▁associated ▁with ▁it ▁in ▁addition ▁to ▁its ▁priority ▁( which ▁changes ▁as ▁a ▁continuous ▁function ▁of ▁time ▁as ▁in ▁all ▁kin etic ▁data ▁structures ). ▁The ▁kin etic ▁he ater ▁is ▁then ▁simultaneously ▁a ▁binary ▁search ▁tree ▁on ▁the ▁element ▁keys , ▁and ▁a ▁heap ▁on ▁the ▁element ▁prior ities . ▁The ▁kin etic ▁he ater ▁ach ieves ▁( expected ) ▁asympt otic ▁performance ▁bounds ▁equal ▁to ▁the ▁best ▁kin etic ▁priority ▁que ues . ▁In ▁practice ▁however , ▁it ▁is ▁less ▁efficient ▁since ▁the ▁extra ▁random ▁keys ▁need ▁to ▁be ▁stored , ▁and ▁the ▁procedure ▁to ▁handle ▁certificate ▁failure ▁is ▁a ▁( rel atively ▁complicated ) ▁rotation ▁instead ▁of ▁a ▁simple ▁swap . ▁ ▁Im plementation ▁ ▁If ▁every ▁element ▁has ▁a ▁key ▁and ▁a ▁priority ▁associated ▁with ▁it , ▁then ▁there ▁is ▁a ▁unique ▁tree ▁structure ▁that ▁is ▁simultaneously ▁a ▁search ▁tree ▁on ▁the ▁keys ▁and ▁a ▁heap ▁on ▁the ▁prior ities ▁- ▁this ▁structure ▁corresponds ▁to ▁the ▁tre ap ▁( if ▁the ▁prior ities ▁are ▁randomly ▁chosen ) ▁or ▁the ▁kin etic ▁he ater ▁( if ▁the ▁keys ▁are ▁randomly ▁chosen ).