Palacsintagráf (Hungarian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Palacsintagráf" in Hungarian language version.

refsWebsite

Global rank Hungarian rank

11doi.org

2^nd place

8^th place

3web.archive.org

1^st place

2sciencedirect.com

149^th place

249^th place

1springer.com

274^th place

438^th place

1arxiv.org

69^th place

778^th place

1ccis2k.org

low place

1uz.zgora.pl

low place

1nsysu.edu.tw

low place

1nsc.ru

6,956^th place

low place

1mathnet.ru

8,783^rd place

low place

1berkeley.edu

580^th place

467^th place

1webcitation.org

24^th place

46^th place

1utdallas.edu

low place

1wiley.com

222^nd place

312^th place

1ieee.org

652^nd place

1,967^th place

arxiv.org

Deng, Yun-Ping (2012. március 31.). „Automorphism Groups of the Pancake Graphs”. Information Processing Letters 112 (7), 264–266. o. DOI:10.1016/j.ipl.2011.12.010.

berkeley.edu

cs.berkeley.edu

Gates, W. (1979). „Bounds for Sorting by Prefix Reversal”. Discrete Mathematics 27, 47–57. o. [2007. június 10-i dátummal az eredetiből archiválva]. DOI:10.1016/0012-365X(79)90068-2. (Hozzáférés: 2017. augusztus 3.)

ccis2k.org

Nguyen, Quan (2009. november 5.). „On the Genus of Pancake Network.”. The International Arab Journal of Information Technology 8 (3), 289–292. o. [2017. augusztus 9-i dátummal az eredetiből archiválva]. (Hozzáférés: 2017. augusztus 3.)

doi.org

dx.doi.org

Asai, Shogo (2006. szeptember 1.). „Computing the Diameter of 17-Pancake Graph Using a PC Cluster.”. Euro-Par 2006 Parallel Processing: 12th International Euro-Par Conference. DOI:10.1007/11823285_117.
Deng, Yun-Ping (2012. március 31.). „Automorphism Groups of the Pancake Graphs”. Information Processing Letters 112 (7), 264–266. o. DOI:10.1016/j.ipl.2011.12.010.
Konstantinova, Elena (2017. augusztus 1.). „Chromatic Properties of the Pancake Graphs.”. Discussiones Mathematicae Graph Theory 37 (3), 777–787. o. DOI:10.7151/dmgt.1978.
Konstantinova, E.V. (2010. április 1.). „Cycles of length seven in the pancake graph”. Diskretn. Anal. Issled. Oper. 17 (5), 46–55. o. DOI:10.1016/j.tcs.2008.04.045.
Gates, W. (1979). „Bounds for Sorting by Prefix Reversal”. Discrete Mathematics 27, 47–57. o. [2007. június 10-i dátummal az eredetiből archiválva]. DOI:10.1016/0012-365X(79)90068-2. (Hozzáférés: 2017. augusztus 3.)
Chitturi, B. (2009. augusztus 31.). „An (18/11)n upper bound for sorting by prefix reversals”. Theoretical Computer Science 410 (36), 3372–3390. o. DOI:10.1016/j.tcs.2008.04.045.
„Pancake Flipping Is Hard”. Journal of Computer and System Sciences 81, 1556–1574. o. DOI:10.1016/j.jcss.2015.02.003.
Akl, S.G. (1993. január 26.). „Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry.”. Networks 23 (4), 215–225. o. DOI:10.1002/net.3230230403.
Bass, D.W. (2003. március 1.). „Pancake problems with restricted prefix reversals and some corresponding Cayley networks.”. Journal of Parallel and Distributed Computing 63 (3), 327–336. o. DOI:10.1016/S0743-7315(03)00033-9.
Berthomé, P. (1996. december 1.). „Optimal information dissemination in star and pancake networks.”. IEEE Transactions on Parallel and Distributed Systems 7 (12), 1292–1300. o. DOI:10.1109/71.553290.

doi.org

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.

ieee.org

ieeexplore.ieee.org

Berthomé, P. (1996. december 1.). „Optimal information dissemination in star and pancake networks.”. IEEE Transactions on Parallel and Distributed Systems 7 (12), 1292–1300. o. DOI:10.1109/71.553290.

mathnet.ru

Konstantinova, E.V. (2010. április 1.). „Cycles of length seven in the pancake graph”. Diskretn. Anal. Issled. Oper. 17 (5), 46–55. o. DOI:10.1016/j.tcs.2008.04.045.

nsc.ru

math.nsc.ru

Konstantinova, E.V. (2013. április 26.). „Small cycles in the Pancake graph”. Ars Mathematica Contemporanea 7, 237–246. o. [2017. december 15-i dátummal az eredetiből archiválva]. (Hozzáférés: 2017. augusztus 4.)

nsysu.edu.tw

par.cse.nsysu.edu.tw

Sheu, Jyh-Jian (2006. január 26.). „Cycle embedding in pancake interconnection networks.”. The 23rd Workshop on Combinatorial Mathematics and Computation Theory.

sciencedirect.com

Compeau, Phillip E.C. (2011. szeptember 6.). „Girth of pancake graphs”. Discrete Applied Mathematics 159 (15), 1641–1645. o.
Chitturi, B. (2009. augusztus 31.). „An (18/11)n upper bound for sorting by prefix reversals”. Theoretical Computer Science 410 (36), 3372–3390. o. DOI:10.1016/j.tcs.2008.04.045.

springer.com

link.springer.com

Asai, Shogo (2006. szeptember 1.). „Computing the Diameter of 17-Pancake Graph Using a PC Cluster.”. Euro-Par 2006 Parallel Processing: 12th International Euro-Par Conference. DOI:10.1007/11823285_117.

utdallas.edu

Team Bests Young Bill Gates With Improved Answer to So-Called Pancake Problem in Mathematics. University of Texas at Dallas News Center, 2008. szeptember 17. [2012. április 5-i dátummal az eredetiből archiválva]. (Hozzáférés: 2008. november 10.) „A team of UT Dallas computer science students and their faculty adviser have improved upon a longstanding solution to a mathematical conundrum known as the pancake problem. The previous best solution, which stood for almost 30 years, was devised by Bill Gates and one of his Harvard instructors, Christos Papadimitriou, several years before Microsoft was established.”

uz.zgora.pl

discuss.wmie.uz.zgora.pl

Konstantinova, Elena (2017. augusztus 1.). „Chromatic Properties of the Pancake Graphs.”. Discussiones Mathematicae Graph Theory 37 (3), 777–787. o. DOI:10.7151/dmgt.1978.

web.archive.org

Nguyen, Quan (2009. november 5.). „On the Genus of Pancake Network.”. The International Arab Journal of Information Technology 8 (3), 289–292. o. [2017. augusztus 9-i dátummal az eredetiből archiválva]. (Hozzáférés: 2017. augusztus 3.)
Konstantinova, E.V. (2013. április 26.). „Small cycles in the Pancake graph”. Ars Mathematica Contemporanea 7, 237–246. o. [2017. december 15-i dátummal az eredetiből archiválva]. (Hozzáférés: 2017. augusztus 4.)
Gates, W. (1979). „Bounds for Sorting by Prefix Reversal”. Discrete Mathematics 27, 47–57. o. [2007. június 10-i dátummal az eredetiből archiválva]. DOI:10.1016/0012-365X(79)90068-2. (Hozzáférés: 2017. augusztus 3.)

webcitation.org

Team Bests Young Bill Gates With Improved Answer to So-Called Pancake Problem in Mathematics. University of Texas at Dallas News Center, 2008. szeptember 17. [2012. április 5-i dátummal az eredetiből archiválva]. (Hozzáférés: 2008. november 10.) „A team of UT Dallas computer science students and their faculty adviser have improved upon a longstanding solution to a mathematical conundrum known as the pancake problem. The previous best solution, which stood for almost 30 years, was devised by Bill Gates and one of his Harvard instructors, Christos Papadimitriou, several years before Microsoft was established.”

wiley.com

onlinelibrary.wiley.com

Akl, S.G. (1993. január 26.). „Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry.”. Networks 23 (4), 215–225. o. DOI:10.1002/net.3230230403.