首页> 外文会议>International Conference on Logic for Programming, Artificial Intelligence, and Reasoning(LPAR 2005); 20051202-06; Montego Bay(JM) >Computational Issues in Exploiting Dependent And-Parallelism in Logic Programming: Leftness Detection in Dynamic Search Trees
【24h】

Computational Issues in Exploiting Dependent And-Parallelism in Logic Programming: Leftness Detection in Dynamic Search Trees

机译:利用逻辑程序中的相依与并行的计算问题:动态搜索树中的左侧检测

获取原文
获取原文并翻译 | 示例

摘要

We present efficient Pure Pointer Machine (PPM) algorithms to test for "leftness" in dynamic search trees and related problems. In particular, we show that the problem of testing if a node x is in the leftmost branch of the subtree rooted in node y, in a dynamic tree that grows and shrinks at the leaves, can be solved on PPMs in worst-case O((lg lg n)~2 time per operation in the semi-dynamic case-i.e., all the operations that add leaves to the tree are performed before any other operations-where n is the number of operations that affect the structure of the tree. We also show that the problem can be solved on PPMs in amortized O((lg lg n)~2) time per operation in the fully dynamic case.
机译:我们提出了有效的Pure Pointer Machine(PPM)算法,以测试动态搜索树和相关问题中的“左侧”。特别地,我们表明,在最坏情况O下,可以在PPM上解决测试节点x是否位于以y为根的子树的最左分支中的问题。在半动态情况下,每个操作需要花费(lg lg n)〜2次-即,所有将叶子添加到树的操作都在任何其他操作之前执行-其中n是影响树的结构的操作数。我们还表明,在全动态情况下,可以在每次操作的摊销O((lg lg n)〜2)时间中解决PPM问题。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号