Succinct data structure (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Succinct data structure" in English language version.

refsWebsite

Global rank English rank

18doi.org

2^nd place

5arxiv.org

69^th place

59^th place

4semanticscholar.org

11^th place

8^th place

3psu.edu

207^th place

136^th place

2web.archive.org

1^st place

2worldcat.org

5^th place

1archive.org

6^th place

1unisa.it

low place

1computer.org

5,196^th place

3,635^th place

1uchile.cl

2,951^st place

6,086^th place

1uwaterloo.ca

3,153^rd place

2,332^nd place

1unimi.it

9,889^th place

low place

1cmu.edu

1,564^th place

1,028^th place

1mit.edu

415^th place

327^th place

1handle.net

102^nd place

76^th place

1quantamagazine.org

6,413^th place

4,268^th place

1sourceforge.net

1,669^th place

1,290^th place

archive.org

Raman, R.; V. Raman; S. S Rao (2002). "Succinct indexable dictionaries with applications to encoding k-ary trees and multisets". Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms. pp. 233–242. arXiv:0705.0552. CiteSeerX 10.1.1.246.3123. doi:10.1145/1290672.1290680. ISBN 0-89871-513-X.

arxiv.org

Raman, R.; V. Raman; S. S Rao (2002). "Succinct indexable dictionaries with applications to encoding k-ary trees and multisets". Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms. pp. 233–242. arXiv:0705.0552. CiteSeerX 10.1.1.246.3123. doi:10.1145/1290672.1290680. ISBN 0-89871-513-X.
Assadi, Sepehr; Farach-Colton, Martín; Kuszmaul, William (January 2023), "Tight Bounds for Monotone Minimal Perfect Hashing", Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Philadelphia, PA: Society for Industrial and Applied Mathematics, pp. 456–476, arXiv:2207.10556, doi:10.1137/1.9781611977554.ch20, ISBN 978-1-61197-755-4, retrieved 2023-04-28
Bender, Michael A.; Farach-Colton, Martín; Kuszmaul, John; Kuszmaul, William; Liu, Mingmou (2022-06-09). "On the optimal time/Space tradeoff for hash tables". Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. New York, NY, USA: ACM. pp. 1284–1297. arXiv:2111.00602. doi:10.1145/3519935.3519969. hdl:1721.1/146419. ISBN 9781450392648. S2CID 240354692.
Li, Tianxiao; Liang, Jingxun; Yu, Huacheng; Zhou, Renfei (2023). "Tight Cell-Probe Lower Bounds for Dynamic Succinct Dictionaries". arXiv:2306.02253 [cs.DS].
Yu, Huacheng (2020-06-22). "Nearly optimal static Las Vegas succinct dictionary". Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. New York, NY, USA: ACM. pp. 1389–1401. arXiv:1911.01348. doi:10.1145/3357713.3384274. ISBN 9781450369794. S2CID 207780523.

cmu.edu

cs.cmu.edu

Brodnik, A.; J. I Munro (1999). "Membership in constant time and almost-minimum space" (PDF). SIAM J. Comput. 28 (5): 1627–1640. CiteSeerX 10.1.1.530.9223. doi:10.1137/S0097539795294165.

computer.org

Jacobson, G. (1 November 1989). Space-efficient static trees and graphs (PDF). 30th IEEE Symposium on Foundations of Computer Science. doi:10.1109/SFCS.1989.63533. Archived from the original (PDF) on 2016-03-12.

doi.org

Raman, R.; V. Raman; S. S Rao (2002). "Succinct indexable dictionaries with applications to encoding k-ary trees and multisets". Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms. pp. 233–242. arXiv:0705.0552. CiteSeerX 10.1.1.246.3123. doi:10.1145/1290672.1290680. ISBN 0-89871-513-X.
Jacobson, G. (1 November 1989). Space-efficient static trees and graphs (PDF). 30th IEEE Symposium on Foundations of Computer Science. doi:10.1109/SFCS.1989.63533. Archived from the original (PDF) on 2016-03-12.
Vigna, S. (2008). "Broadword Implementation of Rank/Select Queries" (PDF). Experimental Algorithms. Lecture Notes in Computer Science. Vol. 5038. pp. 154–168. CiteSeerX 10.1.1.649.8950. doi:10.1007/978-3-540-68552-4_12. ISBN 978-3-540-68548-7. S2CID 13963489.
Brodnik, A.; J. I Munro (1999). "Membership in constant time and almost-minimum space" (PDF). SIAM J. Comput. 28 (5): 1627–1640. CiteSeerX 10.1.1.530.9223. doi:10.1137/S0097539795294165.
Belazzougui, Djamal; Boldi, Paolo; Pagh, Rasmus; Vigna, Sebastiano (2009-01-04). "Monotone Minimal Perfect Hashing: Searching a Sorted Table with O(1) Accesses". Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics: 785–794. doi:10.1137/1.9781611973068.86. ISBN 978-0-89871-680-1.
Assadi, Sepehr; Farach-Colton, Martín; Kuszmaul, William (January 2023), "Tight Bounds for Monotone Minimal Perfect Hashing", Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Philadelphia, PA: Society for Industrial and Applied Mathematics, pp. 456–476, arXiv:2207.10556, doi:10.1137/1.9781611977554.ch20, ISBN 978-1-61197-755-4, retrieved 2023-04-28
Raman, Rajeev; Rao, Satti Srinivasa (2003), "Succinct Dynamic Dictionaries and Trees", Automata, Languages and Programming, Berlin, Heidelberg: Springer Berlin Heidelberg, pp. 357–368, doi:10.1007/3-540-45061-0_30, ISBN 978-3-540-40493-4, retrieved 2023-04-28
Bender, Michael A.; Farach-Colton, Martín; Kuszmaul, John; Kuszmaul, William; Liu, Mingmou (2022-06-09). "On the optimal time/Space tradeoff for hash tables". Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. New York, NY, USA: ACM. pp. 1284–1297. arXiv:2111.00602. doi:10.1145/3519935.3519969. hdl:1721.1/146419. ISBN 9781450392648. S2CID 240354692.
Pagh, Rasmus (1998-01-28). "Low Redundancy in Dictionaries with O(1) Worst Case Lookup Time". BRICS Report Series. 5 (28). doi:10.7146/brics.v5i28.19434. ISSN 1601-5355.
Pagh, Rasmus (January 2001). "Low Redundancy in Static Dictionaries with Constant Query Time". SIAM Journal on Computing. 31 (2): 353–363. doi:10.1137/s0097539700369909. ISSN 0097-5397.
Patrascu, Mihai (October 2008). "Succincter". 2008 49th Annual IEEE Symposium on Foundations of Computer Science. IEEE. pp. 305–313. doi:10.1109/focs.2008.83. ISBN 978-0-7695-3436-7. S2CID 257721481.
Yu, Huacheng (2020-06-22). "Nearly optimal static Las Vegas succinct dictionary". Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. New York, NY, USA: ACM. pp. 1389–1401. arXiv:1911.01348. doi:10.1145/3357713.3384274. ISBN 9781450369794. S2CID 207780523.

dx.doi.org

Assadi, Sepehr; Farach-Colton, Martín; Kuszmaul, William (January 2023), "Tight Bounds for Monotone Minimal Perfect Hashing", Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Philadelphia, PA: Society for Industrial and Applied Mathematics, pp. 456–476, arXiv:2207.10556, doi:10.1137/1.9781611977554.ch20, ISBN 978-1-61197-755-4, retrieved 2023-04-28
Raman, Rajeev; Rao, Satti Srinivasa (2003), "Succinct Dynamic Dictionaries and Trees", Automata, Languages and Programming, Berlin, Heidelberg: Springer Berlin Heidelberg, pp. 357–368, doi:10.1007/3-540-45061-0_30, ISBN 978-3-540-40493-4, retrieved 2023-04-28
Bender, Michael A.; Farach-Colton, Martín; Kuszmaul, John; Kuszmaul, William; Liu, Mingmou (2022-06-09). "On the optimal time/Space tradeoff for hash tables". Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. New York, NY, USA: ACM. pp. 1284–1297. arXiv:2111.00602. doi:10.1145/3519935.3519969. hdl:1721.1/146419. ISBN 9781450392648. S2CID 240354692.
Pagh, Rasmus (January 2001). "Low Redundancy in Static Dictionaries with Constant Query Time". SIAM Journal on Computing. 31 (2): 353–363. doi:10.1137/s0097539700369909. ISSN 0097-5397.
Patrascu, Mihai (October 2008). "Succincter". 2008 49th Annual IEEE Symposium on Foundations of Computer Science. IEEE. pp. 305–313. doi:10.1109/focs.2008.83. ISBN 978-0-7695-3436-7. S2CID 257721481.
Yu, Huacheng (2020-06-22). "Nearly optimal static Las Vegas succinct dictionary". Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. New York, NY, USA: ACM. pp. 1389–1401. arXiv:1911.01348. doi:10.1145/3357713.3384274. ISBN 9781450369794. S2CID 207780523.

handle.net

hdl.handle.net

Bender, Michael A.; Farach-Colton, Martín; Kuszmaul, John; Kuszmaul, William; Liu, Mingmou (2022-06-09). "On the optimal time/Space tradeoff for hash tables". Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. New York, NY, USA: ACM. pp. 1284–1297. arXiv:2111.00602. doi:10.1145/3519935.3519969. hdl:1721.1/146419. ISBN 9781450392648. S2CID 240354692.

mit.edu

people.csail.mit.edu

Pătraşcu, M. (2008). "Succincter" (PDF). Foundations of Computer Science, 2008. FOCS'08. IEEE 49th Annual IEEE Symposium on. pp. 305–313.

psu.edu

citeseerx.ist.psu.edu

Raman, R.; V. Raman; S. S Rao (2002). "Succinct indexable dictionaries with applications to encoding k-ary trees and multisets". Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms. pp. 233–242. arXiv:0705.0552. CiteSeerX 10.1.1.246.3123. doi:10.1145/1290672.1290680. ISBN 0-89871-513-X.
Vigna, S. (2008). "Broadword Implementation of Rank/Select Queries" (PDF). Experimental Algorithms. Lecture Notes in Computer Science. Vol. 5038. pp. 154–168. CiteSeerX 10.1.1.649.8950. doi:10.1007/978-3-540-68552-4_12. ISBN 978-3-540-68548-7. S2CID 13963489.
Brodnik, A.; J. I Munro (1999). "Membership in constant time and almost-minimum space" (PDF). SIAM J. Comput. 28 (5): 1627–1640. CiteSeerX 10.1.1.530.9223. doi:10.1137/S0097539795294165.

quantamagazine.org

Nadis, Steve (8 February 2024). "Scientists Find Optimal Balance of Data Storage and Time". Quanta Magazine.

semanticscholar.org

api.semanticscholar.org

Vigna, S. (2008). "Broadword Implementation of Rank/Select Queries" (PDF). Experimental Algorithms. Lecture Notes in Computer Science. Vol. 5038. pp. 154–168. CiteSeerX 10.1.1.649.8950. doi:10.1007/978-3-540-68552-4_12. ISBN 978-3-540-68548-7. S2CID 13963489.
Bender, Michael A.; Farach-Colton, Martín; Kuszmaul, John; Kuszmaul, William; Liu, Mingmou (2022-06-09). "On the optimal time/Space tradeoff for hash tables". Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. New York, NY, USA: ACM. pp. 1284–1297. arXiv:2111.00602. doi:10.1145/3519935.3519969. hdl:1721.1/146419. ISBN 9781450392648. S2CID 240354692.
Patrascu, Mihai (October 2008). "Succincter". 2008 49th Annual IEEE Symposium on Foundations of Computer Science. IEEE. pp. 305–313. doi:10.1109/focs.2008.83. ISBN 978-0-7695-3436-7. S2CID 257721481.
Yu, Huacheng (2020-06-22). "Nearly optimal static Las Vegas succinct dictionary". Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. New York, NY, USA: ACM. pp. 1389–1401. arXiv:1911.01348. doi:10.1145/3357713.3384274. ISBN 9781450369794. S2CID 207780523.

sourceforge.net

cmph.sourceforge.net

Belazzougui, Djamal. "Hash, displace, and compress" (PDF).

uchile.cl

dcc.uchile.cl

González, R.; S. Grabowski; V. Mäkinen; G. Navarro (2005). "Practical implementation of rank and select queries" (PDF). Poster Proceedings Volume of 4th Workshop on Efficient and Experimental Algorithms (WEA). pp. 27–38.

unimi.it

sux.di.unimi.it

Vigna, S. (2008). "Broadword Implementation of Rank/Select Queries" (PDF). Experimental Algorithms. Lecture Notes in Computer Science. Vol. 5038. pp. 154–168. CiteSeerX 10.1.1.649.8950. doi:10.1007/978-3-540-68552-4_12. ISBN 978-3-540-68548-7. S2CID 13963489.

unisa.it

dmi.unisa.it

Sadakane, K.; R. Grossi (2006). "Squeezing succinct data structures into entropy bounds" (PDF). Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm. pp. 1230–1239. ISBN 0-89871-605-5. Archived from the original (PDF) on 2011-09-29.

uwaterloo.ca

uwspace.uwaterloo.ca

Clark, David (1996). Compact pat trees (PDF) (Ph.D. thesis). University of Waterloo.

web.archive.org

Sadakane, K.; R. Grossi (2006). "Squeezing succinct data structures into entropy bounds" (PDF). Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm. pp. 1230–1239. ISBN 0-89871-605-5. Archived from the original (PDF) on 2011-09-29.
Jacobson, G. (1 November 1989). Space-efficient static trees and graphs (PDF). 30th IEEE Symposium on Foundations of Computer Science. doi:10.1109/SFCS.1989.63533. Archived from the original (PDF) on 2016-03-12.

worldcat.org

search.worldcat.org

Pagh, Rasmus (1998-01-28). "Low Redundancy in Dictionaries with O(1) Worst Case Lookup Time". BRICS Report Series. 5 (28). doi:10.7146/brics.v5i28.19434. ISSN 1601-5355.
Pagh, Rasmus (January 2001). "Low Redundancy in Static Dictionaries with Constant Query Time". SIAM Journal on Computing. 31 (2): 353–363. doi:10.1137/s0097539700369909. ISSN 0097-5397.