咨询与建议

限定检索结果

文献类型

  • 1 篇 期刊文献
  • 1 篇 会议

馆藏范围

  • 2 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 2 篇 工学
    • 2 篇 计算机科学与技术...

主题

  • 2 篇 succinct data st...
  • 2 篇 cell probe compl...
  • 2 篇 polynomial evalu...

机构

  • 2 篇 univ aarhus dept...
  • 2 篇 univ texas dept ...

作者

  • 2 篇 miltersen peter ...
  • 2 篇 gal anna

语言

  • 2 篇 英文
检索条件"主题词=polynomial evaluation with preprocessing"
2 条 记 录,以下是1-10 订阅
排序:
The cell probe complexity of succinct data structures
收藏 引用
THEORETICAL COMPUTER SCIENCE 2007年 第3期379卷 405-417页
作者: Gal, Anna Miltersen, Peter Bro Univ Aarhus Dept Comp Sci Aarhus Denmark Univ Texas Dept Comp Sci Austin TX 78712 USA
We consider time-space tradeoffs for static data structure problems in the cell probe model with word size I (the bit probe model). In this model, the goal is to represent n -bit data with s = n + r bits such that que... 详细信息
来源: 评论
The cell probe complexity of succinct data structures
The cell probe complexity of succinct data structures
收藏 引用
30th International Colloquium on Automata, Languages and Programming (ICALP 2003)
作者: Gal, Anna Miltersen, Peter Bro Univ Aarhus Dept Comp Sci Aarhus Denmark Univ Texas Dept Comp Sci Austin TX 78712 USA
We consider time-space tradeoffs for static data structure problems in the cell probe model with word size I (the bit probe model). In this model, the goal is to represent n -bit data with s = n + r bits such that que... 详细信息
来源: 评论