存储一个最坏情况下访问时间为0(1)的稀疏表

23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) Pub Date : 1982-11-03 DOI:10.1145/828.1884

M. Fredman, J. Komlos, E. Szemerédi

{"title":"存储一个最坏情况下访问时间为0(1)的稀疏表","authors":"M. Fredman, J. Komlos, E. Szemerédi","doi":"10.1145/828.1884","DOIUrl":null,"url":null,"abstract":"We describe a data structure for representing a set of n items from a universe of m items, which uses space n+o(n) and accommodates membership queries in constant time. Both the data structure and the query algorithm are easy to implement.","PeriodicalId":127919,"journal":{"name":"23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1982-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"949","resultStr":"{\"title\":\"Storing a sparse table with O(1) worst case access time\",\"authors\":\"M. Fredman, J. Komlos, E. Szemerédi\",\"doi\":\"10.1145/828.1884\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We describe a data structure for representing a set of n items from a universe of m items, which uses space n+o(n) and accommodates membership queries in constant time. Both the data structure and the query algorithm are easy to implement.\",\"PeriodicalId\":127919,\"journal\":{\"name\":\"23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1982-11-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"949\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/828.1884\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/828.1884","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 949

摘要

我们描述了一种数据结构，用于表示来自m个项目的全域的n个项目的集合，它使用空间n+o(n)，并在常量时间内容纳成员查询。数据结构和查询算法都易于实现。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Storing a sparse table with O(1) worst case access time

We describe a data structure for representing a set of n items from a universe of m items, which uses space n+o(n) and accommodates membership queries in constant time. Both the data structure and the query algorithm are easy to implement.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)

自引率

0.00%

发文量