随机输入有助于搜索前辈
Random input helps searching predecessors
摘要:
我们解决了高概率(whp)在恒定时间的动态前置问题,只使用$n^{1+δ}$位的内存,任何常数$δ> 0$。输入密钥是随机的wrt更广泛的一类研究和实际上重要的一类$(f_1, f_2)$ -光滑分布中介绍的\cite{and:mat}。它实现了O(1)whp摊销时间。其最差情况时间为$O(\sqrt{\frac{\log n}{\log \log n}})$。此外,我们证明了只使用$n^{1+ \frac{1}{\log \log n}}= n^{1+o(1)}$位的whp $O(\log \log \log n)$时间。最后,我们用O(n)空间证明了whp $O(\log \log n)$时间.
英文摘要:
We solve the dynamic Predecessor Problem with high probability (whp) in constant time, using only $n^{1+δ}$ bits of memory, for any constant $δ> 0$. The input keys are random wrt a wider class of the well studied and practically important class of $(f_1, f_2)$-smooth distributions introduced in \cite{and:mat}. It achieves O(1) whp amortized time. Its worst-case time is $O(\sqrt{\frac{\log n}{\log \log n}})$. Also, we prove whp $O(\log \log \log n)$ time using only $n^{1+ \frac{1}{\log \log n}}= n^{1+o(1)}$ bits. Finally, we show whp $O(\log \log n)$ time using O(n) space.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。