מבנה נתונים תמציתי (Hebrew Wikipedia)

Analysis of information sources in references of the Wikipedia article "מבנה נתונים תמציתי" in Hebrew language version.

refsWebsite

Global rank Hebrew rank

2cmu.edu

1,564^th place

1,516^th place

2web.archive.org

1^st place

6^th place

2doi.org

2^nd place

10^th place

1unisa.it

low place

1computer.org

5,196^th place

2,423^rd place

1uchile.cl

2,951^st place

low place

1uwaterloo.ca

3,153^rd place

1,812^th place

1unimi.it

9,889^th place

low place

1mit.edu

415^th place

289^th place

1sourceforge.net

1,669^th place

4,336^th place

cmu.edu

cs.cmu.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 (PDF). pp. 233–242. ISBN 0-89871-513-X.
Brodnik, A.; J. I Munro (1999). "Membership in constant time and almost-minimum space" (PDF). SIAM J. Comput. pp. 1627–1640. doi:10.1137/S0097539795294165.

computer.org

Jacobson, G. (1989). "Space-efficient static trees and graphs" (PDF).

doi.org

Vigna, S. (2008). "Broadword implementation of rank/select queries" (PDF). Experimental Algorithms. Lecture Notes in Computer Science. pp. 154–168. doi:10.1007/978-3-540-68552-4_12. ISBN 978-3-540-68548-7. אורכב מ-המקור (PDF) ב-2016-06-11. נבדק ב-2017-01-02.
Brodnik, A.; J. I Munro (1999). "Membership in constant time and almost-minimum space" (PDF). SIAM J. Comput. pp. 1627–1640. doi:10.1137/S0097539795294165.

mit.edu

people.csail.mit.edu

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

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". Poster Proceedings Volume of 4th Workshop on Efficient and Experimental Algorithms (WEA) (PDF). 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. pp. 154–168. doi:10.1007/978-3-540-68552-4_12. ISBN 978-3-540-68548-7. אורכב מ-המקור (PDF) ב-2016-06-11. נבדק ב-2017-01-02.

unisa.it

dmi.unisa.it

Sadakane, K.; R. Grossi (2006). "Squeezing succinct data structures into entropy bounds". Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm (PDF). pp. 1230–1239. ISBN 0-89871-605-5. אורכב מ-המקור (PDF) ב-2011-09-29. נבדק ב-2017-01-02.

uwaterloo.ca

uwspace.uwaterloo.ca

Clark, D. (1998). "Compact pat trees" (PDF).

web.archive.org

Sadakane, K.; R. Grossi (2006). "Squeezing succinct data structures into entropy bounds". Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm (PDF). pp. 1230–1239. ISBN 0-89871-605-5. אורכב מ-המקור (PDF) ב-2011-09-29. נבדק ב-2017-01-02.
Vigna, S. (2008). "Broadword implementation of rank/select queries" (PDF). Experimental Algorithms. Lecture Notes in Computer Science. pp. 154–168. doi:10.1007/978-3-540-68552-4_12. ISBN 978-3-540-68548-7. אורכב מ-המקור (PDF) ב-2016-06-11. נבדק ב-2017-01-02.