Pfannkuchen-Sortierproblem (German Wikipedia)

Analysis of information sources in references of the Wikipedia article "Pfannkuchen-Sortierproblem" in German language version.

refsWebsite
Global rank German rank
2nd place
3rd place
1,960th place
130th place
1st place
1st place

doi.org

  • William H. Gates, Christos Papadimitriou: Bounds for Sorting by Prefix Reversal. In: Discrete Mathematics, Vol. 27, 1979, S. 47–57. doi:10.1016/0012-365X(79)90068-2; cs.berkeley.edu (Memento vom 10. Juni 2007 im Internet Archive) (PDF)
  • B. Chitturi, W. Fahle, Z. Meng, L. Morales, C. O. Shields, I. H. Sudborough, W. Voit: An upper bound for sorting by prefix reversals. In: Theoretical Computer Science. 410, Nr. 36, 2009, S. 3372–3390. doi:10.1016/j.tcs.2008.04.045.
  • David S. Cohen, Manuel Blum: On the problem of sorting burnt pancakes. In: Discrete Applied Mathematics, 61, Nr. 2, 1995, S. 105–120, doi:10.1016/0166-218X(94)00009-3.

spektrum.de

web.archive.org