Sign In

Login

Password

Forgot Password ? Sign Up

Fusion tree (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Fusion tree" in English language version.

refsWebsite
Global rank English rank
7doi.org
2nd place
2nd place
4ams.org
451st place
277th place
3semanticscholar.org
11th place
8th place
2arxiv.org
69th place
59th place

ams.org (Global: 451st place; English: 277th place)

mathscinet.ams.org

arxiv.org (Global: 69th place; English: 59th place)

doi.org (Global: 2nd place; English: 2nd place)

  • Fredman, M. L.; Willard, D. E. (1990), "BLASTING Through the Information Theoretic Barrier with FUSION TREES", Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing (STOC '90), New York, NY, USA: ACM, pp. 1–7, doi:10.1145/100216.100217, ISBN 0-89791-361-2, S2CID 16367160.
  • Andersson, Arne; Miltersen, Peter Bro; Thorup, Mikkel (1999), "Fusion trees can be implemented with AC0 instructions only", Theoretical Computer Science, 215 (1–2): 337–344, doi:10.1016/S0304-3975(98)00172-8, MR 1678804.
  • Raman, Rajeev (1996), "Priority queues: small, monotone and trans-dichotomous", Algorithms — ESA '96, Lecture Notes in Computer Science, vol. 1136, Berlin: Springer-Verlag, pp. 121–137, doi:10.1007/3-540-61680-2_51, ISBN 978-3-540-61680-1, MR 1469229.
  • Andersson, Arne; Thorup, Mikkel (2007), "Dynamic ordered sets with exponential search trees", Journal of the ACM, 54 (3): A13, arXiv:cs/0210006, doi:10.1145/1236457.1236460, MR 2314255, S2CID 8175703.
  • Patrascu, Mihai; Thorup, Mikkel (2014). "Dynamic Integer Sets with Optimal Rank, Select, and Predecessor Search". 2014 IEEE 55th Annual Symposium on Foundations of Computer Science. p. 166-175. arXiv:1408.3045. doi:10.1109/FOCS.2014.26. ISBN 978-1-4799-6517-5. S2CID 8943659.
  • Willard, Dan E. (2000), "Examining computational geometry, van Emde Boas trees, and hashing from the perspective of the fusion tree", SIAM Journal on Computing, 29 (3): 1030–1049, doi:10.1137/S0097539797322425, MR 1740562.
  • Ben-Amram, Amir M.; Galil, Zvi (1997), "When Can We Sort in o(n log n) Time?", Journal of Computer and System Sciences, 54 (2): 345–370, doi:10.1006/jcss.1997.1474.

semanticscholar.org (Global: 11th place; English: 8th place)

api.semanticscholar.org

  • Fredman, M. L.; Willard, D. E. (1990), "BLASTING Through the Information Theoretic Barrier with FUSION TREES", Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing (STOC '90), New York, NY, USA: ACM, pp. 1–7, doi:10.1145/100216.100217, ISBN 0-89791-361-2, S2CID 16367160.
  • Andersson, Arne; Thorup, Mikkel (2007), "Dynamic ordered sets with exponential search trees", Journal of the ACM, 54 (3): A13, arXiv:cs/0210006, doi:10.1145/1236457.1236460, MR 2314255, S2CID 8175703.
  • Patrascu, Mihai; Thorup, Mikkel (2014). "Dynamic Integer Sets with Optimal Rank, Select, and Predecessor Search". 2014 IEEE 55th Annual Symposium on Foundations of Computer Science. p. 166-175. arXiv:1408.3045. doi:10.1109/FOCS.2014.26. ISBN 978-1-4799-6517-5. S2CID 8943659.