Sign In

Login

Password

Forgot Password ? Sign Up

Soft heap (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Soft heap" in English language version.

refsWebsite
Global rank English rank
6doi.org
2nd place
2nd place
2psu.edu
207th place
136th place
2ams.org
451st place
277th place
1princeton.edu
741st place
577th place
1semanticscholar.org
11th place
8th place
1siam.org
low place
6,473rd place

ams.org

mathscinet.ams.org

doi.org

  • Chazelle, Bernard (November 2000). "The soft heap: an approximate priority queue with optimal error rate" (PDF). Journal of the ACM. 47 (6): 1012–1027. CiteSeerX 10.1.1.5.9705. doi:10.1145/355541.355554. S2CID 12556140.
  • Kaplan, Haim; Zwick, Uri (2009). "A simpler implementation and analysis of Chazelle's soft heaps". Proceedings of the Nineteenth Annual ACM–SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics. pp. 477–485. CiteSeerX 10.1.1.215.6250. doi:10.1137/1.9781611973068.53. ISBN 978-0-89871-680-1.
  • Kaplan, Haim; Tarjan, Robert E.; Zwick, Uri (2013). "Soft heaps simplified". SIAM Journal on Computing. 42 (4): 1660–1673. doi:10.1137/120880185. MR 3084181.
  • Thorup, Mikkel; Zamir, Or; Zwick, Uri (2019). "Dynamic ordered sets with approximate queries, approximate heaps and soft heaps". In Baier, Christel; Chatzigiannakis, Ioannis; Flocchini, Paola; Leonardi, Stefano (eds.). 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9–12, 2019, Patras, Greece. LIPIcs. Vol. 132. Schloss Dagstuhl – Leibniz-Zentrum für Informatik. pp. 95:1–95:13. doi:10.4230/LIPICS.ICALP.2019.95.
  • Chazelle, Bernard (2000). "A minimum spanning tree algorithm with inverse-Ackermann type complexity". Journal of the ACM. 47 (6): 1028–1047. doi:10.1145/355541.355562. MR 1866456.
  • Kaplan, Haim; Kozma, László; Zamir, Or; Zwick, Uri (2019). "Selection from heaps, row-sorted matrices, and X+Y using soft heaps". In Fineman, Jeremy T.; Mitzenmacher, Michael (eds.). 2nd Symposium on Simplicity in Algorithms, SOSA 2019, January 8–9, 2019, San Diego, CA, USA. OASIcs. Vol. 69. Schloss Dagstuhl – Leibniz-Zentrum für Informatik. pp. 5:1–5:21. doi:10.4230/OASICS.SOSA.2019.5.

princeton.edu

cs.princeton.edu

  • Chazelle, Bernard (November 2000). "The soft heap: an approximate priority queue with optimal error rate" (PDF). Journal of the ACM. 47 (6): 1012–1027. CiteSeerX 10.1.1.5.9705. doi:10.1145/355541.355554. S2CID 12556140.

psu.edu

citeseerx.ist.psu.edu

  • Chazelle, Bernard (November 2000). "The soft heap: an approximate priority queue with optimal error rate" (PDF). Journal of the ACM. 47 (6): 1012–1027. CiteSeerX 10.1.1.5.9705. doi:10.1145/355541.355554. S2CID 12556140.
  • Kaplan, Haim; Zwick, Uri (2009). "A simpler implementation and analysis of Chazelle's soft heaps". Proceedings of the Nineteenth Annual ACM–SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics. pp. 477–485. CiteSeerX 10.1.1.215.6250. doi:10.1137/1.9781611973068.53. ISBN 978-0-89871-680-1.

semanticscholar.org

api.semanticscholar.org

  • Chazelle, Bernard (November 2000). "The soft heap: an approximate priority queue with optimal error rate" (PDF). Journal of the ACM. 47 (6): 1012–1027. CiteSeerX 10.1.1.5.9705. doi:10.1145/355541.355554. S2CID 12556140.

siam.org

epubs.siam.org