هرم جفت‌شده (Persian Wikipedia)

Analysis of information sources in references of the Wikipedia article "هرم جفت‌شده" in Persian language version.

refsWebsite

Global rank Persian rank

8doi.org

2^nd place

3web.archive.org

1^st place

2arxiv.org

69^th place

253^rd place

2psu.edu

207^th place

287^th place

1cmu.edu

1,564^th place

2,712^th place

1mpg.de

1,624^th place

2,889^th place

1poly.edu

low place

1uqac.ca

7,201^st place

low place

1umich.edu

459^th place

742^nd place

1siam.org

low place

arxiv.org

Iacono, John (2000). Improved upper bounds for pairing heaps (PDF). Proc. 7th Scandinavian Workshop on Algorithm Theory. Lecture Notes in Computer Science. Vol. 1851. Springer-Verlag. pp. 63–77. arXiv:1110.4428. doi:10.1007/3-540-44985-X_5. ISBN 978-3-540-67690-4. Archived from the original (PDF) on 24 December 2012. Retrieved 6 May 2016.
Larkin, Daniel H.; Sen, Siddhartha; Tarjan, Robert E. (2014), "A back-to-basics empirical study of priority queues", Proceedings of the 16th Workshop on Algorithm Engineering and Experiments, pp. 61–72, arXiv:1403.0252, doi:10.1137/1.9781611973198.7

cmu.edu

cs.cmu.edu

Fredman, Michael L.; Sedgewick, Robert; Sleator, Daniel D.; Tarjan, Robert E. (1986). "The pairing heap: a new form of self-adjusting heap" (PDF). Algorithmica. 1 (1): 111–129. doi:10.1007/BF01840439.

doi.org

Fredman, Michael L.; Sedgewick, Robert; Sleator, Daniel D.; Tarjan, Robert E. (1986). "The pairing heap: a new form of self-adjusting heap" (PDF). Algorithmica. 1 (1): 111–129. doi:10.1007/BF01840439.
Iacono, John (2000). Improved upper bounds for pairing heaps (PDF). Proc. 7th Scandinavian Workshop on Algorithm Theory. Lecture Notes in Computer Science. Vol. 1851. Springer-Verlag. pp. 63–77. arXiv:1110.4428. doi:10.1007/3-540-44985-X_5. ISBN 978-3-540-67690-4. Archived from the original (PDF) on 24 December 2012. Retrieved 6 May 2016.
Stasko, John T.; Vitter, Jeffrey S. (1987), "Pairing heaps: experiments and analysis", Communications of the ACM, 30 (3): 234–249, doi:10.1145/214748.214759, CiteSeerX: 10.1.1.106.2988
Fredman, Michael L. (1999). "On the efficiency of pairing heaps and related data structures" (PDF). Journal of the ACM. 46 (4): 473–501. doi:10.1145/320211.320214. Archived from the original (PDF) on 21 July 2011. Retrieved 6 May 2016.
Pettie, Seth (2005), "Towards a final analysis of pairing heaps" (PDF), Proc. 46th Annual IEEE Symposium on Foundations of Computer Science, pp. 174–183, doi:10.1109/SFCS.2005.75, ISBN 0-7695-2468-0
Elmasry, Amr (2009), "Pairing heaps with $O(\log \log n)$ decrease cost" (PDF), Proc. 20th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 471–476, doi:10.1137/1.9781611973068.52, archived from the original (PDF) on 18 اكتبر 2012, retrieved 6 May 2016 {{citation}}: Check date values in: |archive-date= (help)
Larkin, Daniel H.; Sen, Siddhartha; Tarjan, Robert E. (2014), "A back-to-basics empirical study of priority queues", Proceedings of the 16th Workshop on Algorithm Engineering and Experiments, pp. 61–72, arXiv:1403.0252, doi:10.1137/1.9781611973198.7
Moret, Bernard M. E.; Shapiro, Henry D. (1991), "An empirical analysis of algorithms for constructing a minimum spanning tree", Proc. 2nd Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science, vol. 519, Springer-Verlag, pp. 400–411, doi:10.1007/BFb0028279, ISBN 3-540-54343-0, CiteSeerX: 10.1.1.53.5960

mpg.de

people.mpi-inf.mpg.de

Mehlhorn, Kurt; Sanders, Peter (2008). Algorithms and Data Structures: The Basic Toolbox (PDF). Springer. p. 231.

poly.edu

john2.poly.edu

Iacono, John (2000). Improved upper bounds for pairing heaps (PDF). Proc. 7th Scandinavian Workshop on Algorithm Theory. Lecture Notes in Computer Science. Vol. 1851. Springer-Verlag. pp. 63–77. arXiv:1110.4428. doi:10.1007/3-540-44985-X_5. ISBN 978-3-540-67690-4. Archived from the original (PDF) on 24 December 2012. Retrieved 6 May 2016.

psu.edu

citeseerx.ist.psu.edu

Stasko, John T.; Vitter, Jeffrey S. (1987), "Pairing heaps: experiments and analysis", Communications of the ACM, 30 (3): 234–249, doi:10.1145/214748.214759, CiteSeerX: 10.1.1.106.2988
Moret, Bernard M. E.; Shapiro, Henry D. (1991), "An empirical analysis of algorithms for constructing a minimum spanning tree", Proc. 2nd Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science, vol. 519, Springer-Verlag, pp. 400–411, doi:10.1007/BFb0028279, ISBN 3-540-54343-0, CiteSeerX: 10.1.1.53.5960

siam.org

Elmasry, Amr (2009), "Pairing heaps with $O(\log \log n)$ decrease cost" (PDF), Proc. 20th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 471–476, doi:10.1137/1.9781611973068.52, archived from the original (PDF) on 18 اكتبر 2012, retrieved 6 May 2016 {{citation}}: Check date values in: |archive-date= (help)

umich.edu

eecs.umich.edu

Pettie, Seth (2005), "Towards a final analysis of pairing heaps" (PDF), Proc. 46th Annual IEEE Symposium on Foundations of Computer Science, pp. 174–183, doi:10.1109/SFCS.2005.75, ISBN 0-7695-2468-0

uqac.ca

wwwens.uqac.ca

Fredman, Michael L. (1999). "On the efficiency of pairing heaps and related data structures" (PDF). Journal of the ACM. 46 (4): 473–501. doi:10.1145/320211.320214. Archived from the original (PDF) on 21 July 2011. Retrieved 6 May 2016.

web.archive.org

Iacono, John (2000). Improved upper bounds for pairing heaps (PDF). Proc. 7th Scandinavian Workshop on Algorithm Theory. Lecture Notes in Computer Science. Vol. 1851. Springer-Verlag. pp. 63–77. arXiv:1110.4428. doi:10.1007/3-540-44985-X_5. ISBN 978-3-540-67690-4. Archived from the original (PDF) on 24 December 2012. Retrieved 6 May 2016.
Fredman, Michael L. (1999). "On the efficiency of pairing heaps and related data structures" (PDF). Journal of the ACM. 46 (4): 473–501. doi:10.1145/320211.320214. Archived from the original (PDF) on 21 July 2011. Retrieved 6 May 2016.
Elmasry, Amr (2009), "Pairing heaps with $O(\log \log n)$ decrease cost" (PDF), Proc. 20th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 471–476, doi:10.1137/1.9781611973068.52, archived from the original (PDF) on 18 اكتبر 2012, retrieved 6 May 2016 {{citation}}: Check date values in: |archive-date= (help)