|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
23rd Annual Symposium on Foundations of Computer Science (FOCS 1982)
Storing a sparse table with O(1) worst case access time
November 03-November 05
| ASCII Text | x | ||
| Michael L. Fredman, Janos Komlos, Endre Szemeredi, "Storing a sparse table with O(1) worst case access time," Foundations of Computer Science, IEEE Annual Symposium on, pp. 165-169, 23rd Annual Symposium on Foundations of Computer Science (FOCS 1982), 1982. | |||
| BibTex | x | ||
| @article{ 10.1109/SFCS.1982.89, author = {Michael L. Fredman and Janos Komlos and Endre Szemeredi}, title = {Storing a sparse table with O(1) worst case access time}, journal ={Foundations of Computer Science, IEEE Annual Symposium on}, volume = {0}, year = {1982}, issn = {0272-5428}, pages = {165-169}, doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.1982.89}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Foundations of Computer Science, IEEE Annual Symposium on TI - Storing a sparse table with O(1) worst case access time SN - 0272-5428 SP165 EP169 A1 - Michael L. Fredman, A1 - Janos Komlos, A1 - Endre Szemeredi, PY - 1982 VL - 0 JA - Foundations of Computer Science, IEEE Annual Symposium on ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SFCS.1982.89
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.
Citation:
Michael L. Fredman, Janos Komlos, Endre Szemeredi, "Storing a sparse table with O(1) worst case access time," focs, pp.165-169, 23rd Annual Symposium on Foundations of Computer Science (FOCS 1982), 1982
Usage of this product signifies your acceptance of the Terms of Use.